Classification¶
Core Idea¶
Classification is the deliberate process of assigning entities to discrete categories according to explicitly defined rules, as Bowker and Star (1999) characterize in their treatment of classification systems and their consequences. [1] It is distinct from the static property of belonging to a set; classification names the work of sorting, the act by which items are evaluated against criteria and placed into bins, a distinction Murphy (2002) develops in his synthesis of categorization research. [2] The outcome—which items belong where—establishes a structured landscape for reasoning, decision-making, and action. The category structure itself is what carries meaning: a classification system embodies choices about what properties matter, how boundaries are drawn, and what purposes the grouping serves. Classification is foundational across biology (Linnaean taxonomy), medicine (nosology and ICD coding), machine learning (supervised learning), library science (subject hierarchies), and law (offense categories and procedural rules), and in each domain it solves the same core problem: how to reduce infinite variation into finite, manageable categories that preserve relevant distinctions, as Sokal and Sneath (1963) systematized in their foundational work on numerical taxonomy. [3]
How would you explain it like I'm…
Sorting Into Bins
Sorting By Rules
Rule-Based Category Assignment
Structural Signature¶
Classification encodes a structural pattern: entities → criteria → assignment rule → category structure → decision/action. It separates heterogeneous items into homogeneous groups, creating a stable map where similar items cluster and dissimilar items are separated, a pattern Smith and Medin (1981) document across the empirical and theoretical literature on category structure. [4]
Recurring features:
- Assigning discrete entities to predefined categories
- Applying consistent rules to distinguish items
- Drawing boundaries between categories
- Handling edge cases and borderline membership
- Reifying categories through repeated use
- Using classification to enable consistent policies
The structural insight generalizes: once a classification system exists, it becomes the substrate for downstream reasoning. A physician diagnosing via ICD codes can apply standardized treatment protocols; a machine-learning classifier can make predictions on new data; a librarian can retrieve books by subject; a judge can apply sentencing guidelines. Classification transforms ad-hoc judgment into reproducible rules, as Hastie, Tibshirani, and Friedman (2009) formalize in their canonical treatment of statistical learning. [5]
What It Is Not¶
Classification is not mere categorization or informal grouping. Informal grouping ("things I like," "stuff in this drawer") lacks explicit rules and permits arbitrary boundaries; classification insists on criteria and justification, a requirement Bruner, Goodnow, and Austin (1956) made central to their experimental study of concept attainment. [6] A classification system must be learnable: someone else, given the same criteria, should be able to assign items in the same way.
Nor is classification identical to taxonomy, though the terms are often used interchangeably. Taxonomy is a particular kind of classification—hierarchical, nested, with parent-child relationships—but classification as a general concept includes flat lists (spam/not-spam), multiple independent dimensions (file systems organized by type and owner), and fuzzy boundaries (clustering algorithms). Taxonomy is a structural choice within classification.
Classification is also not a discovery of natural kinds. A natural kind is a grouping that carves nature at its joints (water, electron, depression); classification is often a practical invention. The DSM-5 classification of mental disorders does not claim to discover pre-existing mental kinds; it clusters symptoms and presentations in ways useful for treatment and communication. This distinction matters because it shifts responsibility: classification systems are human-made tools serving particular purposes, not revelations of hidden order, a point Quine (1969) develops in his philosophical analysis of natural kinds. [7]
Broad Use¶
Biology and ecology: Linnaean taxonomy organizes organisms by kingdom, phylum, class, order, family, genus, species. Modern phylogenetic classification uses DNA sequence to infer evolutionary relatedness. Classification enables comparative anatomy, biogeography, and conservation biology.
Library science and information retrieval: Dewey Decimal System and Library of Congress Classification assign books to subject hierarchies. Medical Library Subject Headings (MeSH) index biomedical literature. These systems allow librarians and users to browse and retrieve materials by topic.
Machine learning and artificial intelligence: Supervised classification assigns data points to learned categories (email: spam/not-spam; image: cat/dog/bird; sentiment: positive/neutral/negative/mixed). Decision trees, logistic regression, support-vector machines, and neural networks learn classifiers from labeled training data, building on foundational pattern-classification results such as Cover and Hart (1967) on nearest-neighbor decision rules. [8] Classification enables automated decision-making at scale.
Medicine and epidemiology: ICD-10 codes classify diagnoses, procedures, and health conditions for billing, epidemiology, and treatment guidelines. DSM-5 classifies psychiatric conditions. Cancer staging (TNM system) classifies tumor burden. These systems standardize communication across providers and enable population-level research.
Information security and records management: Classification levels (public, internal, confidential, secret, top-secret) determine access controls, retention policies, and handling procedures. Document classification systems assign materials by content type, owner, legal status, or compliance requirement. Proper classification prevents unauthorized disclosure.
Law and criminal justice: Offense categories (felony/misdemeanor, Class A/B/C) determine sentencing ranges and procedural rights. Case law classification enables precedent-based reasoning. Patent classification organizes inventions by domain and function. Hart (1961) analyzes these classificatory practices as constitutive of legal systems, distinguishing primary rules of conduct from secondary rules of recognition, change, and adjudication. [9]
Clarity¶
A core function of "classification" is to name the rule-based assignment process itself, separating the act of classifying from the result of having classified. This clarity highlights three things: (1) classification is active and ongoing, not passive or finished (reclassification happens when categories change or evidence shifts); (2) classification systems are human decisions, designed by people with particular purposes, subject to revision; (3) the same entity can be classified differently under different systems (a person might be classified as "high-risk criminal" under a criminal-justice classification, "low-income" under a wealth classification, and "uninsured" under a health-insurance classification), as Hacking (1999) develops in his philosophical analysis of "looping kinds" and the dynamic, human-designed character of classification. [10]
This clarity also deflates a common confusion: that categories exist independently, waiting to be discovered. Categories are tools. A novel classification system (e.g., classifying people by their genetic predispositions rather than by phenotype, or classifying books by network patterns of citations rather than by subject) reorganizes the same underlying entities and enables different questions.
Manages Complexity¶
Classification reduces information overload by creating stable, finite schemas to manage infinite variation. Without classification, a library with millions of books would be a chaos; a patent office with millions of filings would be unsearchable; a medical provider facing a patient with symptoms would have no basis for diagnosis. Classification makes it possible to apply consistent rules, policies, treatments, or algorithms to large populations without evaluating each item independently, a scaling property Ranganathan (1933) made explicit in designing the first faceted (analytico-synthetic) library classification. [11]
It also enables aggregation and statistical reasoning. Once items are classified, counts and rates become meaningful: prevalence of a disease (percentage of population in ICD code X), spam detection rates (percentage of emails classified as spam), recall and precision of a classifier. These aggregates inform policy and improvement.
A third complexity-management function is delegation and scalability. Once a classification system is established and documented, others can apply it without deep domain expertise. Medical coders can apply ICD-10 codes; email filters can apply spam classifiers; new members can apply library classification schemes. This scaling is only possible because classification replaces ad-hoc judgment with explicit rules. The same property has a shadow side: the sharp boundaries that enable consistent, scalable application also flatten continuous underlying variation, treating cases just inside and just outside a category as categorically different when they may be near-identical—the very mismatch Zadeh (1965) addressed by introducing fuzzy sets, in which membership is graded rather than crisp. [12]
Abstract Reasoning¶
Classification sharpens questions about boundaries, membership, and purpose. What makes two entities belong to the same category? What property or properties define the boundary between categories? Why do we care about this particular categorization rather than another? Rosch (1978) frames these as the central questions of categorization, governed by the dual principles of cognitive economy and perceived-world structure. [13]
When classification boundaries are sharp (species defined by reproductive isolation) or fuzzy (depression as a spectrum rather than a binary diagnosis), the reasoning differs. Sharp boundaries permit clean logic; fuzzy boundaries require probabilistic or threshold-based thinking. Understanding which kind of boundary a classification claims enables more honest reasoning about edge cases.
Classification also encourages thinking about reification: the risk that a category, once named and used, begins to feel like a real thing rather than a practical tool. "Mental illness" starts as a classification but can become reified as a biological entity with a discoverable essence. "Race" started as a classification but has been repeatedly reified as a natural kind (with false consequences). Rigorous abstract reasoning about classification helps practitioners distinguish the map (the classification system) from the territory (the entities being classified).
Knowledge Transfer¶
The pattern—define criteria, apply rules consistently, handle edge cases—transfers across domains, as Hennig (1966) demonstrated in cladistics by formalizing biological classification through shared derived characters, a methodology since adapted to fields well beyond systematics. [14] A quality-control auditor classifying manufactured parts (pass/reject) uses the same structure as a medical diagnostician classifying patients (healthy/sick/at-risk) or a content moderator classifying posts (allow/remove/escalate). The vocabulary differs, but the reasoning is parallel: What are the criteria? How do we apply them consistently? What do we do with borderline cases? What also transfers is a critical caveat: every classification system is situated in a purpose, a perspective, and a set of values, and is therefore never fully neutral — moving the system from one domain to another carries those embedded commitments along, as Foucault (1970) argues in his archaeology of how the human sciences impose epistemic order. [15]
Tools like decision trees, decision matrices, and rubrics transfer directly. A rubric for assessing student essays in English class uses the same logic as a rubric for evaluating patent applications, evaluating grant proposals, or assessing software-code quality. The criteria are domain-specific, but the structure—explicit dimensions, standard levels within each dimension, guidance for edge cases—is universal.
Machine-learning transfer learning directly exploits this pattern: a classifier trained to recognize objects in one domain (e.g., cat/dog/bird classification from ImageNet) can be adapted with minimal retraining to a new domain (e.g., medical imaging classification). The underlying structure of the classification problem transfers; only the data and fine-tuning details change.
Examples¶
Formal/abstract¶
Biological taxonomy: Humans are classified in the Linnaean system as Kingdom Animalia, Phylum Chordata, Class Mammalia, Order Primates, Family Hominidae, Genus Homo, Species sapiens. Each classification step uses explicit criteria: mammals produce milk and have hair (distinguishing from reptiles); primates have forward-facing eyes and grasping hands (distinguishing from other mammals); Homo sapiens is distinguished from H. neanderthalensis by skull morphology and DNA. The classification is nested and hierarchical: all sapiens are Homo, all Homo are primates, all primates are mammals, all mammals are animals. This structure enables reasoning: if a property is true of all mammals (warm-bloodedness), it is automatically true of all humans. Mapped back: The nested structure makes classification efficient: instead of describing each species anew, each level inherits properties from its parent. In software, class hierarchies (inheritance) use the same logic. In organizational structures, departments nested in divisions nested in companies use the same hierarchical classification principle. The structure transfers; the domain details differ.
Machine-learning classifier (formal): A spam detector is trained on a dataset of emails labeled "spam" and "not-spam." The classifier learns a decision boundary in feature space (word frequencies, sender reputation, link patterns). Once trained, the classifier assigns new emails to categories based on whether they fall on the spam side or not-spam side of the boundary. The classifier also produces a confidence score: how far from the boundary does the email fall? A confidence score allows for a three-class system (high confidence spam, low confidence/ambiguous, high confidence not-spam) or a threshold strategy (only filter emails above 99% confidence as spam, allowing some spam to pass to reduce false positives). Mapped back: The classifier is a formal instantiation of classification: explicit criteria (learned feature weights), consistent rule application (the decision boundary), and explicit handling of edge cases (ambiguous emails near the boundary). The same structure appears in medical diagnosis: a patient's symptoms, lab values, and imaging results are features; the classifier (the physician, or a diagnostic decision-support system) assigns the patient to a diagnosis category; a confidence score guides further testing or specialist referral when the classification is ambiguous. The formal structure is the same; interpretation differs.
Applied/industry¶
Medical diagnosis (ICD-10 coding): A patient presents with fever, cough, and chest pain. The physician performs history, physical examination, and imaging. Based on these findings, the physician classifies the condition as "community-acquired pneumonia" and assigns ICD-10 code J18.9. This classification decision triggers downstream actions: antibiotic choice is guided by pneumonia protocols; billing codes determine insurance reimbursement; epidemiologic surveillance tracks pneumonia prevalence. If the patient's presentation is atypical (fever present but imaging is clear), the classification becomes ambiguous: pneumonia vs. viral infection vs. early-stage bacterial infection. Guidelines recommend either a trial of antibiotics with reassessment in 48 hours, or additional testing (procalcitonin, blood culture). The classification system handles this edge case through explicit guidance on borderline cases. Mapped back: The structure mirrors biological taxonomy and machine learning: criteria (symptoms, imaging, lab values) are mapped to categories (diagnoses); rules are applied consistently (evidence-based protocols); edge cases are anticipated and addressed (guidelines for ambiguous presentations). The same structure allows for scale: thousands of coders apply the same ICD-10 system, producing comparable, aggregatable data across hospitals and countries.
Software library and component classification: A software component library organizes thousands of reusable functions and data structures. Components are classified by multiple independent dimensions: by functional domain (networking, cryptography, graphics, data structures); by maturity level (experimental, stable, deprecated); by license (MIT, GPL, commercial); by performance characteristics (O(n) sorting vs. O(n log n), memory-intensive vs. lightweight). A developer searching for a sorting algorithm can filter by domain (data structures), maturity (stable), and license (compatible with her project's license). The classification system enables rapid discovery and reuse. When a component is reclassified from "stable" to "deprecated" (a security flaw is discovered), dependent codebases can be automatically flagged for review. Mapped back: This exemplifies classification without nesting: the dimensions are independent (a component can be high-performance and low-maturity, or low-performance and stable). The key insight is that the same entity can be classified along multiple axes, and each axis enables different queries and actions. In records management, documents are classified by content type, owner, security level, and retention policy—independent dimensions enabling targeted retrieval and compliance checks.
Structural Tensions¶
T1: Sharp boundaries enable consistent rules but hide continuous variation. Classification systems draw boundaries (college/high-school, employed/unemployed, cancer/precancer) that make decision-making tractable. But nearly all biological and social phenomena vary continuously; the boundary is a human choice, not a discovery. Lowering the boundary for "college-level" writing ability includes more students but may include students unprepared for college rigor. Raising it excludes capable students. The same tension exists in medical diagnosis: at what point does hypertension warrant treatment? Cholesterol level warrant intervention? Once a boundary is drawn and institutionalized, variation near the boundary causes conflict and appeals. Some classification systems (income thresholds for benefits) explicitly acknowledge fuzziness by creating transition zones; others pretend boundaries are sharp (species defined by reproductive isolation) and suffer when evidence violates the assumption.
T2: Lumpers vs. splitters: fine-grained classification captures nuance but sacrifices usability. More categories (finer distinction) allow for more precise reasoning but burden users with complexity: more categories to learn, more rules to apply, higher likelihood of misclassification. Fewer categories (coarser grouping) are easier to use but erase distinctions. The DSM has expanded from ~100 diagnoses (DSM-I, 1950s) to ~300 (DSM-5, 2013); psychiatrists gain precision but face decision paralysis. Biomedical ontologies (SNOMED CT) include millions of concepts; they capture nuance but are nearly unusable without computational support. Library classification systems balance this by nesting: a broad category (fiction) can be divided into finer subcategories (mystery, science fiction, romance) only when needed. The tension is fundamental: classification always trades specificity for usability.
T3: Classifier accuracy vs. interpretability: high-performance classifiers often sacrifice explainability. A neural network or random forest can achieve 95% accuracy on a classification task but be a black box: practitioners cannot explain why a particular email was classified as spam, or why a loan application was denied. A simpler classifier (logistic regression, decision tree) is interpretable: the rules can be stated and understood. In high-stakes domains (medical diagnosis, criminal justice, hiring decisions), interpretability is critical: patients, defendants, and applicants deserve to understand why a decision was made. But interpretable models often sacrifice accuracy. This tension is especially acute in machine learning, where practitioners must choose between high accuracy (and opacity) and lower accuracy (but explainability).
T4: Classification reifies categories and risks naturalizing arbitrary choices. Once a category is named, institutionalized, and used repeatedly, it begins to feel like a natural kind, as if it reflects reality rather than a particular choice of boundaries. IQ classification (genius/high/average/low/profound intellectual disability) was once treated as carving nature at its joints; now it is widely recognized as a useful tool with limited predictive power beyond narrow domains. Similarly, psychiatric diagnoses are now understood as consensus tools, not discoveries of natural categories. But the reification persists: patients internalize "I have depression" as an identity, not as "I have been classified as having depression under a system designed for communication and treatment guidance." The more a classification system is used, the stronger the reification; this can provide stability (everyone agrees on the category) or can entrench categories that should be revised (continued use of an outdated taxonomy).
T5: Classification as power: those who define categories control meaning and outcomes. The choice of categories determines what is visible, what is possible, and what outcomes accrue. Racial classification systems have been invented, revised, and abandoned with profound social consequences. Gender classification (binary male/female, or nonbinary options) determines access to bathrooms, sports categories, and legal recognition. Criminal classification (felony vs. misdemeanor, violent vs. non-violent) determines sentencing. These classifications are not discovered; they are decisions by those with power to make them. This is not a defect of classification itself but a reminder that classification is always a political act. The tension is that classification is necessary (we must be able to talk about what we mean) and simultaneously dangerous (whoever defines categories shapes reality for others).
T6: Static categories in a dynamic world: classification systems lag behind the phenomena they classify. A classification system is typically stable over years or decades (ICD-10 is the standard medical classification; Linnaean taxonomy has been foundational for 250+ years). But the world changes: new diseases emerge (COVID-19), new forms of crime appear (cybercrime), new social categories demand recognition. A classification system that is too rigid becomes outdated and generates misclassifications; one that is too fluid loses its benefit of consistency and shared understanding. The tension is acute in technology: software frameworks are classified by programming paradigm (object-oriented, functional, event-driven), but modern frameworks blend paradigms, making the categories obsolete. Similarly, jobs and occupations are classified by industry and function, but remote work, gig work, and portfolio careers blur the boundaries. The question is not whether to revise classifications but how often and how to maintain continuity while accommodating change.
Structural–Framed Character¶
Classification is a hybrid on the structural–framed spectrum, leaning structural with a light frame. Part of it is a bare pattern that means the same thing in any field — sorting entities into discrete bins by explicit rules; part of it is a vocabulary and set of concerns inherited from philosophy and the study of categorization.
The structural core is an abstract pipeline: entities are evaluated against criteria, an assignment rule places each into a category, and the result is a stable map where similar items cluster together. That much applies unchanged whether you are sorting species, library books, diseases, or legal cases, and it can be stated without reference to any human practice. The lighter frame comes from its philosophical home, where classification is treated not as a static fact of set membership but as deliberate work — the act of sorting — carrying with it a sensitivity to the consequences and politics of how the bins are drawn, as in Bowker and Star's treatment. Because the relational pattern dominates while a modest interpretive concern rides along, it sits toward the structural side of the middle.
Substrate Independence¶
Classification is a universal prime — composite 5 / 5 on the substrate-independence scale. Its signature — entities plus criteria plus an assignment rule yielding a category structure that drives decisions and action — is fully substrate-agnostic. It recurs across formal taxonomy, machine learning, cognitive concept formation, social roles and caste, and biological systematics, with the source showing both Linnaean and medical examples. The pattern is structural and recurs universally, and its transfer is explicit.
- Composite substrate independence — 5 / 5
- Domain breadth — 5 / 5
- Structural abstraction — 5 / 5
- Transfer evidence — 4 / 5
Relationships to Other Abstractions¶
Current abstraction Classification Prime
Foundational — no parent edges in the catalog.
Children (252) — more specific cases that build on this
-
A-Type Main-Sequence Star Domain-specific is a kind of Classification
Classification is the minimal strict parent.An A-Type Main-Sequence Star is a domain category produced by assigning a stellar spectrum to the intersection of an A subtype and luminosity class V under explicit standards. Classification supplies entities, criteria, bins, edge cases, and downstream use; this node supplies the astrophysical criteria and reference system. Measurement is related but not a parent. Spectra, colors, parallax, temperature, and luminosity are measured, yet the node is the retained class rather than the complete instrument–procedure–uncertainty chain for any one quantity. Standardization is related because stable comparison stars and notation make classifications interoperable across observers and time. The candidate is not the social process by which the standards community converges, so Standardization is not a literal parent. No second DAG parent is needed. The physical interpretation of core hydrogen burning is constitutive context, but there is no exact live Main Sequence or Stellar Evolution parent in the refreshed catalog, and adding a generic process prime would make the placement less literal.
-
Academic discipline Domain-specific is a kind of Classification
The proposed strict upward parent is
prime:classification.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Academic discipline adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the field name and period, characteristic questions and objects, methods and evidential standards, departments and curricula, journals and learned societies, practitioner community, credentialing and boundary relations with neighboring fields are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Academic discipline. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge toprime:classification. No live DAG mutation is authorized. -
Acid Salt Domain-specific is a kind of Classification
The minimal prospective placement is a strict
composition/instantiatesedge to liveprime:classification.Acid Salt groups ionic compounds by retained replaceable hydrogen and intermediate protonation state. It realizes a classification rather than being a subtype of the abstract operation. Partial transformation, residual capacity, equilibrium, and classification are related. Frozendomain_specific:solubilityis false coverage because dissolution does not entail composition.
- Acute and obtuse triangles Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Acute and obtuse triangles adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the geometry is Euclidean and the largest-angle or side-square test is applied with strict inequalities, separating acute, right, obtuse, and degenerate cases It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Acute and obtuse triangles. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Aleph number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its set_theory restrictions provide the domain-specific residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Aleph number adds domain-specific constraints. The entry does not collapse into that parent because A member of the transfinite sequence of well-ordered infinite cardinalities, indexed by ordinals with aleph-null as the size of the natural numbers It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Aleph number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Alien (law) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Alien (law) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the person lacks the jurisdiction’s citizenship or nationality under the governing law and the asserted subcategory is separately established It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Alien (law). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Alkane Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The concept classifies molecular graphs by composition and bond topology; saturated acyclic hydrocarbons supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Alkane adds domain-specific constraints. The entry does not collapse into that parent because the saturated open-chain hydrocarbon class and its homologous and isomeric structure It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Alkane. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Angular harp Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.Angular harp is literally an organological category assigned by explicit neck-body and frame criteria; the historically variable instrument morphology supplies its autonomous domain specialization. The edge is proposal-only and points to a frozen prior-baseline Prime. The entry does not collapse into the parent because the open-harp class defined by its angular neck-body construction, not every triangular stringed instrument, every harp played at an angle, or a regional name such as konghou without morphological verification A thematic neighbor is declined whenever it does not literally subsume that rule. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Aquatic plant Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The term classifies plants by habitat adaptation and growth form; aquatic physiology supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Aquatic plant adds domain-specific constraints. The entry does not collapse into that parent because plant life-form classification by sustained aquatic adaptation It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Aquatic plant. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Arf ring Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its commutative_algebra constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Arf ring adds domain-specific constraints. The entry does not collapse into that parent because A one-dimensional semilocal Cohen–Macaulay ring satisfying the Arf closure condition that controls integrally closed ideals and multiplicity sequences It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Arf ring. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Arithmetic number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Arithmetic number adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by positive divisors are counted once, the arithmetic mean equals sigma(n) over tau(n), and the quotient is an integer It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Arithmetic number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Associate professor Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Associate professor adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the higher-education system and institution, rank title and hierarchy, ranks immediately above and below, appointment and promotion criteria, tenure or contract status, teaching research service and leadership expectations, evaluation process, rights compensation and governance role, national variants and cross-system equivalence limits are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Associate professor. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Association (ecology) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Association (ecology) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the geographic and ecological scope, vegetation plots and sampling method, complete species composition and abundance, diagnostic constant and dominant taxa, physiognomy and habitat, classification criteria and nomenclatural code, type or reference relevé and placement in alliance order and class are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Association (ecology). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- B-type Main-Sequence Star Domain-specific is a kind of Classification
**Classification** is the literal prime instantiated.A stellar spectrum is the entity, diagnostic morphology and comparison standards are the criteria, B and V are assignments on two category axes, and the result drives survey selection and physical inference. Classification does not exactly cover the candidate because it supplies none of the stellar criteria or interpretation. **Standard Reference Method** is a close workspace relation rather than a required live parent. MK practice relies on stable standard stars and direct comparison. The accepted workspace node is not needed for the candidate's identity or proposed edge, and implementation should recheck whether it has become canonical. **Baseline Deviation** is related when peculiarity or rotation is judged against a normal standard, but deviation is not constitutive: an ordinary B V classification does not require an anomaly.
- Baer group Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Baer group adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the group, every element-generated cyclic subgroup, finite subnormal chain, normality at each step, quantification over all elements, local nilpotence consequence and distinctions from Dedekind nilpotent and locally nilpotent groups are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Baer group. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Bayes classifier Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.It classifies cases by posterior-risk optimization; probabilistic decision theory supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Bayes classifier adds domain-specific constraints. The entry does not collapse into that parent because population-optimal classification benchmark under known probability and cost structure It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Bayes classifier. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Beck's monadicity theorem Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its category_theory constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Beck's monadicity theorem adds domain-specific constraints. The entry does not collapse into that parent because A categorical criterion determining when a functor is equivalent to the forgetful functor from algebras for the monad induced by its adjunction It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Beck's monadicity theorem. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Biclique-free graph Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Biclique-free graph adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the graph contains no subgraph isomorphic to the declared complete bipartite obstruction under the specified induced-or-noninduced convention It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Biclique-free graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Bidimensionality Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Bidimensionality adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the graph class, parameterized problem, minor- or contraction-monotonicity, quadratic grid-growth condition, and algorithmic meta-theorem hypotheses are all satisfied It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Bidimensionality. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Binary classification Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The task literally sorts instances into discrete categories by a rule and is the two-label specialization of the accepted Classification Prime. The edge is proposal-only and points to a frozen prior-baseline Prime. The entry does not collapse into the parent because the two-class decision architecture with its paired error types and score-to-decision boundary, not classification generally, a continuous probability estimate, or any yes-or-no observation A thematic neighbor is declined whenever it does not literally subsume that rule. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Biogeographic regions of Europe Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Biogeographic regions of Europe adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the issuing institution and version, geographic coverage, named regions and boundaries, input criteria, scale and simplification, legal or reporting use, cross-border treatment and revision history are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Biogeographic regions of Europe. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Black Hole No-Hair Theorem Domain-specific is a kind of Classification
**`prime:classification`** is the minimal parent: the theorem sorts admissible stationary exteriors into a finite parameter family.**`prime:constraint`** is related because hypotheses restrict solutions, while **`prime:identifiability`** is related to recovering parameters from exterior observables. Neither is necessary as an additional parent; Classification most directly states the theorem's role.
- Blockmodeling Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its social_network_analysis constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Blockmodeling adds domain-specific constraints. The entry does not collapse into that parent because A social-network analysis framework that partitions actors into position classes whose tie patterns form an interpretable reduced block structure It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Blockmodeling. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Bochner's theorem (orthogonal polynomials) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Bochner's theorem (orthogonal polynomials) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the operator has the declared polynomial coefficient degrees, every degree has an eigenpolynomial, and orthogonality and interval hypotheses match the stated classification It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Bochner's theorem (orthogonal polynomials). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Borel–de Siebenthal Theory Domain-specific is a kind of Classification
**Classification** is the strict parent because the theory supplies explicit rules that enumerate and distinguish a bounded family of subgroup types.Symmetry is the subject matter, not the taxonomic operation performed. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Branching identification key Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its taxonomy constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Branching identification key adds domain-specific constraints. The entry does not collapse into that parent because A graphically displayed single-access taxonomic key whose decision alternatives branch from diagnostic character choices to candidate identifications It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Branching identification key. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Bright's Disease Domain-specific is a kind of Classification
The minimal prospective placement is a strict `composition/instantiates` edge to live `prime:classification`.Bright's disease is one historically situated classification: it groups patients and renal lesions using selected clinical, urinary, and anatomical features. It is not a subtype of the abstract relation “Classification” in the taxonomic sense; it is a concrete domain realization of that operation. Uncertainty, evidence, observation, and model revision are related, but no additional parent is necessary to establish identity. The frozen hemodialysis neighbor is false coverage because an intervention neither entails nor is entailed by this historical category.
- C space Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The construction classifies sequences by convergence and equips them with uniform norm structure; functional analysis supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while C space adds domain-specific constraints. The entry does not collapse into that parent because normed sequence space distinguished by existence of an ordinary coordinate limit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of C space. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Caste Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Caste adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the society and historical period, named groups and membership rule, hereditary transmission, endogamy, rank and ritual-status criteria, occupational relation, boundary sanctions, mobility conditions and contested self-identification are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Caste. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Castellanus Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its cloud_classification constraints supply the domain-specific residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Castellanus adds domain-specific constraints. The entry does not collapse into that parent because A cloud species marked by turret-like cumuliform projections rising from a common base, recognized within several high- and middle-level cloud genera It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Castellanus. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Categorical perception Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its cognitive_science constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Categorical perception adds domain-specific constraints. The entry does not collapse into that parent because A perceptual phenomenon in which continuous stimulus variation is experienced or discriminated as discrete categories, with enhanced sensitivity near category boundaries It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Categorical perception. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Category of compactly generated weak Hausdorff spaces Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Category of compactly generated weak Hausdorff spaces adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by objects satisfy compact generation and weak Hausdorffness and categorical limits, colimits, and exponentials use the declared CGWH constructions It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Category of compactly generated weak Hausdorff spaces. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Chomsky hierarchy Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The hierarchy classifies grammars and languages by restriction; automata correspondence supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Chomsky hierarchy adds domain-specific constraints. The entry does not collapse into that parent because four-level correspondence between grammatical restriction and computational expressiveness It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Chomsky hierarchy. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Circular algebraic curve Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Circular algebraic curve adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the real polynomial F(x,y) and total degree n, homogeneous components and leading form F_n, divisibility by x^2+y^2, projective homogenization G(x,y,z), line at infinity and two complex circular points, incidence and multiplicity, real locus, examples and higher circularity order and distinction from circle conic and general plane algebraic curve are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Circular algebraic curve. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Classical group Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The name classifies recurring matrix-group families by preserved linear structures; Lie and algebraic group theory supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Classical group adds domain-specific constraints. The entry does not collapse into that parent because uniform matrix-group families realizing the classical Dynkin types and their linear analogues It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Classical group. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Classification of Discontinuities Domain-specific is a kind of Classification
The node directly instantiates **Classification**: it partitions discontinuity cases by explicit diagnostic predicates.It is closely related to **Continuity**, which supplies the condition whose failure is being analyzed, but Continuity is not a second proposed parent because it is a subject dependency rather than the direct genus. The minimal graph route is `prime:classification`. This avoids treating generic continuity as if every continuity concept carried the same one-dimensional taxonomy.
- Classification of Electromagnetic Fields Domain-specific is a kind of Classification
explicit invariant rules map a field tensor to a finite type.explicit invariant rules map a field tensor to a finite type.
- Classification of Fatou components Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its complex_dynamics constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Classification of Fatou components adds domain-specific constraints. The entry does not collapse into that parent because The dynamical classification of periodic stable regions of rational maps into attracting, parabolic, Siegel, Herman and related component types It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Classification of Fatou components. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Classification theorem Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Classification theorem adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the object category, equivalence relation, invariant or normal form, parameter range and realizability, existence and completeness, uniqueness convention and whether enumeration or equivalence is effective are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Classification theorem. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Clock Gable Domain-specific is a kind of Classification
the clock gable is a criteria-governed architectural type; this is the proposed minimal parent.the clock gable is a criteria-governed architectural type; this is the proposed minimal parent.
- Cohen ring Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its commutative_algebra constraints supply the domain-specific residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Cohen ring adds domain-specific constraints. The entry does not collapse into that parent because A field or complete discrete valuation ring of mixed characteristic whose maximal ideal is generated by the residue characteristic, used to lift residue fields in local algebra It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Cohen ring. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Colors of noise Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Colors of noise adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the signal’s estimated power spectral density follows the declared frequency-law class over a specified band and estimation regime It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Colors of noise. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Comet Domain-specific is a kind of Classification
Comet instantiates **Classification**.Observations of a small body are evaluated through activity morphology, gas and dust evidence, orbit, recurrent behavior, history, and physical modeling; those criteria support assignment to a cometary, asteroid, transition, dormant, defunct, or interstellar category; the assignment then controls naming, orbit records, observing priorities, and scientific inference. Classification is therefore the minimal live parent. It is related to **Transformation** because stellar forcing converts part of a nucleus reservoir into gas, dust, coma, and tails. It is related to **Feedback** because asymmetric mass loss changes spin, orbit, illumination, and later activity. **Albedo** is a measurement neighbor: it affects energy absorption and size estimates but does not define comet identity. These relations are explanatory, not additional proposed parents.
- Complex (geology) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification supplies the nearest cross-domain structural operation, while Complex (geology) retains a constitutive identity specific to stratigraphy. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Complex (geology) adds domain-specific constraints. The entry does not collapse into that parent because A complex is not any complicated geology and differs from a suite, which groups lithodemes of the same genetic class. It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Complex (geology). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Complexity Class Domain-specific is a kind of Classification
Complexity-class analysis is classification specialized to sorting formal problems by explicit machine, resource, bound, and acceptance rules.The discipline assigns problems to discrete reusable categories and lets membership import a bundle of downstream feasibility consequences. It adds formal models of computation, asymptotic resource ceilings, reductions, completeness anchors, and the containment lattice.
- Concept class Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its computational_learning_theory conditions supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Concept class adds domain-specific constraints. The entry does not collapse into that parent because A family of Boolean-valued concepts or classifiers over a common instance domain, serving as the hypothesis universe in computational learning theory It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Concept class. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Confederate effect Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Confederate effect adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the imitation-game or comparative test, hidden human and machine interlocutors, judge and interaction transcript, classification rule, human-as-machine error event, rate and uncertainty, conversational and expectation cues, experimental protocol and incentive effects and distinction from machine-as-human false positives are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Confederate effect. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Conjugacy class Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.Conjugacy partitions and classifies group elements by inner symmetry; group structure supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Conjugacy class adds domain-specific constraints. The entry does not collapse into that parent because inner-automorphism orbit partition of group elements It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Conjugacy class. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Consideration and initiating structure Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Consideration and initiating structure adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the leader group and context, observed or reported behaviors, consideration indicators, initiating-structure indicators, measurement instrument and scoring, independence of axes, outcome variables and situational moderators are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Consideration and initiating structure. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Contrast set Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The set classifies mutually substitutable alternatives within a schema; linguistic-cultural boundedness supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Contrast set adds domain-specific constraints. The entry does not collapse into that parent because slot-defined semantic inventory whose internal alternatives structure cultural knowledge It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Contrast set. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Cross-listed Classification Domain-specific is a kind of Classification
Cross-listed classification is rule-governed classification specialized to one focal class plus governed secondary assignments for the same work.The child sorts works into a controlled discrete class vocabulary and adds multi-home assignment, primary-versus-secondary discoverability roles, a warrant policy, exchange syntax, and revision hygiene. The multi-parent assignment does not cease to be classification.
- Cryptotype Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification supplies the nearest cross-domain structural operation, while Cryptotype retains a constitutive identity specific to linguistic typology. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Cryptotype adds domain-specific constraints. The entry does not collapse into that parent because An analyst's arbitrary hidden feature is not a cryptotype without independent linguistic diagnostics, and covert does not mean unconscious in a psychological sense. It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Cryptotype. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Cunningham number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The identity classifies integers through one normalized exponential form; factorization and sign structure supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Cunningham number adds domain-specific constraints. The entry does not collapse into that parent because normalized near-power integers and their factorization structure across bases, exponents, and signs It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Cunningham number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Cyclic number (group theory) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Cyclic number (group theory) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the integer is positive, Euler-totient and group-order conventions are explicit, gcd(n,phi(n)) equals one, and the equivalent square-free prime-divisibility conditions and all-groups conclusion are stated It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Cyclic number (group theory). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Cyclotomic polynomial Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Cyclotomic polynomial adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the positive integer n, primitive nth roots and coprimality index, product definition, monicity and integer coefficients, irreducibility over rationals, degree Euler phi(n), factorization of x^n minus one, Möbius product and representative examples are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Cyclotomic polynomial. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Cytotaxonomy Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Cytotaxonomy adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the organisms and sampling, chromosome preparation evidence, number and ploidy, morphology and rearrangements, meiotic behavior, character homology, variation, comparison method and taxonomic inference are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Cytotaxonomy. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Death by Misadventure Domain-specific is a kind of Classification
**Classification** is the strict parent because a coroner maps a death and evidence through authorized criteria into a reusable short-form category.Adjudication is related, but the node's residual is the particular category and its boundary, not the general dispute-resolution process. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Demerit good Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Demerit good adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the claimed consumer harm, information or behavioral failure, welfare standard, affected population, and distinction from third-party externalities are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Demerit good. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Dentolabial consonant Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Dentolabial consonant adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by instrumental or observational evidence locates the primary oral constriction between lower teeth and upper lip rather than upper teeth and lower lip It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Dentolabial consonant. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Design museum Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification supplies the nearest broader Prime while the source-domain invariant remains autonomous. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Design museum adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the institution and governance, collection scope and acquisition policy, definition of design, preservation and documentation, exhibition and interpretation practices, audiences, educational role and distinction from art or technology museums are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Design museum. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Design predicates Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Design predicates adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the software units and call graph, predicate types and recognition rules, branch and loop conditions, per-predicate complexity values, combination rule, infeasible combinations, test-path bound and coverage evidence are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Design predicates. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Dialect Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its sociolinguistics constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Dialect adds domain-specific constraints. The entry does not collapse into that parent because A socially or geographically associated variety of a language distinguished by systematic phonological, grammatical and lexical patterns It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Dialect. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Diatonic and Chromatic Domain-specific is a kind of Classification
the pair assigns musical events to collection-internal and collection-external categories under an explicit rule.This is the minimal proposed DAG parent.
- Diffused monotheism Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The term classifies religious systems by the relation between supreme and subordinate divinity; theology supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Diffused monotheism adds domain-specific constraints. The entry does not collapse into that parent because supreme-deity unity combined with distributed subordinate worship It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Diffused monotheism. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Direct case Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Direct case adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by one morphological case is licensed across the declared core S, A, and O relations according to a language-specific alignment table and contrasts with a narrower non-direct case It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Direct case. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Door space Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Door space adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the underlying set and topology, arbitrary subset, open-or-closed disjunction, clopen possibilities, T0 consequence, subspace quotient and finer-topology preservation, accumulation-point structure and discrete and excluded-point examples are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Door space. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Du Bois singularity Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.Du Bois singularity is literally a rule-defined category of schemes; Classification is presupposed, while the derived recognition predicate supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Du Bois singularity adds domain-specific constraints. The entry does not collapse into that parent because the exact derived-sheaf quasi-isomorphism condition and its resolution-independent mild-singularity class It also declines a broader thematic neighbor: shared vocabulary does not establish literal structural subsumption. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Dually chordal graph Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Dually chordal graph adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the graph satisfies one of the equivalent maximum-neighborhood, compatible-tree, or clique-hypertree characterizations It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Dually chordal graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Eightfold way (physics) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Eightfold way (physics) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the hadron family and spin-parity, flavor symmetry group and generators, representation and dimension, weight-diagram axes, assigned particles and quantum numbers, mass-splitting or symmetry-breaking qualification and predicted or missing states are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Eightfold way (physics). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- En (Lie algebra) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while En (Lie algebra) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the index n and Dynkin diagram with branch lengths, generalized Cartan matrix, generators and Serre relations, determinant and type, dimension and rank for finite cases, identifications for low n, affine E9 and indefinite extensions and algebra-versus-group convention are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of En (Lie algebra). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- End (graph theory) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while End (graph theory) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the infinite graph and local-finiteness assumptions, ray definition, finite vertex separators, tails and components after deletion, equivalence relation on rays, resulting end set, degree or domination of an end, end topology and Cayley-graph relation to group ends are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of End (graph theory). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- English unjust enrichment law Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The doctrine literally applies explicit legal criteria to classify a fact pattern as a prima facie unjust-enrichment claim before defenses and remedy; its jurisdiction, unjust factors, and restitutionary structure supply the specialization. The edge is proposal-only and points to a frozen prior-baseline Prime. The entry does not collapse into the parent because the jurisdiction-specific four-stage unjust-enrichment claim and restitutionary consequence, not a general judicial power to correct unfairness, all restitution, equitable wrongdoing, constructive trusts, tracing, or an enrichment calculation without liability A thematic neighbor is declined whenever it does not literally subsume that rule. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Enriques–Kodaira classification Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Enriques–Kodaira classification adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the surface is evaluated up to the declared birational or deformation equivalence using a minimal model and the required complex-surface invariants It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Enriques–Kodaira classification. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Ergative–absolutive alignment Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Ergative–absolutive alignment adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the language and construction, S A and P arguments, morphological case or agreement markers, syntactic diagnostics, split conditions, markedness pattern, examples with glosses and comparison with nominative-accusative alignment are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Ergative–absolutive alignment. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Euclidean domain Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its ring_theory constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Euclidean domain adds domain-specific constraints. The entry does not collapse into that parent because An integral domain equipped with a Euclidean function that supports division with remainder of strictly smaller value and therefore the Euclidean algorithm It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Euclidean domain. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Euclidean ordered field Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its ordered_algebra constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Euclidean ordered field adds domain-specific constraints. The entry does not collapse into that parent because An ordered field in which every nonnegative element has a square root within the field It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Euclidean ordered field. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Exact coloring Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Exact coloring adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the finite simple graph, color set and vertex-color map, proper coloring and independent color classes, every unordered pair of distinct colors, exactly one edge joining the corresponding classes, number of colors, quotient or detachment of a complete graph, existence and extremal questions and distinction from complete harmonious and equitable colorings are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Exact coloring. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Extreme commuting Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Extreme commuting adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the employed population and geography, survey period and sampling, journey-to-work definition, one-way duration and units, threshold and strictness, mode and frequency treatment, remote or multi-site cases, weighted prevalence and uncertainty and cross-jurisdiction comparability are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Extreme commuting. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- First-magnitude star Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The term assigns stars to a conventional brightness class; astronomical magnitude history supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while First-magnitude star adds domain-specific constraints. The entry does not collapse into that parent because historical categorical bin on the modern logarithmic apparent-brightness scale It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of First-magnitude star. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Forel–Ule scale Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Forel–Ule scale adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the water body and observation point, 21 ordered Forel–Ule reference colors, classic or modern reference implementation, illumination weather and surface state, viewing depth angle and background, observer matching procedure, selected index and uncertainty, calibration and digital conversion, relation to optical constituents and distinction from Secchi transparency or chemical measurement are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Forel–Ule scale. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Friendly number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Friendly number adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the positive integer n, divisor-sum function sigma, abundancy index sigma(n)/n, a distinct integer m with equal index, equivalence relation and friendly class, pair or tuple terminology, solitary numbers and known versus unresolved status are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Friendly number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Frobenius–Schur indicator Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Frobenius–Schur indicator adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the representation class and normalization are stated and the indicator corresponds to the declared invariant-form type It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Frobenius–Schur indicator. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Functional group (ecology) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Functional group (ecology) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by ecosystem, process or response of interest, traits or effect criteria, grouping rule, taxa and life stages, scale, evidence, within-group variation, and phylogenetic confounding are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Functional group (ecology). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Further education Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Further education adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the jurisdiction and effective date, learner eligibility, provider types, qualification framework and levels, vocational and academic scope, funding and regulation and boundary with secondary and higher education are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Further education. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Generic property Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Generic property adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the ambient class or parameter space, property, topology measure or algebraic structure, exact definition of negligible and generic sets, exceptional locus, quantifiers and stability under intersection or perturbation and examples separating competing genericities are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Generic property. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Giuga Number Domain-specific is a kind of Classification
Giuga Number specializes **Classification**: membership is an exact predicate over composite integers, and the name packages that predicate as a mathematical class.This is the minimal proposed DAG parent. It relies on prime factorization, divisibility, modular arithmetic, and universal quantification. Those are mathematical tools or logical relations, not additional taxonomic parents. It is related to verification because a certificate can list the prime factors and one congruence check per factor. It is related to conjunction because every local condition must hold. These explanatory relations remain in prose.
- Grammatical category Domain-specific is a kind of Classification
**Classification** is the strict parent because a grammatical category partitions a recurrent grammatical dimension into organized values and rules for assigning or realizing them.Representation and convention are related, but neither supplies the defining value-system structure. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Grothendieck category Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Grothendieck category adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the category is abelian, has all small coproducts, filtered colimits are exact, and a generator exists It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Grothendieck category. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Hadamard manifold Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Hadamard manifold adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the manifold is connected and finite-dimensional under the declared convention, the Riemannian metric is complete, simple connectivity holds, sectional curvature is nonpositive everywhere, and the invoked geodesic and exponential-map consequences have their hypotheses It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Hadamard manifold. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Hakuji Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Hakuji adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the object and maker or kiln, period and region, porcelain body and glaze, plain-white surface convention, forming and firing evidence, decorative exclusions and attribution provenance are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Hakuji. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Heegner number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The identity classifies square-free integers by an exact field class-number property; imaginary quadratic arithmetic supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Heegner number adds domain-specific constraints. The entry does not collapse into that parent because the finite nine-member class-number-one classification for imaginary quadratic fields and its exceptional Diophantine consequences It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Heegner number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Highly composite number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Highly composite number adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by n is positive and its divisor count is a strict all-prior record under the stated convention It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Highly composite number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Homeostatic property cluster theory Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Homeostatic property cluster theory adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the proposed kind and domain, property cluster and distributions, homeostatic or stabilizing mechanisms, causal evidence, membership and exception rule, projectibility, historical continuity and rival essentialist or resemblance account are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Homeostatic property cluster theory. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Homologous Series Domain-specific is a kind of Classification
Homologous Series strictly specializes live **Classification**.It uses an explicit rule to assign chemical species to a category and then adds an internal repeat-count order, an adjacency operation, and chemical invariants. Classification is the minimal taxonomic parent because a homologous series is first a disciplined chemical grouping; its ordering is part of the specialization. **Motif** explains the retained functional or structural pattern, but many motifs do not generate indexed chemical families. **Arithmetic Progression** is a close formal analogue: its common numerical difference corresponds to a fixed formula-vector difference. It is not a parent because chemical structures are not numbers and structural predicates remain essential. **Group**, **Semigroup**, and **Monoid** are false neighbors: no closure, identity, or inverse operation on the compounds is required. **Holarchy** is also not a parent because homologues need not be nested wholes and parts.
- Hyperboloid Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Hyperboloid adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the ambient affine or projective space, field, quadratic equation and nondegeneracy, center, signature, one- or two-sheet case, scaling parameters, coordinate transformations, and inclusion of limiting or imaginary cases are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Hyperboloid. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Hypernymy and hyponymy Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification supplies the nearest cross-domain structural operation, while Hypernymy and hyponymy retains a constitutive identity specific to lexical semantics. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Hypernymy and hyponymy adds domain-specific constraints. The entry does not collapse into that parent because Polysemy makes the relation sense-specific, and taxonomic levels can differ without changing the inverse relation. It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Hypernymy and hyponymy. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Hyponormal operator Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Hyponormal operator adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the operator is bounded on a complex Hilbert space and its declared self-commutator is positive semidefinite It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Hyponormal operator. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Index term Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Index term adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the indexed unit, concept-selection policy, vocabulary status, preferred and variant labels, specificity, assignment provenance, and retrieval behavior are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Index term. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Indigenous peoples Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Indigenous peoples adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the people and their self-identification, territory and historical continuity, distinct institutions and culture, colonization or nondominance context, community membership rules, state and legal framework, rights and source-community terminology are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Indigenous peoples. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Infrasound Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Infrasound adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the medium and acoustic field, frequency range and standard threshold, sound pressure and sensitivity, wavelength and propagation conditions, source spectrum, sensor bandwidth and calibration, attenuation and background noise and distinction from subsonic motion and seismic waves are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Infrasound. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Injury (law) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The legal concept literally classifies an invasion or detriment relative to a rule-defined protected category; jurisdictional doctrine supplies the domain-specific criteria and consequences. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Injury (law) adds domain-specific constraints. The entry does not collapse into that parent because the law's recognition of an invaded interest or cognizable detriment, rather than generic harm, the whole tort claim, criminal prosecution, or the monetary valuation of damages It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Injury (law). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Intact Forest Landscape Domain-specific is a kind of Classification
The minimal prospective parent is `prime:classification` through strict subsumption.IFL is a specific rule-governed classification that assigns forest-zone components to a discrete membership class. Classification occurs without forest, geography, thresholds, or disturbance mapping; IFL cannot operate without explicit assignment rules. Threshold determines the area and width gates. Boundary and Spatial Indexing support polygon construction and buffer subtraction. Monitoring supports repeated map editions. These are related ingredients rather than necessary additional parents. Habitat Fragmentation is the closest domain neighbor: it supplies ecological mechanisms that motivate continuity, but IFL is a measurement/classification proxy rather than the fragmentation process itself.
- Integral graph Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Integral graph adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the graph class and adjacency convention, vertex ordering and adjacency matrix, characteristic polynomial, multiset of eigenvalues including multiplicities, integrality test, invariance under graph isomorphism and distinctions from Laplacian-integral and rational-spectrum graphs are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Integral graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- ISO 19439 Enterprise-Modelling Framework Domain-specific is a kind of Classification
**Classification** is the proposed minimal parent.ISO 19439 supplies explicit criteria and allowed values by which enterprise-model content receives a reusable three-coordinate location, so it is a domain-specific multidimensional classification framework. The relation is strict subsumption. **Viewpoint** explains the selective-access logic of model views, but only one of the three dimensions. **Decomposition** explains separation of concerns, while the integrated-model requirement preserves cross-view relations. **Lifecycle** explains phased descriptions. **Interoperability** is an intended enabling outcome and standards context, not the framework's exact mechanism. **Traceability** connects phase transitions and genericity specialization.
- Key Biodiversity Area Domain-specific is a kind of Classification
**Classification** is the strict parent by specialization.KBA status is a rule-governed category assigned to sites after explicit criteria and thresholds are met. Classification applies without biodiversity or geography; the candidate narrows it to a governed global conservation standard. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Knödel number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The congruence classifies composite integers by a universal modular property; number theory supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Knödel number adds domain-specific constraints. The entry does not collapse into that parent because parameterized universal pseudoprime condition extending Carmichael numbers It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Knödel number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- KR-theory Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while KR-theory adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the involutive topological space, complex vector bundle, conjugate-linear lifted involution and compatibility, isomorphism and stable equivalence, Grothendieck group, bigrading, suspension representations and periodicity are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of KR-theory. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Lemon (automobile) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Lemon (automobile) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the jurisdiction and effective date, vehicle and warranty status, substantial defect, safety, value or use effect, repair attempts and service days, notice and records, statutory presumption and remedy are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Lemon (automobile). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Linguistic profiling Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Linguistic profiling adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the speech sample and channel, linguistic cues, listener population, inferred social category, decision context, comparison or audit design, outcome disparity, uncertainty and distinction from text authorship profiling are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Linguistic profiling. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Lipid Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Lipid adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the molecule belongs to an explicit lipid-classification system through declared structural or biosynthetic criteria, with hydrophobicity alone not treated as sufficient It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Lipid. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Local area emergency Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Local area emergency adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the jurisdiction and current EAS standard, authorized originator, incident and threat assessment, SAME event and location codes, issue and expiration time, dissemination channels, message text and accessibility, instruction scope, update and cancellation, escalation threshold, false-alert controls and archival evidence are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Local area emergency. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Locality-sensitive hashing Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Locality-sensitive hashing adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the item space and distance or similarity, near and far thresholds, locality-sensitive hash-family collision bounds, random sampling, concatenation length and number of tables, index construction, query and candidate union, verification step, approximation probability and time-space-recall tradeoff are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Locality-sensitive hashing. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Locative case Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Locative case adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the language treats the form as a morphosyntactic case and its core function marks static location under the stated analysis It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Locative case. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Logistic model tree Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.A logistic model tree literally maps observations into discrete classes through learned probability and decision rules; its recursive partition plus local logistic structure supplies the autonomous model-family residual. The edge is proposal-only and points to a frozen prior-baseline Prime. The entry does not collapse into the parent because the coupled tree-partition and logistic-model induction architecture, not plain logistic regression, a constant-leaf decision tree, gradient-boosted trees, or an informal ensemble containing both component types A thematic neighbor is declined whenever it does not literally subsume that rule. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- M-matrix Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while M-matrix adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the real square matrix and dimension, Z-matrix sign pattern, decomposition sI minus B, nonnegative B and spectral radius condition, singularity status and selected equivalent characterization with its strictness assumptions are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of M-matrix. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Mahram Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Mahram adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the persons and relevant sexes or roles, legal school and authority, relation by blood, affinity or milk kinship, permanence of marriage prohibition, consummation and fosterage conditions, adoption distinction, secondary ruling, jurisdiction, and contested interpretations are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Mahram. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Markarian galaxies Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Markarian galaxies adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the survey and plate or detector response, sky coverage and magnitude limits, ultraviolet-excess selection criterion, source and nucleus definition, catalog identifier, follow-up spectrum, redshift and selection biases are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Markarian galaxies. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Mater semper certa est Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Mater semper certa est adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the jurisdiction and period, Latin formulation, person giving birth, conclusive or rebuttable status, assisted-reproduction context, genetic and intended parents, statutory exceptions and legal consequences are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Mater semper certa est. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Maximal set (computability theory) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Maximal set (computability theory) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the natural-number universe, computable enumeration, coinfinite complement, finite-variant relation and quantified condition on every c.e. superset are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Maximal set (computability theory). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Media market Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The construct classifies places and audiences into comparable broadcast regions; media measurement supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Media market adds domain-specific constraints. The entry does not collapse into that parent because audience geography used as the transactional and regulatory unit of media distribution It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Media market. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Memory confusion protocol Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Memory confusion protocol adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by speaker and statement assignment, candidate categories, counterbalancing, delay, attribution task, within-versus-between error contrast, baseline, exclusions, and inferential model are declared It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Memory confusion protocol. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Metzler matrix Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Metzler matrix adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the real square matrix and dimension, off-diagonal inequality, diagonal convention, shifted nonnegative matrix relation, exponential positivity and any irreducibility or stability assumptions are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Metzler matrix. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Morava K-theory Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Morava K-theory adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the prime, height, periodic coefficient ring, spectrum convention, and K(n)-homology or cohomology functor are fixed and used at the claimed chromatic layer It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Morava K-theory. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Mute of Malice Domain-specific is a kind of Classification
the doctrine assigns observed silence to a willful or incapacity-related category.the doctrine assigns observed silence to a willful or incapacity-related category.
- National language Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The status classifies a language by its institutional relation to a nation; sociopolitical meaning supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while National language adds domain-specific constraints. The entry does not collapse into that parent because nation-indexed language status distinct from purely linguistic classification It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of National language. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Native Species Domain-specific is a kind of Classification
Native Species strictly instantiates **Classification**: explicit spatial, temporal, and pathway rules map occurrences to native, alien, or uncertain classes for downstream action.It relates to Provenance because arrival evidence reconstructs origin, but the catalog's Provenance prime includes a custody-chain structure not mandatory here. It also relates to Boundary because natural range and dispersal potential define membership edges. The minimal proposed DAG parent is `prime:classification`. Invasive-Species Release is an ecological mechanism involving escape from coevolved enemies after introduction; it is a neighbor, not a parent.
- Near-native speaker Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Near-native speaker adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the speaker and languages, acquisition history and age, exposure and use, comparison population, proficiency domains, task and elicitation context, scoring and blinding, threshold, variability, identity terminology, uncertainty, and distinction from passing or heritage speakers are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Near-native speaker. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- New Classification Scheme for Chinese Libraries Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification supplies the nearest cross-domain structural operation, while New Classification Scheme for Chinese Libraries retains a constitutive identity specific to library science. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while New Classification Scheme for Chinese Libraries adds domain-specific constraints. The entry does not collapse into that parent because It is not the People's Republic's Chinese Library Classification and is not merely a translation of Dewey despite historical influence. It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of New Classification Scheme for Chinese Libraries. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Nonhypotenuse number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification supplies the nearest broader Prime while the source-domain invariant remains autonomous. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Nonhypotenuse number adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the natural-number convention, candidate integer, positive-leg condition, sum-of-two-squares equation, prime factorization criterion and proof of representation or impossibility are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Nonhypotenuse number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Noun Domain-specific is a kind of Classification
**Classification** is the strict parent because nounhood assigns lexical items to a discrete, reusable category under explicit grammatical evidence.Classification spans biological, administrative, computational, and conceptual domains far beyond grammar. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- NSPACE Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.NSPACE classifies problems by a nondeterministic space resource bound; machine branching supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while NSPACE adds domain-specific constraints. The entry does not collapse into that parent because nondeterministic space-bounded computation and its configuration-reachability characterization It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of NSPACE. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Octoechos Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Octoechos adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the rite, language, place and period, eight modal categories and numbering, authentic-plagal relation, pitch and melodic conventions, notation, repertory, liturgical cycle, transmission source, and cross-tradition equivalence limits are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Octoechos. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Odious number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Odious number adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the nonnegative-integer domain, canonical binary representation without leading zeros, one-bit count and odd-parity condition are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Odious number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Offshore medical school Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The term classifies institutions by location, recruitment and licensing orientation; cross-border medical education supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Offshore medical school adds domain-specific constraints. The entry does not collapse into that parent because cross-border professional-school model oriented to external licensing markets It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Offshore medical school. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Omega and agemo subgroup Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its group_theory constraints supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Omega and agemo subgroup adds domain-specific constraints. The entry does not collapse into that parent because Characteristic subgroup constructions in a finite p-group that collect elements annihilated by bounded p-powers and generate bounded p-power images, encoding its power structure It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Omega and agemo subgroup. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Perfect ring Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its ring_theory constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Perfect ring adds domain-specific constraints. The entry does not collapse into that parent because A ring for which every module on the specified side has a projective cover, with equivalent chain and radical conditions under Bass's theorem It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Perfect ring. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Phenetics Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Phenetics adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the operational taxonomic units, observable character matrix, coding and missing-data rules, character weights, similarity or distance coefficient, clustering or ordination algorithm, resulting phenogram and distinction from phylogenetic ancestry are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Phenetics. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Photoautotroph Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The term classifies organisms by coupled energy and carbon sources; ecological metabolism supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Photoautotroph adds domain-specific constraints. The entry does not collapse into that parent because two-axis trophic identity coupling light energy with autotrophic carbon acquisition It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Photoautotroph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Pitch-accent language Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The label classifies prosodic systems by the distribution of lexical pitch contrast; phonology supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Pitch-accent language adds domain-specific constraints. The entry does not collapse into that parent because restricted lexical pitch organization used in prosodic typology It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Pitch-accent language. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Pluripolar set Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Pluripolar set adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the complex domain and dimension, plurisubharmonic witness and nontriviality, negative-infinity locus, subset versus complete equality, local or global qualification, closure and countable-union behavior, Hausdorff and Lebesgue smallness and analytic zero-set examples are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Pluripolar set. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Political spectrum Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The spectrum classifies positions through comparative coordinates; political dimensionality supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Political spectrum adds domain-specific constraints. The entry does not collapse into that parent because geometric comparative representation of ideological position and its compression tradeoffs It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Political spectrum. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- PolyL Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.PolyL classifies decision problems by a deterministic polylogarithmic space bound; complexity theory supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while PolyL adds domain-specific constraints. The entry does not collapse into that parent because deterministic polylog-space resource class between logarithmic and broader sublinear regimes It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of PolyL. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Polynomial hierarchy Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Polynomial hierarchy adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the computational model, polynomial input bound, level index, quantifier blocks or oracle definition, reduction notion, completeness convention, containments, base level, uniformity, and exact collapse implication are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Polynomial hierarchy. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Positive form Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Positive form adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the manifold, bidegree, reality convention, and exact weak, strong, or positive evaluation inequality are declared and satisfied pointwise It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Positive form. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Primary nutritional groups Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Primary nutritional groups adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by energy source, electron donor, carbon source, organism and life stage, environmental conditions, and mixed or switching metabolism are independently established It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Primary nutritional groups. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Prime signature Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.Prime signature literally sorts positive integers into discrete equivalence classes by an explicit exponent-multiset rule. Unique factorization and multiplicative-shape consequences supply the autonomous number-theoretic residual. The edge is proposal-only and points to a frozen prior-baseline Prime. The entry does not collapse into the parent because the quotient invariant obtained by forgetting prime identities while retaining the complete multiplicity pattern of their exponents, not the prime factorization itself, a digital signature, the set of prime divisors, or a list that discards repeated exponents A thematic neighbor is declined whenever it does not literally subsume that rule. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Prime triplet Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Prime triplet adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the integer domain, ordering and set convention, span-six condition, two admissible forms, exceptional triples, primality evidence and any counting or infinitude claim are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Prime triplet. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Principle of typicality Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Principle of typicality adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the facts fit a preexisting legal type under the governing jurisdiction’s element and interpretation rules without prohibited analogy It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Principle of typicality. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Progressive function Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Progressive function adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the square-integrable real-line function, Fourier-transform convention, essential support contained in nonnegative frequencies, Hardy space H2 plus identification, analytic extension to a half-plane, zero-frequency convention, complex conjugation and time-reversal relations, regressive and super-regressive counterparts and projection by analytic-signal or Hilbert-transform operators are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Progressive function. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Pseudo-canonical variety Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Pseudo-canonical variety adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the variety class, singularity assumptions, canonical divisor convention, and exact meaning of pseudo-ampleness are stated and the canonical class satisfies that positivity condition It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Pseudo-canonical variety. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Pseudoprotease Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The identity classifies an enzyme-family homolog by retained structure and lost catalytic function; pseudoenzyme evolution supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Pseudoprotease adds domain-specific constraints. The entry does not collapse into that parent because catalytically inactive protease fold repurposed for noncatalytic biological function It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Pseudoprotease. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Quadratic residuosity problem Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The problem classifies promised residues versus nonresidues under computational limits; modular arithmetic supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Quadratic residuosity problem adds domain-specific constraints. The entry does not collapse into that parent because factoring-linked hard decision between residues and pseudoresidue-looking nonresidues It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Quadratic residuosity problem. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Qualitative comparative analysis Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.QCA classifies cases into condition and outcome sets and reduces configurations; comparative causation supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Qualitative comparative analysis adds domain-specific constraints. The entry does not collapse into that parent because configurational, conjunctural and equifinal comparison between case studies and variable-centered statistics It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Qualitative comparative analysis. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Quantum number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.Quantum numbers classify state sectors under observables and symmetries; quantum discreteness supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Quantum number adds domain-specific constraints. The entry does not collapse into that parent because state labels derived from quantization and symmetry rather than arbitrary enumeration It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Quantum number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Quasi-bipartite graph Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Quasi-bipartite graph adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the undirected graph and terminal subset are explicit and no edge has two nonterminal endpoints It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Quasi-bipartite graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Quasivariety Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Quasivariety adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the algebraic signature, treatment of empty and trivial algebras, quasi-identity syntax, model class, subalgebra, product and ultraproduct or reduced-product closures, and chosen equivalence theorem are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Quasivariety. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Radical of a ring Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Radical of a ring adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the ring category and identity convention, radical class and closure axioms, ideal assigned to each ring, functorial behavior under homomorphism, idempotence, semisimple quotient condition and specialization to nil Jacobson prime or other radicals are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Radical of a ring. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Range Property Domain-specific is a kind of Classification
Range Property most directly **specializes Classification**.It assigns entities to a nonscalar membership class using an explicit rule based on scalar-range membership. The rule turns continuous or multidimensional variation into a reusable status category. It also uses **Threshold** when the range is bounded by a lower or upper cutoff. Threshold is not the whole identity because a range may have multiple bounds and because the candidate concerns the property conferred by membership rather than the boundary itself. It is related to **Equity** only through normative subject matter. The live Equity prime concerns contextual correction of general rules; a range-property account creates a uniform status class and may itself be criticized for ignoring context. It is related to **Relation** because a unary property can be modeled as set membership, and to **Criteria of Individuation** because status categories require membership criteria. Neither supplies the scalar-basis-to-nonscalar-grounding argument.
- Reduced residue system Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification supplies the nearest cross-domain structural operation, while Reduced residue system retains a constitutive identity specific to number theory. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Reduced residue system adds domain-specific constraints. The entry does not collapse into that parent because A complete residue system includes nonunits and has n members, while a reduced system contains only the φ(n) unit classes. It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Reduced residue system. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Register (sociolinguistics) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.Register classifies patterned language varieties by recurrent use situation; sociolinguistic function supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Register (sociolinguistics) adds domain-specific constraints. The entry does not collapse into that parent because situationally organized language variety linking linguistic form to communicative use It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Register (sociolinguistics). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Regular scheme Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its algebraic_geometry constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Regular scheme adds domain-specific constraints. The entry does not collapse into that parent because A locally Noetherian scheme whose every local ring is regular, so local dimension equals the minimal number of generators of its maximal ideal It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Regular scheme. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Relationship extraction Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The task classifies relations between extracted arguments; textual evidence supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Relationship extraction adds domain-specific constraints. The entry does not collapse into that parent because argument-linked semantic assertion extraction beyond entity recognition It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Relationship extraction. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Restricted root system Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Restricted root system adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the semisimple Lie algebra or symmetric space, involution and compact/noncompact decomposition, maximal abelian subspace, restricted-root definition, restricted root spaces and multiplicities, reduced or nonreduced structure, restricted Weyl group and relation to Iwasawa decomposition are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Restricted root system. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Rhotic consonant Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification supplies the nearest cross-domain structural operation, while Rhotic consonant retains a constitutive identity specific to phonetics. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Rhotic consonant adds domain-specific constraints. The entry does not collapse into that parent because Orthographic r does not guarantee a rhotic sound, and acoustic or articulatory similarity alone does not establish membership across languages. It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Rhotic consonant. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Sachnisi Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.Sachnisi is a reusable architectural type assigned by explicit morphological, structural, spatial, regional, and historical criteria rather than by surface resemblance alone. The edge is proposal-only and points to a frozen prior-baseline Prime. The entry does not collapse into the parent because the historically and regionally typed projecting upper-storey enclosure with its support, room, and street-edge roles, not every bay window, balcony, overhang, or picturesque facade A thematic neighbor is declined whenever it does not literally subsume that rule. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Secondary Carbon Domain-specific is a kind of Classification
Secondary Carbon directly instantiates **Classification**: a saturated focal carbon is assigned to one of four discrete categories by an explicit carbon-neighbor rule.Classification is the minimal prospective parent because it captures the operation without importing an unrelated carbon-cycle or molecular-process mechanism. It is also related in prose to representation, granularity, invariance, and boundary. A structural formula represents the adjacency data; granularity fixes the focal atom rather than molecule; invariance explains why redrawing does not change membership; and boundary protects the saturated-carbon convention and the focal-atom distinction. These primes illuminate the reasoning but are not needed as additional DAG parents.
- Secondary Malignant Neoplasm Domain-specific is a kind of Classification
**Classification** is the minimal prospective parent.The entry supplies an explicit oncology rule for sorting malignant involvement into primary versus secondary categories while retaining the variables that downstream practices need. This is not mere labeling: the rule uses origin and site evidence, rejects unsupported multiplicity, and changes how the lesion is represented. **Propagation** is closely related but is not proposed as a parent. Metastasis is an oncological instance of spreading from a source through bodily routes; the secondary lesion is a result and classified state of that propagation, not the whole propagation process. **Provenance** is only analogically adjacent because its live definition requires a documented custody history; tumor lineage does not literally involve custody transfers. **Signature-Borne Provenance** can illuminate how conserved morphology or molecular markers support origin inference, but no such signature is required in every accepted clinical attribution.
- Secretory Protein Domain-specific is a kind of Classification
The minimal prospective parent is live `prime:classification` through strict subsumption, following the catalog's treatment of functional scientific classes.Secretory Protein is a rule-governed class assigned by cargo type, normal destination, selective route, and evidence against passive release. Classification occurs without cells or proteins. Flow and Compartmentalization describe movement and cell organization; Signaling describes many functions; Quality Control governs folding. None contains all members or is as ontologically direct as Classification. Axonal Transport is a specialized intracellular movement process and not coverage.
- Semantic class Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Semantic class adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the lexical or referential universe, semantic feature inventory, membership rule, positive and negative examples, overlap and hierarchy policy, granularity, grammatical or interpretive consequence and language-specific evidence are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Semantic class. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Semantic Domain Domain-specific is a kind of Classification
lexical senses are grouped under reusable domain categories by stated semantic criteria.lexical senses are grouped under reusable domain categories by stated semantic criteria.
- Semantic knowledge management Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Semantic knowledge management adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by managed resources are connected through an explicit shared semantic model whose concepts and relations support retrieval or inference beyond keyword and folder structure It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Semantic knowledge management. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Sequence feature variant type Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Sequence feature variant type adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the reference protein and version, feature type and coordinates, sequence variant and nomenclature, resulting feature state, evidence and provenance and cross-species qualification are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Sequence feature variant type. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Ship class Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Ship class adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by membership is based on declared common design lineage rather than merely tonnage, role, owner, or visual resemblance It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Ship class. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Shōrō Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its architectural_history conditions supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Shōrō adds domain-specific constraints. The entry does not collapse into that parent because A Japanese Buddhist-temple bell tower, with historically distinct enclosed and open-sided structural types, built to house and sound the temple bell It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Shōrō. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Sibu classification Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Sibu classification adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the catalogue and historical period, four top-level divisions and names, subdivision scheme, classification unit, assignment rules, disputed placements and institutional purpose are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Sibu classification. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Sign (mathematics) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Sign (mathematics) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the carrier and order or orientation, positive and negative subsets, zero convention, sign-map codomain, multiplication and negation laws, and any extension to determinants, permutations, or directed objects are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Sign (mathematics). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Signed graph Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Signed graph adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the graph and edge-sign function, loop and parallel-edge conventions, walk and cycle sign, balance definition and switching operation are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Signed graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Signed set Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The sign function classifies each element into one of two oriented classes; combinatorial uses supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Signed set adds domain-specific constraints. The entry does not collapse into that parent because elementwise binary orientation of a set and the interchangeable map-versus-disjoint-pair representations It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Signed set. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- SL (complexity) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.SL classifies decision problems by a symmetric space-bounded model; undirected reachability supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while SL (complexity) adds domain-specific constraints. The entry does not collapse into that parent because historical symmetric-reachability characterization of deterministic logspace It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of SL (complexity). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Smoothness (probability theory) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally assigns probability laws to decay-regime categories by explicit Fourier-envelope rules; deconvolution semantics and asymptotic orders supply the domain-specific residual. The edge is proposal-only and points to a frozen prior-baseline Prime. The entry does not collapse into the parent because the Fourier-tail regularity taxonomy used to type the ill-posedness of a convolution inverse problem, not smoothness in ordinary prose, finite differentiability alone, or a generic property of probability distributions A thematic neighbor is declined whenever it does not literally subsume that rule. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Snark (graph theory) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Snark (graph theory) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the finite undirected graph, cubic degree condition, connectedness and bridges, chromatic index four, explicit failure of every three-edge-coloring, girth and cyclic connectivity convention, planarity consequence and treatment of trivial examples are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Snark (graph theory). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Spectrum (functional analysis) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Spectrum (functional analysis) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the scalar field, Banach or Hilbert space, bounded or closed operator and domain, shifted-operator convention, inverse domain and boundedness, spectrum subtype, topology, and essential-spectrum convention are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Spectrum (functional analysis). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Sporadic group Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.Sporadic groups are the exceptional residue of a complete classification; finite-group structure supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Sporadic group adds domain-specific constraints. The entry does not collapse into that parent because the finite list of exceptional simple-group identities and their distinctive interrelations outside all infinite classification families It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Sporadic group. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Square number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Square number adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the integer domain, inclusion of zero, witness integer or exact square root, exponentiation convention, sign and any modular or factorization criterion are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Square number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- STRIDE Model Domain-specific is a kind of Classification
**Classification** is the proposed immediate parent.Attack Surface, Boundary, Adversarial Thinking, Defense in Depth, and Risk Assessment are related. The prospective queue contains one strict edge to `prime:classification`. No live DAG mutation is authorized.
- Størmer number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Størmer number adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by n is positive and the greatest-prime-factor inequality is tested on exactly n squared plus one under the stated equality convention It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Størmer number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Structural type system Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The system classifies program values by structural properties; static compatibility rules supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Structural type system adds domain-specific constraints. The entry does not collapse into that parent because compile-time property-based compatibility and subtyping independent of explicit name lineage It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Structural type system. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Stylometry Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Stylometry adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the questioned work and candidate population, corpus provenance and segmentation, feature representation, preprocessing, model and distance, training and validation design, topic and genre controls, attribution threshold, uncertainty and adversarial conditions are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Stylometry. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Subfield of an algebra Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The identity classifies subalgebras by the stronger field condition; internal extension structure supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Subfield of an algebra adds domain-specific constraints. The entry does not collapse into that parent because field extension realized internally inside a possibly noncommutative algebra It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Subfield of an algebra. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Sublime number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The property classifies integers by two divisor-function tests; perfect-number arithmetic supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Sublime number adds domain-specific constraints. The entry does not collapse into that parent because simultaneous perfectness of two divisor-function values It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Sublime number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Subminor and supermajor Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Subminor and supermajor adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the tuning and reference pitch, interval number and direction, frequency ratio or cents, diminished, minor, major and augmented boundaries, naming convention and inversion relation are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Subminor and supermajor. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Suburb Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Suburb adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the metropolitan area and period, jurisdiction and naming convention, boundary and spatial scale, density and land use, commuting and functional relation, governance, demographic evidence and comparison with core and exurb are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Suburb. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Superalgebra Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Superalgebra adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the base, algebra laws, direct even–odd decomposition, homogeneous parity, and parity-preserving multiplication rule are explicitly satisfied It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Superalgebra. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- T-structure Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.A t-structure classifies objects by categorical degree and truncation; homological orthogonality supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while T-structure adds domain-specific constraints. The entry does not collapse into that parent because categorical degree structure recovering abelian objects inside derived settings It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of T-structure. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Taxocene Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Taxocene adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the habitat and community boundary, time period, selected taxon and rank, current taxonomy, species inclusion and detection method, life stage and transient policy, sampling completeness, abundance or presence representation, functional heterogeneity, and comparison design are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Taxocene. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- THEMATICS Domain-specific is a kind of Classification
THEMATICS instantiates Classification because it assigns structural residues and their clusters to candidate functional-site classes by a repeatable feature-and-decision rule.The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Theory of categories Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its ontology conditions supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Theory of categories adds domain-specific constraints. The entry does not collapse into that parent because The ontological project of identifying the highest and most general kinds of being and the fundamental distinctions among entities It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Theory of categories. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Thick concept Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The concept literally classifies cases under application criteria; evaluative loading and disentangling disputes supply the philosophical residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Thick concept adds domain-specific constraints. The entry does not collapse into that parent because the inseparable or systematically coupled descriptive–evaluative profile of one concept It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Thick concept. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Three-age system Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Three-age system adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the region and period, archaeological assemblages, material and technology criteria, Stone, Bronze and Iron subdivisions, transition evidence, chronology and known nonapplicability are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Three-age system. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Three-dimensional space Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The identity classifies spaces by intrinsic dimension; geometric coordinate structure supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Three-dimensional space adds domain-specific constraints. The entry does not collapse into that parent because three-coordinate geometric carrier underlying spatial modeling and three-manifold theory It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Three-dimensional space. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Topostratigraphy Domain-specific is a kind of Classification
**Classification** is the strongest parent.Topostratigraphy assigns parts of a rock succession to named units under a rule combining lithologic and paleontological criteria. **Correlation** links occurrences among outcrops, boreholes, districts, and regional stages. It is essential machinery but not the whole identity. **Boundary** appears in the placement of unit bases and tops. The defining controversy is often which observable change controls a boundary. **Textual Definition** matters because formal geological nomenclature must state the criteria under which a unit name applies, and legacy topostratigraphic names can conceal mixed criteria. The proposed DAG uses one strict subsumption edge to Classification. The remaining nodes stay explanatory.
- Torrejonian Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Torrejonian adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the NALMA framework, defining mammal taxa and localities, lower and upper boundaries, subdivisions, numerical calibration, correlation method and revision status are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Torrejonian. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Traditional grammar Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Traditional grammar adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the language and variety, historical grammar tradition and source, parts-of-speech inventory, morphological paradigms, syntactic categories and parsing rules, descriptive or prescriptive aim, examples and treatment of language-specific structures are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Traditional grammar. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Transcendental theology Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The concept classifies rational-theological inference into ontotheological and cosmotheological routes; Kant's critical boundary supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Transcendental theology adds domain-specific constraints. The entry does not collapse into that parent because Kantian taxonomy and critique of pure-reason routes to theology It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Transcendental theology. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Transect (urban) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Transect (urban) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the planning geography and existing context, rural-to-urban gradient, zone sequence and boundaries, density and mix, building type and frontage, street and block form, civic and open-space elements, transition and special-district rules and calibration and coding instrument are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Transect (urban). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Transparency and translucency Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The terms classify optical transmission by scattering and image preservation; material optics supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Transparency and translucency adds domain-specific constraints. The entry does not collapse into that parent because paired material-property distinction between clear and diffuse light transmission It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Transparency and translucency. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Trilobite zone Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The zone classifies and correlates strata using diagnostic fossil assemblages; trilobite biostratigraphy supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Trilobite zone adds domain-specific constraints. The entry does not collapse into that parent because trilobite-based Cambrian biochronologic subdivision and correlation It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Trilobite zone. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Turing degree Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its computability_theory constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Turing degree adds domain-specific constraints. The entry does not collapse into that parent because An equivalence class of sets or decision problems under mutual Turing reducibility, representing one level of relative computability It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Turing degree. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Twelvefold Way Domain-specific is a kind of Classification
The Twelvefold Way specializes `prime:classification`: counting problems are assigned to discrete cells by explicit rules.It also relates to `prime:allocation`, because objects are distributed among recipients, and to `prime:partition`, because several unlabeled cells are set or integer partitions. Classification is the minimal proposed parent; Allocation and Partition describe cell content rather than the whole grid's ancestry.
- Type site Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Type site adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the archaeological unit and naming history, reference site and context, diagnostic materials and features, chronology, comparison criteria, geographic scope, later revisions and evidential limits are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Type site. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Type theory Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Type theory adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the syntax of terms types and contexts, judgment forms, formation introduction elimination and computation rules, substitution and definitional equality, typing derivations and metatheorems, propositions-as-types interpretation, semantic model and specific type-theory variant and foundational or programming use are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Type theory. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Ugly duckling theorem Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The candidate literally instantiates prime:classification; its philosophy_of_classification restrictions supply the domain-specific residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Ugly duckling theorem adds domain-specific constraints. The entry does not collapse into that parent because A formal result showing that, when every logically definable predicate is weighted equally, any two distinct objects share the same number of properties, so similarity requires inductive bias It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Ugly duckling theorem. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Univariate Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.The adjective classifies formal objects by input arity; one-variable mathematics supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Univariate adds domain-specific constraints. The entry does not collapse into that parent because one-variable arity class spanning algebraic and statistical objects It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Univariate. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Unusual number Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Unusual number adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the natural number n greater than one, prime factorization, largest prime factor P of n, strict inequality P greater than square root n, equivalent non-smoothness criterion, prime and composite cases and asymptotic density result are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Unusual number. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Unverified Personal Gnosis Domain-specific is a kind of Classification
UPG specializes `prime:classification`: a claim is assigned an epistemic/provenance category by explicit source and corroboration criteria.It also relates to `prime:epistemic_humility`, because disclosure can calibrate confidence, and `prime:sacred`, because the claimed content belongs to religious relations. Classification is the proposed minimal parent; Sacred identifies domain but does not supply the labeling operation.
- Variable-order Bayesian network Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Variable-order Bayesian network adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the random variables and permissible ordering, observed context or realization, context-selection rule, variable parent set, conditional probability tables or trees, acyclicity and factorization, normalization, parameter learning and smoothing, structure selection and complexity control, inference procedure and comparison with fixed Bayesian and variable-order Markov models are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Variable-order Bayesian network. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Violent non-state actor Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Violent non-state actor adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by actor boundaries, organization, independence from formal state command, violence capability and use, aims, territorial and social base, financing, sponsorship, and time period are established It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Violent non-state actor. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Von Neumann–Bernays–Gödel set theory Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Von Neumann–Bernays–Gödel set theory adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by objects satisfy the NBG set-class typing and axioms, and any asserted set-only consequence respects the conservative-extension relation It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Von Neumann–Bernays–Gödel set theory. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Webbed space Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Webbed space adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by there exists a family satisfying the declared web axioms and strand convergence condition for the space’s topology It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Webbed space. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Westphalian (stage) Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Westphalian (stage) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the regional chronostratigraphic scheme, type areas and sections, lower and upper boundaries, subdivisions, fossil and lithologic markers, numerical ages and correlation to global stages are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Westphalian (stage). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Will Rogers phenomenon Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.prime:classification is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Will Rogers phenomenon adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the unchanged observations and two initial groups, their sizes and means, reclassification rule, moved observations, inequalities placing moved values between group means, recomputed means, invariance of the pooled population, apparent versus real improvement and applications such as diagnostic stage migration are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Will Rogers phenomenon. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Zygosity Domain-specific is a kind of Classification
The proposed strict upward parent is `prime:classification`.Zygosity classifies allele-copy relationships under ploidy; genetic locus context supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Zygosity adds domain-specific constraints. The entry does not collapse into that parent because copy-relative genotype relationship rather than an allele's identity by itself It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Zygosity. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:classification`. No live DAG mutation is authorized.
- Clustering Prime is a kind of Classification
Clustering is classification specialized to discovering categories from within-group similarity without predefined labels.Both assign entities to a finite category structure for downstream reasoning. Clustering adds the differentia that group boundaries and labels are outputs inferred from a chosen feature space and similarity rule rather than inputs supplied in advance.
- Evaluative Rating Prime is a kind of Classification
A rating is an ORDERED classification in which the order, not the category label, does the load-bearing work — classification PLUS a fixed ordered scale and rater and designed use and compression.A specialization of classification along the order axis. Classification supplies the genus: Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action. Evaluative Rating preserves that general structure while adding its differentia: Compress an evaluative judgment into a position on a shared ordered scale that downstream actors can act on without re-examining the evidence. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.
- Missing Data Mechanisms (MCAR, MAR, MNAR) Prime is a kind of Classification
Missing-data mechanisms is a specific kind of classification, sorting missingness processes into three categories that determine valid handling.Missing-data mechanisms is a specialization of classification. The general pattern assigns entities to discrete categories according to explicitly defined rules, with the category structure carrying meaning about what properties matter and what purposes the grouping serves. Rubin's MCAR/MAR/MNAR taxonomy instantiates this by sorting missingness processes into three bins defined by whether missingness is independent of all variables, conditional on observed values only, or dependent on the unobserved values themselves. The classification is consequential because it determines which estimation procedures yield valid inference.
- Pattern Recognition Prime is a kind of Classification
Pattern recognition is a specialization of classification in which the assignment of a stimulus to a known category proceeds by feature matching against stored representations.Pattern recognition is a specialization of classification in which the rule-application is implemented by matching a stimulus's observable features against stored category representations: templates, prototypes, exemplars, or learned hierarchical detectors. It inherits the general classification commitment that entities are assigned to discrete categories according to explicit criteria, with the assignment carrying meaning for downstream reasoning. Its specialization is to identify the stimulus as an instance of a known category via similarity-driven feature analysis rather than via explicit rule application or definitional checklist.
- Prototype Theory Prime is a kind of Classification
Prototype_theory is 'a specific model of category structure — center-with-gradient' standing against the definitional (necessary-and-sufficient) model; classification is the broad activity of sorting by any rule.The two great models of what a category is; prototype_theory is one species of classification. Classification supplies the genus: Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action. Prototype Theory preserves that general structure while adding its differentia: Categories are organized around their best examples rather than by necessary-and-sufficient definitions, modeling kinds as centers with gradients rather than boxes with edges. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association.
- Qualitative property Prime is a kind of Classification
The accepted reference-grade review places Qualitative property under Classification because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.A property records kind, state or category without its identity depending on a numerical magnitude or arithmetic distance. The parent is defined more broadly: Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.
- Reality Monitoring Prime is a kind of, typical Classification
Reality monitoring is the use-time CLASSIFICATION of each stored item by source class (internally-generated vs externally-perceived) from source-correlated features — a specialized classification with its own signal-detection (d'/criterion) structure.Classification supplies the genus: Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action. Reality Monitoring preserves that general structure while adding its differentia: A system holding items from multiple source classes must, at use-time, attribute each item to its source — most basically internally-generated versus externally-perceived — with characteristic errors when the cues mislead. The parent can occur without those added commitments, whereas removing the parent structure leaves no basis for classifying the child as this subtype. That asymmetry establishes subsumption rather than mere association. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.
- Source-Sink Role Prime is a kind of Classification
A source-sink role is a classification specialized by an explicit signed-net-flux rule.It sorts bounded components into discrete source, sink, or balanced roles by applying one reusable decision rule: compute net transfer relative to a reference pool over a stated window and read its sign. It adds the boundary, window, tracked-quantity, and sign-flip commitments to the general classification operation.
- Controlled Descriptor Domain-specific presupposes Classification
A Controlled Descriptor presupposes the explicit topic-category assignment process whose reusable rule and boundaries make it an indexing category.The child exists to let trained indexers decide whether a resource falls within a governed topic scope and assign it to that category for downstream retrieval. A preferred string could exist without this operation, but a descriptor without rule-governed resource-to-category assignment loses its identity.
- Empathising–Systemising Theory Domain-specific presupposes Classification
**Classification** is the minimal proposed parent.E–S theory presupposes a rule that maps standardized relative scores to named profile classes. Classification can occur without empathising, systemising, psychometrics, sex-coded comparisons, or autism, so the direction is strict. **Measurement** is a constitutive related prime: each dimension must be operationalized, scored, standardized, and evaluated for validity. It is not proposed as an additional parent because particular EQ/SQ instruments are replaceable and the minimal DAG should state the narrowest stable genus rather than every dependency. **Difference** and **Threshold** describe the D = S - E transformation and category cut points. **Theory of Mind** overlaps the mental-state-inference portion of empathising but not affective response, systemising, or classification. **Stereotyping** identifies a misuse route when group averages are converted into deterministic judgments about individuals; it does not cover the theory's measurement-and-test structure. **Systems Thinking** is a lexical neighbor, not an ancestor.
- Inter-Annotator Agreement Domain-specific presupposes Classification
Inter-Annotator Agreement presupposes Classification because its raters must independently assign the same items under one fixed category scheme.Without entities, discrete categories, and an assignment rule there are no labels whose convergence can be measured. IAA audits the reproducibility of that classification operation rather than supplying the categories itself.
- Joyal Model Structure Domain-specific presupposes Classification
**Classification** is the minimal accepted parent: the model structure assigns morphisms to three rule-governed, possibly overlapping classes whose interactions authorize downstream operations.The edge is compositional rather than taxonomic; Classification alone does not supply model axioms or higher-category semantics. **Equivalence Relation** is related through localization and sameness after zigzags, but weak equivalences themselves are a class of morphisms, not literally an equivalence relation on all morphisms. **Factorization** is related, although the catalog prime's product-factor meaning is not the model-category meaning and is therefore declined as a parent. **Quillen Adjunction** is a downstream neighbor: it presupposes model structures and cannot coherently parent this one.
- Knowledge organization system Domain-specific presupposes Classification
**Classification** (`prime:classification`).A KOS partitions or orders concepts for practical organization.
- Religious War Domain-specific presupposes Classification
the node sorts conflicts or conflict segments by an explicit, defeasible rule; this is the smallest prospective parent.the node sorts conflicts or conflict segments by an explicit, defeasible rule; this is the smallest prospective parent.
- Resource-Typing Mismatch Domain-specific is part of Classification
Resource-typing mismatch contains a capability classification whose categories are too coarse for the task's operational tolerance.The requisition system assigns resources to named classes, but a class hides a capability spread larger than the receiving task can absorb. Classification is an internal constitutive mechanism rather than the failure's genus; the child adds delivery through mutual aid and arrival-time discovery of the task-fit gap.
- Thematic Analysis Domain-specific is part of, typical Classification
Codebook, coding-reliability, and deductive thematic analysis typically contain classification when passages are assigned to explicit reusable categories under stated rules.Inductive and reflexive variants can generate and revise categories through situated judgment and need not promise reproducible rule-based assignment. Classification supplies an internal constituent: Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action. Thematic Analysis requires that role within this mechanism: Turn interpreting a qualitative corpus into an auditable procedure — a six-phase chain from familiarisation through coding to reviewed, named themes — plus declared axis-settings that together fix both what a theme means and how it is warranted. Remove the parent-role and the child loses a required internal operation, even though the parent can exist outside the child. The child is therefore built from the parent rather than being a taxonomic kind of it. The typical qualifier limits the claim to the characteristic route, not a constitutive requirement of every instance; exceptions must retain the child's identity through another mechanism.
- Native-Category Flattening Prime presupposes, typical Classification
The failure is a lossy recoding of a source's meaning-bearing partition into a foreign taxonomy; it presupposes a classification/recoding act and names its destructive (merge/split, irrecoverable) special case.Built on the recoding step.
- Phase Diagram Prime presupposes Classification
Phase Diagram presupposes Classification: it partitions parameter space into discrete phase regions according to qualitative-distinction rules.A phase diagram divides a parameter space into regions labeled by qualitatively distinct phases, with boundaries where order parameters jump or become singular. Constructing the diagram requires the prior operation of Classification — assigning configurations to discrete categories by explicit criteria. Without classification rules deciding which configurations count as the same phase, the diagram's regions and boundaries have no content; the diagram is a graphical instantiation of a classification scheme over a continuous control space.
- Segmentation and Boundary Drawing Prime presupposes Classification
Segmentation and boundary drawing presupposes classification because partitioning a continuous domain into discrete categories requires a category structure to draw boundaries within.Segmentation and boundary drawing presupposes classification because the work of partitioning a continuous domain — placing boundaries that decide where one category ends and another begins — only makes sense relative to a category structure being assigned. Classification supplies the deliberate process of sorting items into discrete categories according to defined rules; segmentation supplies the upstream operation of placing the boundaries themselves within a continuous substrate. Without classification's category-structured target, there would be nothing for the boundary placements to be boundaries between, and small boundary shifts would not propagate into changed classification outcomes.
- Self Engagement Under Misclassification Prime presupposes, typical Classification
The architecture presupposes a self/other classifier as one obligatory role; the prime is the consequence when that classifier gates a harm-producing effector over shared machinery.Presupposes classification (one role, not the whole).
- Social Identity Theory Prime presupposes Classification
Social identity theory presupposes classification because deriving self-concept from group membership requires categories that sort people into kinds.Social identity theory begins with social categorization — the cognitive operation by which people parse the social world into discrete categories (nation, occupation, religion, team). Without that prior sorting work, there is no category for the self to identify with and no in-group/out-group structure for the rest of the theory to operate on. Classification supplies exactly this deliberate process of assigning entities to discrete categories according to defined criteria. Social identity theory presupposes that classificatory operation as the substrate on which identification, comparison, and intergroup behavior then build.
- Stereotyping Prime presupposes Classification
Stereotyping presupposes classification because applying generalized category beliefs requires that categories already sort people into kinds.Stereotyping is the cognitive process of applying generalized category beliefs to individual members of a category, projecting an associated prototype without detailed assessment. That projection presupposes the prior classificatory work that produces the categories themselves: the agent must already sort the social world into race, gender, age, occupation bins before any stereotype can be activated. Classification supplies the deliberate category-assignment apparatus on which stereotyping then operates by attaching content-rich expectations to category membership and projecting them onto individuals.
- Excludability Domain-specific is a decomposition of Classification
Excludability is a rule-based axis that assigns goods to provision regimes and crosses with rivalry to yield a reusable four-cell map.The node does more than describe a gate. It supplies explicit criteria, category boundaries, edge cases that move with technology, and downstream policy inherited from category placement—the full Classification operation.
- Field Boundary Marker Domain-specific is a decomposition of Classification
A Field Boundary Marker is the research-administration form of rule-governed assignment to a named category for downstream action.The marker is an assignment artifact rather than the generic sorting process, so decomposition preserves the type distinction. Named fields, membership conventions, and routing uses are differentia over Classification.
- Musical Texture Domain-specific is a decomposition of Classification
Removing musical vocabulary leaves explicit membership criteria that sort unbounded passages into a finite reusable map of discrete structural classes.The child’s domain vocabulary can be removed while the parent’s roles remain, so the relation records portable structural cargo rather than taxonomic identity.
- Precoordinated Heading Domain-specific is a decomposition of Classification
A precoordinated heading is a catalog-specific design for assigning resources to governed composite categories under explicit construction rules.It is not the generic act of Classification, but its authority-controlled labels, membership criteria, and reusable placement map retain that core when subject-heading machinery is removed.
- Retrieval Facet Domain-specific is a decomposition of Classification
A retrieval facet assigns resources to governed values along one explicit criterion.After the linguistics_semiotics frame is stripped away, the retained structural roles are those of Classification: Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action. Retrieval Facet adds the local frame and commitments expressed in its identity: Expose one controlled descriptive dimension as an independently selectable and filterable axis whose values can be combined at query time with values selected on other axes. The parent pattern remains recognizable without that vocabulary, while the child is the framed realization of it. That preservation test establishes decomposition rather than taxonomic subsumption.
- Type System Domain-specific is a decomposition of Classification
Removing formal-language machinery from a type system preserves explicit rule-based assignment of expressions and values to reusable categories.Type categories compress unbounded expressions into a finite vocabulary used by checking and reasoning. Classification is one load-bearing core, but subsumption would overstate identity because a type system also governs legal operations and certifies soundness rather than merely sorting.
- Primary vs. Secondary Sources Prime is a decomposition of Classification
Primary-vs-secondary sources is the specific shape classification takes when evidence is sorted by causal and temporal proximity to the phenomenon studied.Primary-vs-secondary sources is the specific shape classification takes when the entities being sorted are evidentiary materials and the criterion is causal-temporal proximity to the phenomenon under study: primary materials are produced by or in direct contact with the phenomenon at its time of occurrence, secondary materials interpret or synthesize primary materials afterward. It is a structurally-particularized instance of assigning items to discrete categories by explicit criteria, with the added commitment that the classification governs argumentative use — primary materials supply evidence, secondary materials supply interpretation — and that boundary cases require source-criticism.
- Stakeholder Analysis Prime is a decomposition of Classification
Stakeholder analysis is the specific shape classification takes when applied to parties with a legitimate interest in a decision or project.Classification is the deliberate process of assigning entities to discrete categories according to explicit rules. Stakeholder analysis is the particular shape this operation takes when the entities are parties with a stake in a decision and the categories sort them by interest, power, legitimacy, urgency, or relationship to the outcome. It is a structurally-particularized instance of classification whose specific machinery is enumeration of parties, criteria for sorting them into bins (high-power high-interest, low-power high-interest, etc.), and a management plan keyed to the resulting category structure.
Neighborhood in Abstraction Space¶
Classification sits among the more crowded primes in the catalog (7th percentile for distinctiveness): several abstractions describe nearly the same structure, so a description that fits it will tend to fit its neighbors too — transporting it usually means disambiguating within this family rather than landing on it exactly.
Family — Monitoring, Control & Verification (19 primes)
Nearest neighbors
- Interpretation — 0.78
- Predictive Coding — 0.77
- Transformation — 0.77
- Learning — 0.76
- Comparison — 0.76
Computed from structural-signature embeddings · 2026-09-10
Not to Be Confused With¶
Classification must be distinguished from Pattern Recognition, its nearest neighbor (similarity 0.727), on the basis of intentionality and structure. Pattern Recognition is the cognitive and algorithmic process of identifying recurring structures or regularities in data without requiring predefined categories. A pattern-recognition system observes data (music, faces, stock prices) and detects recurring features, clusters, or statistical regularities—the system operates bottom-up from data. Classification, by contrast, is top-down: predefined categories exist, explicit rules or criteria define membership, and the system's task is to assign entities to those categories. Pattern recognition discovers structure; classification imposes structure. A person viewing paintings might recognize a recurring style (bold colors, gestural brushwork) emerging from the data (pattern recognition); the same person classifying paintings by artist uses predetermined categories (Picasso, Matisse, Kandinsky) and applies criteria for assignment (visual features known to characterize each artist's work). The pattern-recognizer might discover that unattributed paintings cluster into four distinct styles before knowing who painted them; the classifier already knows the categories and is assigning works to them. Pattern recognition can inform classification (discovered patterns become the criteria for categories), but the two mechanisms are structurally distinct. A machine-learning system trained to recognize handwritten digits performs classification (each digit is a predefined category); the same system trained to cluster unlabeled digits into groups of similar appearance performs pattern recognition (no predefined categories, only discovered structure).
Classification is further distinct from Ontology, though both involve category systems. An ontology is a formal specification of the entities, concepts, relationships, and axioms in a domain—it defines what things exist, how they relate, and what properties they have. Ontology is about knowledge representation and semantic structure. Classification is about assigning instances to categories. An ontology might specify that "Vehicle" is a category with subcategories "Car," "Truck," "Motorcycle," and that cars have a property "number of doors"; a classification system uses those categories to assign specific vehicles (this Volkswagen is a car, that Ford is a truck). The ontology defines the structure; the classifier applies it. An ontology without classification is a knowledge specification with no instances being sorted; a classification without ontology (or with only implicit ontology) assigns items to categories without formally specifying what those categories mean or how they relate. A biological taxonomy like Linnaean classification is both ontology (it specifies the structure of biological kinds) and classification system (it assigns organisms to categories within that structure).
Classification is also distinct from Representation—the formal structure that encodes knowledge about entities. Representation is about how information is structured (in symbols, data structures, neural networks); classification is about how entities are sorted into categories. A medical representation might encode knowledge about a disease (symptoms, risk factors, treatments) in a patient record; classification uses that representation to assign patients to diagnostic categories. The representation is the knowledge base; classification is the assignment process. These are related but separable: one might have a rich representation without using it for classification (a medical textbook represents knowledge but doesn't classify specific patients), or one might classify with minimal representation (a simple rule classifies emails as spam/not-spam based on a few features, without representing the full semantic content of the email).
Finally, Classification is not Sequencing or ordering. Sequencing arranges items in a temporal or logical order (first, second, third; easiest to hardest; past, present, future). Classification groups items by their properties independent of sequence. A library classification system groups books by subject (history, fiction, science), not by when they were acquired or in which order a reader should read them. A timeline sequences events chronologically; a classification of those events by cause, outcome, or significance is independent of their temporal order. Both can operate on the same set of items (books can be classified by subject and sequenced chronologically), but they are different operations with different purposes. Classification emphasizes similarity within groups and difference between groups; sequencing emphasizes order and progression.
Solution Archetypes¶
Solution archetypes in the catalog that build on this prime — directly (this prime is a source ingredient) or as a related prime.
Built directly on this prime (12)
- Boundary-Sensitive Segmentation Design: Partition a continuum into actionable segments by making boundary purpose, evidence, granularity, ambiguity, sensitivity, consequences, and revision explicit.▸ Mechanisms (12)
- Binning and Discretization Scheme — Converts a continuous variable into a fixed set of ordered intervals by choosing, as a reusable rule, how many bins to cut and where their edges fall.
- Boundary Change Log — A dated, append-only record of every boundary revision — old definition, new definition, rationale, approver, and effective date — so past assignments stay interpretable.
- Boundary Sensitivity Analysis — Perturbs each cutpoint by plausible amounts and counts how many cases — and how much downstream consequence — flip, exposing where a boundary is fragile.
- Change-Point Segmentation — Places segment boundaries where an ordered signal statistically shifts — a change in mean, variance, or rate — so cuts fall at the data's own joints rather than at chosen values.
- Clustering-to-Boundary Workflow — Turns exploratory clusters into an operational segmentation by naming the groups, stabilizing them, and translating fuzzy membership into a reproducible boundary rule.
- Geographic Zoning Map — A spatial partition of territory into zones that each carry distinct rules, rights, and permitted uses, ideally drawn along natural and built features rather than arbitrary lines.
- Image-Region Segmentation Pipeline — Derives candidate region boundaries directly from image data — modeling the pixel field and letting empirical contrast, texture, and learned features propose where the seams fall.
- Manual Boundary Review Queue — Routes the cases an automated cut can't safely resolve to human reviewers, whose accumulated rulings become a deliberative record of how the boundary is actually applied.
- Overlap-Band Assignment — Replaces a single crisp cut with a band around it, inside which cases receive graded, dual, or 'borderline' membership instead of being forced to one side.
- Score-Banding Model — Groups an ordered score into a small set of named, meaningful bands — deciding how many bands the decision can sustain and what each band is actually allowed to claim.
- Segmented Holdout Validation — Tests a boundary on held-out cases it never saw — stratified so transition, tail, and subgroup cases are checked on their own rather than hidden inside one flattering aggregate score.
- Threshold and Cutpoint Table — Records the exact cutpoints that assign each case to a segment, together with the inclusivity, rounding, and missing-value conventions that make the assignment reproducible.
- Dispute-Question Alignment: Stop arguing over answers until the parties have identified which kind of question they are actually contesting.▸ Mechanisms (8)
- Burden and Standard Alignment Table — Binds each stasis type to the evidence it admits, the burden and threshold it must clear, and the answer form it demands — so proof is matched to the question.
- Cross-Stasis Dialogue Protocol — A turn-by-turn conversational ruleset that catches an answer aimed at the wrong question in real time and names the equivocation as it happens.
- Fact-Definition-Quality-Policy Matrix — A fixed grid whose columns are the stasis question types; sorting each claim into a cell both labels it and dictates what a valid answer must look like.
- Formal Decidability Probe — For a question handed to an automated or formal decider, tests whether it actually admits a terminating decision procedure — or whether the promised verdict is impossible.
- Jurisdictional Stasis Routing Check — Decides whose call each typed question is — which forum or authority is competent — and routes each to the body or neighbor archetype that can validly decide it.
- Point-at-Issue Intake Form — A single front-door form that captures the contested claims in each party's own words and attaches a provisional question-type label before any argument begins.
- Stasis Mapping Workshop — Gets every party in one room to co-build the stasis map — claims, question types, live mismatches, and sequence — as a single shared artifact.
- Stasis Review Memo — The closing written record of a stasis process — states which question was controlling and why, what was decided, what remains open, and what would reopen it.
- Emergent Similarity Partitioning: Find provisional groups by similarity when labels are not given, then validate and interpret the partition before using it.▸ Mechanisms (10)
- Centroid Clustering Model
- Cluster Label Review Workshop — Convenes domain experts to inspect candidate clusters, name them cautiously, adjudicate boundary and outlier cases, and set the terms under which the labels may be used downstream.
- Cluster Profile Card
- Cluster Validation Report
- Density-Based Clustering
- Embedding-Then-Clustering Pipeline — Represents cases as learned embedding vectors and clusters them in that space, so groups emerge from semantic proximity rather than hand-picked attributes.
- Graph Community Detection
- Hierarchical Dendrogram
- Mixture Model Clustering
- Resampling Stability Check
- Empirical Cluster Discovery: Discover provisional groups in unlabeled observations by making representation, similarity, validation, interpretation, and downstream use explicit.▸ Mechanisms (9)
- Centroid Clustering Model
- Cluster Profile Card
- Cluster Validation Report
- Density-Based Clustering
- Graph Community Detection
- Hierarchical Dendrogram
- Mixture Model Clustering
- Null Structure Comparison — Tests whether the clusters an algorithm found are stronger than the groupings it would invent from structureless data, crediting them only when they beat a chance baseline.
- Resampling Stability Check
- Fast/Slow Path Routing: Route routine cases through a cheap, safe fast path while sending exceptional, ambiguous, risky, or high-value cases to a deliberately resourced slow path.▸ Mechanisms (9)
- Automated Pre-Screen with Manual Review — A workflow that uses cheap automated checks before routing flagged cases to human or specialist review.
- Cache with Authoritative Fallback — A system that serves common requests from a fast cache and routes misses or conflicts to an authoritative source.
- Confidence Threshold Router — A score- or uncertainty-based router that escalates low-confidence or high-risk cases.
- Deoptimization or Fallback Handler — A fallback routine that sends optimized fast-path execution back to a more general slower handler when assumptions fail.
- Escalation Playbook — Specifies who is notified, what decisions are opened, and what actions become available when a signal crosses an escalation boundary.
- Exception Queue Dashboard — A dashboard that tracks slow-path volume, age, causes, outcomes, and recurrence.
- Fast-Track Lane with Audit — A low-friction lane for eligible cases paired with sampling, appeal, and outcome review.
- Happy-Path / Exception Workflow — A process design that defines a streamlined normal route and an explicit exception route.
- Triage Rule Table — A documented set of routing criteria for sending cases to fast path, slow path, audit, pause, or return.
- Nearest-Exemplar Response Reuse: Use the closest remembered or stored case as the model for the present response, while making similarity, adaptation, confidence, and exception boundaries explicit.▸ Mechanisms (8)
- Case Similarity Rubric — A fixed, weighted scoring sheet that grades how well one candidate exemplar fits the new case and flags the mismatches that should veto reuse regardless of the score.
- Case-Based Reasoning System — Runs the full retrieve–reuse–revise–retain loop, but earns its keep at the revise step: it adapts a retrieved case's solution to the new case's specific differences rather than copying it.
- Exemplar Feedback Registry — Logs what happened every time an exemplar was reused and uses those outcomes to broaden, narrow, or retire each stored case's authority — so the case memory sharpens instead of fossilizing.
- Expert Case Recall Checklist — Forces an expert's tacit 'this reminds me of a case' into an explicit, auditable comparison — which case, why it's close, and where the resemblance breaks.
- Incident Playbook Lookup — Under time pressure, pulls the closest matching past incident and runs its response as the immediate starting action — bounded to the steps this incident actually covers.
- K-Nearest-Neighbor Case Matcher — Answers a new case by polling its k nearest stored neighbors and letting them vote, reading confidence straight off how much the neighborhood agrees.
- Precedent Matching Workflow — Treats a prior decision as binding guidance so like cases are decided alike — reusing the earlier ruling for consistency, and departing only by formally distinguishing the new case.
- Similarity Search over Case Embeddings — Encodes every stored case as a vector and finds the nearest ones by a learned distance in that space — matching on raw concrete content instead of hand-built features or abstract rules.
- Priority-Based Admission: Admit candidates at a boundary by an explicit priority policy so scarce capacity is reserved for higher-priority flows.
- Prototype-Centered Category Modeling: Model a category by its clearest examples and graded resemblance to them, rather than pretending every useful category has a crisp essence.▸ Mechanisms (13)
- Boundary Case Review Panel — A standing panel that adjudicates the hard cases no rule resolves, turning each decision into boundary precedent and serving as the category's appeal path.
- Calibration Workshop — Convenes the people who judge the category to align on shared reference cases and on how context reweights typicality, so their independent calls converge.
- Card Sort or Example Sort — Has people sort real examples into piles so the category's natural dimensions, sub-groups, and fuzzy edges surface from behaviour rather than from a definition.
- Classification Disagreement Audit — Measures where classifications diverge — reviewer vs reviewer, human vs model — to expose systematic bias and human-model misalignment.
- Drift Sample Review — Periodically re-judges a fresh sample of recent cases to catch the category's prototype drifting, and triggers revision of the reference cases before the drift is baked in.
- Golden Case Benchmark — A curated library of canonical input-to-output cases, captured from the current system, that serves as the fixed reference for judging whether a refactor changed observable behavior.
- Graded Membership Table — Lays out each case with its degree-of-membership score and typicality zone, making the category's centre — and the handling each zone gets — visible at a glance.
- Near-Miss Comparison Set — Sharpens a category's boundary with minimal pairs — a genuine member set beside near-identical nonmembers that differ on the single feature that actually decides membership.
- Nearest-Neighbor or Exemplar Classifier — Classifies a new case by its similarity to stored labeled exemplars — no explicit rule, just which known cases it most resembles — and routes it by how confidently it lands.
- Positive / Negative Example Deck — A curated deck of clearly-labeled positive and negative examples — each carrying its rationale and the action it triggers — that installs a category's center and purpose in a new judge.
- Prototype Embedding Map — Projects examples into a spatial map so the category's center, its multiple sub-clusters, and how membership thins toward the edges become visible at a glance.
- Similarity Dimension Rubric — Names the dimensions along which resemblance to the prototype is judged, sets their weights (which can shift by context), and fences off the dimensions that must never count.
- Typicality Rating Exercise — Has people rate how typical each example is of a category, turning intuition into a graded ranking that surfaces the clearest anchors and the fuzzy middle.
- Purity-Pollution Boundary Governance: Make clean/contaminating status, transfer paths, containment rules, and restoration paths explicit so purity logic can protect without becoming arbitrary exclusion.▸ Mechanisms (11)
- Allergen Segregation Plan — Keeps declared allergens from cross-contacting other products in a shared facility by separating ingredients, equipment, and runs, and holding any residual transfer below a reaction threshold.
- Aseptic Field Protocol — Establishes a protected sterile field defined by a strict clean/contaminated binary, and governs it with an 'only sterile may touch sterile' contact rule.
- Chain-of-Custody Log — Maintains an unbroken, timestamped record of every hand and transfer an item passes through, so any later claim about its status can be audited back to origin.
- Pollution Pricing or Liability Rule — Makes a polluting transfer accountable by attaching a price or liability to it, sized to the harm, so the cost falls on the polluter instead of being externalized downstream.
- Quarantine Label and Hold — Physically sets suspect or unverified items aside in a bounded holding zone until their status is resolved, with an explicit rule for what it takes to release them back.
- Red/Green Status Tagging — Makes a decided clean, restricted, or contaminated status visible at a glance through a simple standardized marker anyone can read without expertise or lookup.
- Ritual Ablution or Cleansing Act — Restores impure or restricted status to clean through a culturally recognized cleansing act whose power rests on legitimacy, not physical change.
- Stigma Escalation Review — Checks whether a purity response has hardened into identity-marking, scapegoating, or disproportionate harm — and forces it back within bounds.
- Symbolic Reintegration Ritual — Publicly and ceremonially re-accepts a restored person or object so no residual informal exclusion survives the cleansing.
- Tainted Data Quarantine — Isolates data of compromised provenance — and everything derived from it — from the trusted corpus until it is cleansed, rejected, or relabeled.
- Validated Clean-Down Protocol — Restores equipment, space, or material to verified-clean status through a specified procedure tested against an acceptance limit and signed off.
- Selectivity-Window Calibration: Tune the operating band of a selector so it keeps distinguishing the intended target from near-targets and non-targets instead of becoming too weak, too broad, or reversed.▸ Mechanisms (7)
- Bycatch Audit — Examines non-target capture or collateral burden that ordinary success metrics ignore.
- Challenge-Panel Cross-Reactivity Test — Tests the selector against near-neighbor, decoy, or vulnerable non-target cases to reveal where discrimination collapses.
- Operating Band Specification — Translates the discovered window into a formal allowable range, setpoint, tiered table, or escalation rule.
- ROC or Precision–Recall Surface Review — For classification and screening contexts, evaluates the tradeoff surface created by threshold or strictness changes.
- Selective Admission Band Protocol — Uses an allowable strictness band to admit targets while minimizing qualified exclusions and non-target admissions.
- Selectivity Curve Sweep — Runs the selector across a planned range of the control parameter and plots target yield against non-target capture.
- Window Drift Control Chart — Tracks whether the previously valid selectivity band is drifting, narrowing, widening, or moving into a reversal regime.
- Self-Targeting Defense Guardrail: Keep defensive power from turning on legitimate self by separating identity judgment from damaging response, staging the response through reversible checks, and preserving a self-protection invariant.▸ Mechanisms (10)
- Appeal and Rapid Restoration Workflow — Gives a wrongly-engaged legitimate party a fast, independent path to contest the action and have the harm reversed before it hardens into permanent loss.
- Engagement Kill Switch — A single, always-reachable control that halts an in-progress defensive response the moment it is caught engaging protected self, before the damage spreads further.
- False-Positive Harm Budget Dashboard — Meters the running cost of wrongful self-engagements against a pre-set allowance, weighting each by harm intensity, so the defense's autoimmune damage is priced and capped.
- Graduated Response Matrix — A lookup table that maps classifier confidence and self-status ambiguity against response harm, so uncertain judgments are routed to weaker, more reversible actions.
- Post-Incident Autoimmune Review — Treats each confirmed false self-engagement as a coupled classifier-actuator design failure and feeds it back into thresholds, self-boundaries, and permissions.
- Protected-Self Allowlist with Expiry — A maintained registry of known-legitimate self entities that shields them from defensive harm, with mandatory expiry so stale entries cannot outlive their trust.
- Quarantine-Before-Destroy Rule — A hard rule that any destructive defensive action must first pass through a reversible holding step, so a false positive is recoverable instead of permanent.
- Self-Status Cross-Check — Before acting on a threat flag, independently corroborates whether the target is really protected self using signals disjoint from the classifier that raised the alarm.
- Shadow Mode and Canary Enforcement — Runs a new or changed defense in observe-only shadow, then on a small canary slice, measuring would-be self-engagements before it is trusted to act at full scale.
- Two-Key High-Harm Engagement — Requires two independent authorities to concur before an irreversible defensive action fires, so no single classifier or operator can unilaterally harm protected self.
- Use-Time Source Attribution Calibration: Before using a commingled memory, note, claim, trace, or generated output, classify where it came from and how certain that attribution is.▸ Mechanisms (12)
- Borrowed Idea Attribution Scan — Sweeps a shared store of notes and ideas for material that arrived from someone else but now feels self-generated, and routes each item back to the source that deserves the credit.
- Chain-of-Custody or Lineage Check — Reconstructs an item's unbroken trail back to its origin — every handoff and transformation logged beside the content — so its source class is established rather than assumed when it is used.
- Generated Content Disclosure Gate — Holds internally- or model-generated content at the point of release until it carries a label saying it was generated and is phrased so a downstream reader can weight it as such.
- Hallucination Intrusion Triage — Takes items already flagged as possible fabrications or memory intrusions and sorts them by how much rides on them, quarantining, escalating, or releasing each before it is trusted.
- Memory Source Probe — Interrogates one recalled item at the moment of recall for its source cues, then applies a rule to classify where it actually came from.
- Observation Recheck or Replication — Converts a decayed or doubtful memory back into first-hand evidence by going and observing the thing again, instead of trusting the stored trace.
- Provenance Lookup Before Publication — A last-gate check that, claim by claim, traces a draft back to where each piece actually came from and credits anything borrowed before it goes public.
- Reality Monitoring Checklist — A short cue-by-cue checklist run at the moment of recall to decide whether an item was actually perceived from the world or generated inside your own head.
- Source Attribution Confidence Rubric — A graded scale that scores how sure you are of an item's source — separately from whether the content is true — and trips a corroboration gate when the grade is low and the stakes are high.
- Source Attribution Training Set — A curated corpus of real items whose true source class is already known, held as the gold reference that calibrates and teaches an attribution judgment — human or model.
- Source Confusion Matrix Review — A retrospective review that tabulates which source classes get mistaken for which — reading the off-diagonal cells to find systematic, directional misattributions and feed the fixes back.
- Source-Label Preserving Summary Template — A summary format that forces each condensed statement to carry its source class through compression, so shortening a document can't quietly flatten observed, reported, and generated content into equally-confident prose.
Also a related prime in 54 archetypes
- Accountable Gatekeeping Design: Design choke-point selection so passage decisions use explicit criteria, bounded discretion, traceable reasons, review paths, and distribution audits rather than opaque gatekeeper preference.
- Adversarial Learning-Rate Rebalancing: Keep a slow rule system from being outlearned by shared adversary communities by shrinking defender update latency, absorbing technique-corpus signals safely, and making copied bypasses less reusable.
- Artificial Diversity Introduction During Homogenization Pressure: When a system is being driven toward sameness, deliberately seed, protect, or recover distinct options so adaptive capacity, resilience, and representational breadth do not collapse.
- Aspect-Scoped Identity Projection: Represent one underlying entity under a defined aspect or role as a linked derived bearer, so properties, rights, obligations, identifiers, and lifecycle rules attach only where they belong.
- Associative Transfer Warrant Audit: Do not let contact, co-membership, resemblance, endorsement, or proximity carry trust, blame, risk, quality, or credibility unless the link has a valid transfer warrant.
- Bycatch-Aware Selective Intervention Design: When a selector catches more than its intended target, count the non-target capture, redesign the selector, and make success depend on bycatch reduction as well as target yield.
- Cascaded Hierarchical Recognition: Recognize complex cases by moving attention through a hierarchy of coarse filters and fine discriminators instead of trying to inspect every possible feature at once.
- Claim Quantifier Scope Calibration: State exactly what domain a claim ranges over and what burden its quantifier creates.
- Complement Space Mapping: Declare the universe, define the focal subset, and treat everything outside it as an explicit complement instead of an unexamined leftover.
- Context-Preserved Meaning Capture: Record what happened together with the contextual cues, meanings, roles, and observer notes that make the event interpretable later.
Notes¶
Classification appears simple (assign items to categories) but is laden with subtle choices. The criteria for membership are not always obvious, especially when the underlying space is continuous. The boundaries between categories are sometimes sharp (a ball either is or is not in the hoop) and sometimes fuzzy (a person either is or is not introverted). The purposes the classification serves may change (a disease classification system designed for billing works differently than one designed for research), shifting which categories are most useful.
The distinction between natural kinds and nominal kinds (from philosophy of language) is important. A natural kind is a grouping that reflects deep structure in the world (water, species, fundamental particles). A nominal kind is a grouping defined by convention (United States citizenship, the genre "romance novel"). Most practical classifications mix the two: medical diagnoses are nominated (consensus choices) but are grounded in natural structure (disorder of the nervous system, infectious agent). This mixed nature allows flexibility but can create confusion.
The social constructionist critique of classification (championed by scholars like Bowker and Star) notes that classification systems are never neutral. They embed the values, constraints, and assumptions of their creators. Medical classification embeds assumptions about the body, causation, and what counts as disease. Criminal classification embeds assumptions about harm, intent, and punishment. Being aware that all classification systems are situated—designed by particular people with particular purposes—is a foundation for critical thinking about them.
Classification is closely related to but distinct from conceptualization and standardization. Conceptualization is naming a concept (what is depression?); classification uses concepts to organize entities (which patients have depression?). Standardization is agreeing on common definitions and rules; classification implements standards in practice. These are related but separate functions.
References¶
[1] Bowker, G. C., & Star, S. L. (1999). Sorting Things Out: Classification and Its Consequences. MIT Press. Develops the constructivist view that classification systems (disease/ICD, race under apartheid, nursing interventions) are designed boundary structures whose invisibility hides the moral and political work they perform. Supports the framing of classification as deliberate rule-based assignment with consequences (091). registry ↩
[2] Murphy, G. L. (2002). The Big Book of Concepts. MIT Press. Comprehensive synthesis of categorization research distinguishing the act of classifying (assigning instances to categories) from static set membership and from concept representation. Supports the act-vs-property distinction (092). registry ↩
[3] Sokal, R. R., & Sneath, P. H. A. (1963). Principles of Numerical Taxonomy. W. H. Freeman. Foundational treatment establishing classification as a general, quantitative methodology that reduces variation to manageable categories preserving relevant distinctions, applicable across biology, medicine, and beyond. Supports the reduce-infinite-variation-to-finite-categories claim (093). registry ↩
[4] Smith, E. E., & Medin, D. L. (1981). Categories and Concepts. Harvard University Press. Canonical synthesis of theoretical and empirical work on category structure (classical, probabilistic, exemplar views): entities are matched to criteria, assigned by rule, and yield category structures used for downstream reasoning. Supports the entities-criteria-assignment-structure signature (094). registry ↩
[5] Hastie, T., Tibshirani, R., & Friedman, J. (2009). The Elements of Statistical Learning: Data Mining, Inference, and Prediction (2nd ed.). Springer. Canonical treatment of supervised classification: learns explicit decision rules from labeled data, replacing ad-hoc judgment with reproducible, transferable classifiers. Supports the claim that classification turns ad-hoc judgment into reproducible rules (095). registry ↩
[6] Bruner, J. S., Goodnow, J. J., & Austin, G. A. (1956). A Study of Thinking. Wiley. Foundational experimental study of concept attainment: distinguishes rule-governed classification (explicit, learnable criteria, justifiable assignment) from informal grouping. Supports the criteria-and-justification requirement (096). registry ↩
[7] Quine, W. V. O. (1969). "Natural kinds." In Ontological Relativity and Other Essays (pp. 114-138). Columbia University Press. Philosophical analysis arguing that the kinds employed in mature classification are tools refined for inductive and practical use, not given revelations of pre-existing natural order. Supports the not-a-discovery-of-natural-kinds claim (097). registry ↩
[8] Cover, T. M., & Hart, P. E. (1967). "Nearest Neighbor Pattern Classification." IEEE Transactions on Information Theory, 13(1), 21-27. Foundational result in machine-learning classification: establishes the asymptotic error bound of the nearest-neighbor decision rule, anchoring large-scale automated category assignment. Supports the supervised-classification example (098). registry ↩
[9] Hart, H. L. A. (1961). The Concept of Law. Oxford University Press. Analytical-jurisprudence treatment of legal systems as a union of primary rules of conduct and secondary rules of recognition, change, and adjudication; this rule structure underlies the classificatory categories (offense classes, procedural status) that constitute a legal system. Supports the legal-classification claim (099). registry ↩
[10] Hacking, I. (1999). The Social Construction of What?. Harvard University Press. Philosophical analysis of classification as an active, ongoing, human-designed practice; develops "looping kinds" / interactive kinds in which categorized people respond to and reshape the categories themselves. Supports the human-decisions / same-entity-classified-differently claim (100). registry ↩
[11] Ranganathan, S. R. (1933). Colon Classification. Madras Library Association. First faceted (analytico-synthetic) library classification (PMEST): enables consistent rules and scalable assignment across millions of items by combining facets of personality, matter, energy, space, and time. Supports the scaling/consistent-rules complexity-management claim (101). registry ↩
[12] Zadeh, L. A. (1965). "Fuzzy Sets." Information and Control, 8(3), 338-353. Introduces graded membership as a generalization of crisp set membership, addressing the mismatch between sharp classification boundaries and continuous underlying variation. Supports the sharp-boundaries-flatten-continuous-variation claim (104). registry ↩
[13] Rosch, E. (1978). "Principles of categorization." In E. Rosch & B. B. Lloyd (Eds.), Cognition and Categorization (pp. 27-48). Lawrence Erlbaum. Foundational statement that categorization is governed by cognitive economy and perceived-world structure, sharpening reasoning about boundaries, membership, and purpose. Supports the central-questions-of-categorization claim (102). registry ↩
[14] Hennig, W. (1966). Phylogenetic Systematics (D. D. Davis & R. Zangerl, Trans.). University of Illinois Press. Founding treatment of cladistics: a transferable method of classification by explicit criteria (shared derived characters / synapomorphies) and consistent rules of assignment, since adapted across biology, linguistics, and beyond. Supports the define-criteria/apply-rules transfer claim (103). registry ↩
[15] Foucault, M. (1970). The Order of Things: An Archaeology of the Human Sciences. Pantheon. Argues that classification systems in the human sciences are situated within historical epistemes, embedding values and constraints that travel with the system as it is exported across domains. Supports the never-fully-neutral / embedded-commitments transfer claim (105). registry ↩