{
  "handle": "ConceptualDecomposition",
  "mechanism": "The cognitive act of carving a concept into the differentiated dimensions it needs across every case it claims, rather than the steps of one way of achieving it. A claim frame is stated first: the concept, the purpose of the carve and the range of cases it claims. The concept is then located by climbing {{specialization_edge}} links to broader kinds, each step naming the genus and the differentia and searching for siblings, and the carve is made on the route back down. Candidate dimensions are generated and each is put to the {{decomposition_gate}} tests; a failed or uncertain candidate is reframed, narrowed or kept with its verdict as a labelled alternative in the frontier of the {{archive_serving_frontier}}. A bounded search then looks for any dimension the accepted set still misses, and a {{routing_sanity_check}} routes concrete cases through the carve before it is kept. Accepted dimensions are bound to the concept by {{composition_edge}} links, and the carve declares the {{synthesis}} by which they together make the whole. Each dimension is itself a concept, carved again the same way wherever the {{marginal_value_rule}} says further depth pays. A dimension is something every claimed case has. Where cases instead fall into mutually exclusive kinds, the division can be one dimension, a classification axis, but its alternative values are kinds of the concept, linked by {{specialization_edge}} rather than bound as parts by {{composition_edge}}. Generic {{decompose}} splits one task into independent subproblems whose solutions combine into the whole; this method carves a concept across every case it claims and adds what that needs: the claim frame, the location among broader kinds, the Necessity and Universality tests, the search for missing dimensions and the routing of real cases.",
  "gloss": "Finding what a concept is made of: locate it, carve it into the dimensions every case it claims needs, test each, search for what is missing, route real cases through it, say how the parts make the whole, and carve again below",
  "invariants": [
    "The claim frame is stated before any candidate is tested.",
    "The concept is located among broader kinds before it is carved.",
    "Only candidates that pass the {{decomposition_gate}} tests become dimensions.",
    "The carve declares the {{synthesis}} by which its dimensions make the whole; a concept with no available synthesis is not carved.",
    "Each accepted dimension can be carved again by the same procedure."
  ],
  "failure_modes": [
    "Procedural carve: the concept is split into the steps of one way of doing it rather than the dimensions it needs, so the carve fits one workflow and not the concept.",
    "Carve in place: the concept is carved as it was stated, without being located among broader kinds, so the carve inherits the stated framing.",
    "Coupled split: two dimensions cannot vary or fail separately; the Independence test can miss overlap that is semantic rather than structural.",
    "Fitted routing: the cases routed through the carve are chosen after it is made, so the check confirms the carve instead of testing it.",
    "Shallow carve: accepted dimensions are not carved in turn where depth would pay, so the result is a list rather than a tree."
  ],
  "_meta": {
    "tier": 1,
    "ring": 1,
    "path": [
      "Mind",
      "Reasoning"
    ],
    "supersedes": [
      "sema:ConceptualDecomposition#mh:SHA-256:2cce877b501c3fe1fdf646e3c5ad3157b26502b7a6f7c943dfff389c055aa25a",
      "sema:ConceptualDecomposition#mh:SHA-256:3cf20e30a632b0a7ab64a7fb2984fe64b106ba7819af458fa5e260aa89853b1d",
      "sema:ConceptualDecomposition#mh:SHA-256:cdf87329a5b75a1ccb9a01275f7467abaadaefcd4b77f0576ae954aee3f386be",
      "sema:ConceptualDecomposition#mh:SHA-256:40d9cc8428747ad32e921a0317e560d14031e656cfd10089992ddf161dc0e450",
      "sema:ConceptualDecomposition#mh:SHA-256:9a528d55f1912607b569a1663dbf4f1946e2c1bfb8facf20c4e124ebe65f43bc",
      "sema:ConceptualDecomposition#mh:SHA-256:d0fc6e67c984608fb949bed69ba7e5e3bc022b45bfe173042eec4846b33a5538"
    ],
    "related": [
      "MandatoryAbstraction",
      "SolverDecomposition"
    ]
  },
  "sema_id": "sema:ConceptualDecomposition#mh:SHA-256:f1f430fc38f3944d3a02b34e0ae04d4004a002795b375b665f1ebb7a4e57b264",
  "sema_ref": "ConceptualDecomposition#f1f4",
  "sema_stub": "f1f4",
  "dependencies": {
    "composes_with": {
      "decomposition_gate": "sema:DecompositionGate#mh:SHA-256:1b2d7263900f2721658ea188e416b2c53cb14c4ce13f35b9b82728f68fcfe7c5",
      "synthesis": "sema:Synthesis#mh:SHA-256:4f1fecba4183e6a79bfb3bd8f1981a6b6fb9f3dced92a484a9aa466c93ae249b"
    },
    "references": {
      "archive_serving_frontier": "sema:ArchiveServingFrontier#mh:SHA-256:27653c08dbb23917a945b15020bbdabae18ccc9256dda0d2249354896d4a4313",
      "composition_edge": "sema:CompositionEdge#mh:SHA-256:2be81d974795a345a4518b540b6110bed48e2e1fc084363193dc0bb609616bbb",
      "decompose": "sema:Decompose#mh:SHA-256:69942e7e0dcdc7781144da58c8f09b2e8a17c247be435dadf3325cb0d0bbb22b",
      "marginal_value_rule": "sema:MarginalValueRule#mh:SHA-256:661109205c507b2c26d683d091de7f8b782bf2d6c2e9192373b242a9b078ac71",
      "routing_sanity_check": "sema:RoutingSanityCheck#mh:SHA-256:71bdf79f3d471779f7312d699718cab13efef2db27d45873aeb0e91e35c73a8b",
      "specialization_edge": "sema:SpecializationEdge#mh:SHA-256:4d203b9383c917cc241dc8b4ab9cf6a48eb0113f86b60a0dda5cf3defb8b3017"
    }
  },
  "sema_layer": "Mind",
  "sema_category": "Reasoning",
  "used_by": {
    "composes_with": {
      "CollaborativeWritingProtocol": "sema:CollaborativeWritingProtocol#mh:SHA-256:b4f1605942df96d393c4d121541cc52d5810d6898bdc36c1d59023d7cd1f196a",
      "DiscoveryProtocol": "sema:DiscoveryProtocol#mh:SHA-256:5c8e74ee9833090e8bc5e91f373e165f885cd7b23f79bb55c6127d783ba9d96b",
      "EthicalReasoningProtocol": "sema:EthicalReasoningProtocol#mh:SHA-256:ee5d0dd9dd7779976d299bfa0ad1721c120b0c1a64fdd1c46299356fb5aa9c8e",
      "HumanEmulatorProtocol": "sema:HumanEmulatorProtocol#mh:SHA-256:96cab650ec75ad1c4fbd8b1c900bcd6d9ae9e06b010be633724d280d64ad8b5d",
      "TemporalEnsembleForecasting": "sema:TemporalEnsembleForecasting#mh:SHA-256:810231b383308aceaf2a7629297262bc6ee4d812db4c05daf0f6549d0b5b5234",
      "TruthseekingProtocol": "sema:TruthseekingProtocol#mh:SHA-256:8e4f01c73a2bb4e0989ceb100c74c4703a99437fbc55fc1d5cb4238bcd257c30"
    },
    "references": {
      "GeneralProblemSolvingProtocol": "sema:GeneralProblemSolvingProtocol#mh:SHA-256:7ad457a8f3c6dd35e024c94c900ce5b0771fdd3adff7cedd660fbefef8ba87ac"
    },
    "extends": {
      "SolverDecomposition": "sema:SolverDecomposition#mh:SHA-256:ff4b4921d148c7672540eb0ec6201e5eed9b7c06b6442c6525399a856f121bfa"
    }
  }
}