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.
Seen in practice: Fine distinctions in tension with usable categories
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 (212) — abstractions linked here by typed relations
-
Acid Salt Domain-specific is a kind of 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. Frozen
domain_specific:solubilityis false coverage because dissolution does not entail composition. -
Acute and obtuse triangles Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
-
Aleph number Domain-specific is a kind of Classification
The candidate literally instantiates prime:classification; its set_theory restrictions provide the domain-specific residual.What makes it its own entry: A member of the transfinite sequence of well-ordered infinite cardinalities, indexed by ordinals with aleph-null as the size of the natural numbers.
- Arf ring Domain-specific is a kind of Classification
What makes it its own entry: A one-dimensional semilocal Cohen–Macaulay ring satisfying the Arf closure condition that controls integrally closed ideals and multiplicity sequences.What makes it its own entry: A one-dimensional semilocal Cohen–Macaulay ring satisfying the Arf closure condition that controls integrally closed ideals and multiplicity sequences.
- Arithmetic number Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- Baer group Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Bayes classifier Domain-specific is a kind of Classification
It classifies cases by posterior-risk optimization.What makes it its own entry: population-optimal classification benchmark under known probability and cost structure.
- Beck's monadicity theorem Domain-specific is a kind of Classification
What makes it its own entry: A categorical criterion determining when a functor is equivalent to the forgetful functor from algebras for the monad induced by its adjunction.What makes it its own entry: A categorical criterion determining when a functor is equivalent to the forgetful functor from algebras for the monad induced by its adjunction.
- Bernstein–Zelevinsky classification Domain-specific is a kind of Classification
Bernstein–Zelevinsky classification is a strict kind of Classification: its frozen identity entails the parent's defining structure while adding domain-specific restrictions.Every reviewed Bernstein–Zelevinsky classification instance satisfies Classification because the child identity—In mathematics, the Bernstein–Zelevinsky classification, introduced by and, classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations—entails the parent identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action. Classification can occur without the domain, mechanism, population, or boundary conditions that distinguish Bernstein–Zelevinsky classification.
- Biclique-free graph Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- Bidimensionality Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- Binary classification Domain-specific is a kind of Classification
The task literally sorts instances into discrete categories by a rule and is the two-label specialization of the accepted Classification Prime.What makes it its own entry: 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.
- Biodiversity Hotspot Domain-specific is a kind of Classification
The designation assigns biogeographic regions to a class by two explicit conjunctive criteria.The Myers and Conservation International biodiversity-hotspot designation evaluates an already delimited terrestrial biogeographic region against endemic-vascular-plant and original-primary-vegetation-loss thresholds, then assigns hotspot or non-hotspot status. This instantiates the rule-based entity-to-category operation of Classification. The carrier and two required conservation criteria are the child differentia. Classification exists without these biological conditions, while funding, ranking and ecological risk interaction are not required to make the assignment.
- Black Hole No-Hair Theorem Domain-specific is a kind of Classification
**`prime:classification`** is the broader abstraction this entry instantiates: 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
What makes it its own entry: A social-network analysis framework that partitions actors into position classes whose tie patterns form an interpretable reduced block structure.What makes it its own entry: A social-network analysis framework that partitions actors into position classes whose tie patterns form an interpretable reduced block structure.
- Bochner's theorem (orthogonal polynomials) Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- 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.
- Branching identification key Domain-specific is a kind of Classification
What makes it its own entry: A graphically displayed single-access taxonomic key whose decision alternatives branch from diagnostic character choices to candidate identifications.What makes it its own entry: A graphically displayed single-access taxonomic key whose decision alternatives branch from diagnostic character choices to candidate identifications.
- C space Domain-specific is a kind of Classification
The construction classifies sequences by convergence and equips them with uniform norm structure.What makes it its own entry: normed sequence space distinguished by existence of an ordinary coordinate limit.
- Cancer Staging Domain-specific is a kind of Classification
Cancer staging sorts scheme-eligible cancer-related cases into qualified extent categories or stage groups by explicit evidence and assignment rules.Cancer staging instantiates Classification's entities, criteria, assignment rule, category structure, and downstream reasoning or action. The entities are scheme-eligible cancer-related cases; timed observations of extent and scheme-authorized factors supply criteria; site- and edition-specific rules map them to qualified categories or groups; those outputs support communication and clinical comparison. Cancer-specific extent and assessment scope are the strict differentia. Without the rule-guided assignment it would be a finding or informal impression rather than Classification; without the cancer-specific differentia it would not be Cancer Staging.
- Categorical perception Domain-specific is a kind of Classification
What makes it its own entry: A perceptual phenomenon in which continuous stimulus variation is experienced or discriminated as discrete categories, with enhanced sensitivity near category boundaries.What makes it its own entry: A perceptual phenomenon in which continuous stimulus variation is experienced or discriminated as discrete categories, with enhanced sensitivity near category boundaries.
- Category of compactly generated weak Hausdorff spaces Domain-specific is a kind of Classification
What makes it its own entry: the domain-specific identity determined by objects satisfy compact generation and weak Hausdorffness and categorical limits, colimits, and exponentials use the declared CGWH constructions.What makes it its own entry: the domain-specific identity determined by objects satisfy compact generation and weak Hausdorffness and categorical limits, colimits, and exponentials use the declared CGWH constructions.
- Chomsky hierarchy Domain-specific is a kind of Classification
The hierarchy classifies grammars and languages by restriction.What makes it its own entry: four-level correspondence between grammatical restriction and computational expressiveness.
- Circular algebraic curve Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Circumplex model of group tasks Domain-specific is a kind of Classification
The input case is a goal-directed collective task; the feature frame is its required product, dominant performance process, conceptual–behavioral demand, and form of member interdependence; the decision rule assigns the case to one of eight task types within four quadrants; and the output is a reusable circumplex placement.Mixed episodes and changing goals supply uncertainty and reclassification boundaries rather than exceptions to the operation. Remove the explicit case-to-category assignment and only a diagram or task description remains; replace McGrath's group-task categories with another finite rule-governed scheme and the named model collapses while Classification persists.
- Classical group Domain-specific is a kind of Classification
The name classifies recurring matrix-group families by preserved linear structures.What makes it its own entry: uniform matrix-group families realizing the classical Dynkin types and their linear analogues.
- 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 the broader abstraction 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
What makes it its own entry: The dynamical classification of periodic stable regions of rational maps into attracting, parabolic, Siegel, Herman and related component types.What makes it its own entry: The dynamical classification of periodic stable regions of rational maps into attracting, parabolic, Siegel, Herman and related component types.
- Classification theorem Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed 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.It remains its own entry because its identity is fixed 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.
- Clinical Grading System Domain-specific is a kind of Classification
A Clinical Grading System is a Classification specialized to clinical findings and ordered condition categories.A Clinical Grading System is a Classification specialized to clinical findings and ordered condition categories.
- Cohen ring Domain-specific is a kind of Classification
The candidate literally instantiates prime:classification; What makes it its own entry: 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.The candidate literally instantiates prime:classification; What makes it its own entry: 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.
- Colors of noise Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- 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 candidate literally instantiates prime:classification.What makes it its own entry: A family of Boolean-valued concepts or classifiers over a common instance domain, serving as the hypothesis universe in computational learning theory.
- Conjugacy class Domain-specific is a kind of Classification
Conjugacy partitions and classifies group elements by inner symmetry.What makes it its own entry: inner-automorphism orbit partition of group elements.
- Consideration and initiating structure Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Contrast set Domain-specific is a kind of Classification
The set classifies mutually substitutable alternatives within a schema.What makes it its own entry: slot-defined semantic inventory whose internal alternatives structure cultural knowledge.
- 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
What makes it its own entry: An analyst's arbitrary hidden feature is not a cryptotype without independent linguistic diagnostics, and covert does not mean unconscious in a psychological sense.What makes it its own entry: An analyst's arbitrary hidden feature is not a cryptotype without independent linguistic diagnostics, and covert does not mean unconscious in a psychological sense.
- Cunningham number Domain-specific is a kind of Classification
The identity classifies integers through one normalized exponential form.What makes it its own entry: normalized near-power integers and their factorization structure across bases, exponents, and signs.
- Cyclic number (group theory) Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- Cyclotomic polynomial Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Cytotaxonomy Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed by the organisms and sampling, chromosome preparation evidence, number and ploidy, morphology and rearrangements, meiotic behavior, character homology, variation, comparison method and taxonomic inference.It remains its own entry because its identity is fixed by the organisms and sampling, chromosome preparation evidence, number and ploidy, morphology and rearrangements, meiotic behavior, character homology, variation, comparison method and taxonomic inference.
- Data Type Domain-specific is a kind of Classification
A Data Type is a Classification of computational values with operational and semantic constraints.A Data Type is a Classification of computational values with operational and semantic constraints.
- Demerit good Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed by the claimed consumer harm, information or behavioral failure, welfare standard, affected population, and distinction from third-party externalities.It remains its own entry because its identity is fixed by the claimed consumer harm, information or behavioral failure, welfare standard, affected population, and distinction from third-party externalities.
- Design predicates Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- 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.the pair assigns musical events to collection-internal and collection-external categories under an explicit rule.
- DNA Barcoding Domain-specific is a kind of Classification
DNA barcoding is a rule-based taxonomic classification method using a declared short DNA marker and identified reference sequences.Live Classification assigns entities to categories by explicit criteria and expressly includes biological taxonomy and DNA-sequence evidence. DNA barcoding applies that operation to an organism query, standardized short marker, attributed reference library and uncertainty-qualified species or higher-rank result; its added biological constraints make it a strict subtype rather than an alias.
- Dominant Factor Test Domain-specific is a kind of Classification
Dominant Factor Test is a strict kind of Classification: it classifies games by whether skill or chance predominates causally in outcomes.Every reviewed Dominant Factor Test instance satisfies Classification because it classifies games by whether skill or chance predominates causally in outcomes. The child adds the domain-specific restrictions stated in its frozen identity. Classification is broader and can occur without the restrictions that define Dominant Factor Test.
- Door space Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Du Bois singularity Domain-specific is a kind of Classification
Du Bois singularity is literally a rule-defined category of schemes.What makes it its own entry: 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.
- Dually chordal graph Domain-specific is a kind of Classification
What makes it its own entry: the domain-specific identity determined by the graph satisfies one of the equivalent maximum-neighborhood, compatible-tree, or clique-hypertree characterizations.What makes it its own entry: the domain-specific identity determined by the graph satisfies one of the equivalent maximum-neighborhood, compatible-tree, or clique-hypertree characterizations.
- Ecological Classification Domain-specific is a kind of Classification
Ecological Classification is a strict kind of Classification: Ecological classification or ecological typology is the classification of land or water into geographical units that represent variation in one or more ecological features.The parent supplies the necessary broader identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.—while the candidate adds its domain carrier, relation, and rejection conditions.
- Eightfold way (physics) Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- En (Lie algebra) Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- End (graph theory) Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- English unjust enrichment law Domain-specific is a kind of 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.What makes it its own entry: 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.
- Enriques–Kodaira classification Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- Ergative–absolutive alignment Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Euclidean domain Domain-specific is a kind of Classification
What makes it its own entry: An integral domain equipped with a Euclidean function that supports division with remainder of strictly smaller value and therefore the Euclidean algorithm.What makes it its own entry: An integral domain equipped with a Euclidean function that supports division with remainder of strictly smaller value and therefore the Euclidean algorithm.
- Euclidean ordered field Domain-specific is a kind of Classification
What makes it its own entry: An ordered field in which every nonnegative element has a square root within the field.What makes it its own entry: An ordered field in which every nonnegative element has a square root within the field.
- Evolutionary Taxonomy Domain-specific is a kind of Classification
Evolutionary Taxonomy is a strict kind of Classification: A biological classification approach that combines phylogenetic relationship with degree of evolutionary divergence and may recognize paraphyletic groups when they represent a distinct evolutionary grade.Evolutionary taxonomy is a biological classification rule-set whose taxa are delimited by combined descent and divergence criteria.
- Exact coloring Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Faceted Classification Domain-specific is a kind of Classification
Faceted Classification is a strict kind of Classification: its frozen identity entails the parent's defining structure while adding domain-specific restrictions.Every reviewed Faceted Classification instance satisfies Classification because the child identity—A faceted classification is a classification scheme used in organizing knowledge into a systematic order—entails the parent identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action. Classification can occur without the domain, mechanism, population, or boundary conditions that distinguish Faceted Classification.
- Friendly number Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Frobenius–Schur indicator Domain-specific is a kind of Classification
What makes it its own entry: the domain-specific identity determined by the representation class and normalization are stated and the indicator corresponds to the declared invariant-form type.What makes it its own entry: the domain-specific identity determined by the representation class and normalization are stated and the indicator corresponds to the declared invariant-form type.
- Functional group (ecology) Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed 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.It remains its own entry because its identity is fixed 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.
- Generic property Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- 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.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.
- Grammatical gender Domain-specific is a kind of Classification
Grammatical gender is a strict kind of Classification: In linguistics, a grammatical gender system is a specific form of a noun class system, where nouns are assigned to gender categories that are often not related to the real-world qualities of the entities denoted by those nouns.The parent supplies the necessary broader identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.—while the candidate adds its domain carrier, relation, and rejection conditions.
- Grothendieck category Domain-specific is a kind of Classification
What makes it its own entry: the domain-specific identity determined by the category is abelian, has all small coproducts, filtered colimits are exact, and a generator exists.What makes it its own entry: the domain-specific identity determined by the category is abelian, has all small coproducts, filtered colimits are exact, and a generator exists.
- Hadamard manifold Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- Highly composite number Domain-specific is a kind of Classification
What makes it its own entry: the domain-specific identity determined by n is positive and its divisor count is a strict all-prior record under the stated convention.What makes it its own entry: the domain-specific identity determined by n is positive and its divisor count is a strict all-prior record under the stated convention.
- Homeostatic property cluster theory Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed 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.It remains its own entry because its identity is fixed 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.
- 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.
- Hume's Fork Domain-specific is a kind of Classification
Hume's Fork is Classification of propositions into relations of ideas and matters of fact.It sorts claims by explicit epistemic and modal criteria into two reusable categories, satisfying Classification. Classifications can divide any entities and need not use Hume's distinction.
- Hyperboloid Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed 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.It remains its own entry because its identity is fixed 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.
- Hypernymy and hyponymy Domain-specific is a kind of Classification
What makes it its own entry: Polysemy makes the relation sense-specific, and taxonomic levels can differ without changing the inverse relation.What makes it its own entry: Polysemy makes the relation sense-specific, and taxonomic levels can differ without changing the inverse relation.
- Hyponormal operator Domain-specific is a kind of Classification
What makes it its own entry: the domain-specific identity determined by the operator is bounded on a complex Hilbert space and its declared self-commutator is positive semidefinite.What makes it its own entry: the domain-specific identity determined by the operator is bounded on a complex Hilbert space and its declared self-commutator is positive semidefinite.
- Inelative Case Domain-specific is a kind of Classification
The inelative case is one classificatory value within a language's case system, sorting nominal forms by grammatical/semantic function.Classification sorts entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning. A case system does exactly this for nominal forms, and the inelative case is one such category: it marks nominals expressing movement from inside a bounded source, distinguished by explicit morphological rules from other locative cases (elative, inessive, etc.). The differentia is the specific source-from-inside semantic function the inelative case encodes. Because this mirrors the same reasoning already used to justify prime:classification as the parent for the sibling locative_case, the qualifier is strict.
- Injury (law) Domain-specific is a kind of 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.What makes it its own entry: 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.
- Integral graph Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Killip class Domain-specific is a kind of Classification
Killip class is a strict kind of Classification: its frozen identity entails the parent's defining structure while adding domain-specific restrictions.Every reviewed Killip class instance satisfies Classification because the child identity—A four-class bedside stratification of acute myocardial infarction by clinical severity of heart failure, from no failure signs through pulmonary edema to cardiogenic shock, historically associated with mortality risk—entails the parent identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action. Classification can occur without the domain, mechanism, population, or boundary conditions that distinguish Killip class.
- Knödel number Domain-specific is a kind of Classification
The congruence classifies composite integers by a universal modular property.What makes it its own entry: parameterized universal pseudoprime condition extending Carmichael numbers.
- KR-theory Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Linguistic profiling Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Locality-sensitive hashing Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Logistic model tree Domain-specific is a kind of Classification
A logistic model tree literally maps observations into discrete classes through learned probability and decision rules; What makes it its own entry: 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 logistic model tree literally maps observations into discrete classes through learned probability and decision rules; What makes it its own entry: 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.
- M-matrix Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Mater semper certa est Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Maximal set (computability theory) Domain-specific is a kind of Classification
What makes it its own entry: 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
- Memory confusion protocol Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- Metzler matrix Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed by the real square matrix and dimension, off-diagonal inequality, diagonal convention, shifted nonnegative matrix relation, exponential positivity and any irreducibility or stability assumptions.It remains its own entry because its identity is fixed by the real square matrix and dimension, off-diagonal inequality, diagonal convention, shifted nonnegative matrix relation, exponential positivity and any irreducibility or stability assumptions.
- Morava K-theory Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- 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. Invasive-Species Release is an ecological mechanism involving escape from coevolved enemies after introduction; it is a neighbor, not a parent.
- Nonhypotenuse number Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- NSPACE Domain-specific is a kind of Classification
NSPACE classifies problems by a nondeterministic space resource bound.What makes it its own entry: nondeterministic space-bounded computation and its configuration-reachability characterization.
- Numerical taxonomy Domain-specific is a kind of Classification
Numerical taxonomy is a strict kind of Classification: Numerical taxonomy is a classification system in biological systematics which deals with the grouping by numerical methods of taxonomic units based on their character states.The parent supplies the necessary broader identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.—while the candidate adds its domain carrier, relation, and rejection conditions.
- Octoechos Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed 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.It remains its own entry because its identity is fixed 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.
- Odious number Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed by the nonnegative-integer domain, canonical binary representation without leading zeros, one-bit count and odd-parity condition.It remains its own entry because its identity is fixed by the nonnegative-integer domain, canonical binary representation without leading zeros, one-bit count and odd-parity condition.
- Omega and agemo subgroup Domain-specific is a kind of Classification
The candidate literally instantiates prime:classification.What makes it its own entry: 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.
- Perfect digit-to-digit invariant Domain-specific is a kind of Classification
Perfect digit-to-digit invariant is a domain-specific kind of Classification: A perfect digit-to-digit invariant is a positive integer equal to the sum obtained by raising each of its decimal digits to the power of that same digit.The parent supplies the necessary broader identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.—while the candidate adds the source-domain carrier, recognition rule, and failure conditions. The defining source account begins: A perfect digit-to-digit invariant in base $b$ is a natural number that is fixed by the map sending each digit to that digit raised to its own power and summing the results.
- Perfect ring Domain-specific is a kind of Classification
What makes it its own entry: A ring for which every module on the specified side has a projective cover, with equivalent chain and radical conditions under Bass's theorem.What makes it its own entry: A ring for which every module on the specified side has a projective cover, with equivalent chain and radical conditions under Bass's theorem.
- Phenetics Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Pluripolar set Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Political spectrum Domain-specific is a kind of Classification
The spectrum classifies positions through comparative coordinates.What makes it its own entry: geometric comparative representation of ideological position and its compression tradeoffs.
- PolyL Domain-specific is a kind of Classification
PolyL classifies decision problems by a deterministic polylogarithmic space bound.What makes it its own entry: deterministic polylog-space resource class between logarithmic and broader sublinear regimes.
- Polynomial hierarchy Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed 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.It remains its own entry because its identity is fixed 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.
- Positive form Domain-specific is a kind of Classification
What makes it its own entry: the domain-specific identity determined by the manifold, bidegree, reality convention, and exact weak, strong, or positive evaluation inequality are declared and satisfied pointwise.What makes it its own entry: the domain-specific identity determined by the manifold, bidegree, reality convention, and exact weak, strong, or positive evaluation inequality are declared and satisfied pointwise.
- Prime signature Domain-specific is a kind of Classification
Prime signature literally sorts positive integers into discrete equivalence classes by an explicit exponent-multiset rule.What makes it its own entry: 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.
- Prime triplet Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed by the integer domain, ordering and set convention, span-six condition, two admissible forms, exceptional triples, primality evidence and any counting or infinitude claim.It remains its own entry because its identity is fixed by the integer domain, ordering and set convention, span-six condition, two admissible forms, exceptional triples, primality evidence and any counting or infinitude claim.
- Principle of typicality Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- Probable prime Domain-specific is a kind of Classification
Probable prime is a domain-specific kind of Classification: Probable prime denotes number that satisfies a given necessary condition for primality within computational number theory.The parent supplies the necessary broader identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.—while the candidate adds the source-domain carrier, recognition rule, and failure conditions. The defining source account begins: A probable prime is an integer that passes a specified primality test whose condition is necessary for prime numbers but not sufficient to exclude every composite.
- Progressive function Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Pseudo-canonical variety Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- Pseudoprotease Domain-specific is a kind of Classification
The identity classifies an enzyme-family homolog by retained structure and lost catalytic function.What makes it its own entry: catalytically inactive protease fold repurposed for noncatalytic biological function.
- Quadratic residuosity problem Domain-specific is a kind of Classification
The problem classifies promised residues versus nonresidues under computational limits.What makes it its own entry: factoring-linked hard decision between residues and pseudoresidue-looking nonresidues.
- Qualitative comparative analysis Domain-specific is a kind of Classification
QCA classifies cases into condition and outcome sets and reduces configurations.What makes it its own entry: configurational, conjunctural and equifinal comparison between case studies and variable-centered statistics.
- Quantum number Domain-specific is a kind of Classification
Quantum numbers classify state sectors under observables and symmetries.What makes it its own entry: state labels derived from quantization and symmetry rather than arbitrary enumeration.
- Quasi-bipartite graph Domain-specific is a kind of Classification
What makes it its own entry: the domain-specific identity determined by the undirected graph and terminal subset are explicit and no edge has two nonterminal endpoints.What makes it its own entry: the domain-specific identity determined by the undirected graph and terminal subset are explicit and no edge has two nonterminal endpoints.
- Quasivariety Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed 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.It remains its own entry because its identity is fixed 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.
- Radical of a ring Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- 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
What makes it its own entry: A complete residue system includes nonunits and has n members, while a reduced system contains only the φ(n) unit classes.What makes it its own entry: A complete residue system includes nonunits and has n members, while a reduced system contains only the φ(n) unit classes.
- Register (sociolinguistics) Domain-specific is a kind of Classification
Register classifies patterned language varieties by recurrent use situation.What makes it its own entry: situationally organized language variety linking linguistic form to communicative use.
- Regular scheme Domain-specific is a kind of Classification
What makes it its own entry: A locally Noetherian scheme whose every local ring is regular, so local dimension equals the minimal number of generators of its maximal ideal.What makes it its own entry: A locally Noetherian scheme whose every local ring is regular, so local dimension equals the minimal number of generators of its maximal ideal.
- Relationship extraction Domain-specific is a kind of Classification
The task classifies relations between extracted arguments.What makes it its own entry: argument-linked semantic assertion extraction beyond entity recognition.
- Remember/Know Judgments in Recognition Tests Domain-specific is a kind of Classification
Every Remember/Know judgment in a recognition test classifies an affirmative oldness report under instructed R/K criteria.The entities classified are participants’ affirmative oldness reports, including mistaken endorsements of lures, not verified memory states. Experimenter instructions supply the R criterion of recovered study-episode detail and the K criterion of reported oldness without it; participants assign each eligible response to a discrete category. The rule is reusable across items and conditions, and investigators count the reports. Classification does not require a second observer to verify private experience or identify latent processes. The child adds the recognition-test setting and phenomenological distinction; Classification can occur without either.
- Restricted root system Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- 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
What makes it its own entry: 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.What makes it its own entry: 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.
- Sign (mathematics) Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed 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.It remains its own entry because its identity is fixed 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.
- Signed graph Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed by the graph and edge-sign function, loop and parallel-edge conventions, walk and cycle sign, balance definition and switching operation.It remains its own entry because its identity is fixed by the graph and edge-sign function, loop and parallel-edge conventions, walk and cycle sign, balance definition and switching operation.
- Signed set Domain-specific is a kind of Classification
The sign function classifies each element into one of two oriented classes.What makes it its own entry: elementwise binary orientation of a set and the interchangeable map-versus-disjoint-pair representations.
- SL (complexity) Domain-specific is a kind of Classification
SL classifies decision problems by a symmetric space-bounded model.What makes it its own entry: historical symmetric-reachability characterization of deterministic logspace.
- Smoothness (probability theory) Domain-specific is a kind of Classification
The candidate literally assigns probability laws to decay-regime categories by explicit Fourier-envelope rules; What makes it its own entry: 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.The candidate literally assigns probability laws to decay-regime categories by explicit Fourier-envelope rules; What makes it its own entry: 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.
- Snark (graph theory) Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Soft independent modelling of class analogies Domain-specific is a kind of Classification
Soft independent modelling of class analogies is a strict kind of Classification: Soft independent modelling by class analogy (SIMCA) is a statistical method for supervised classification of data.The parent supplies the necessary broader identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.—while the candidate adds its domain carrier, relation, and rejection conditions.
- Soil classification Domain-specific is a kind of Classification
Soil classification is a strict kind of Classification: Soil Classification is used in a variety of disciplines such as soil science, engineering, and environmental management, to elevate soil properties and determine the appropriate land use.The parent supplies the necessary broader identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.—while the candidate adds its domain carrier, relation, and rejection conditions.
- Spectrum (functional analysis) Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed 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.It remains its own entry because its identity is fixed 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.
- Square number Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed by the integer domain, inclusion of zero, witness integer or exact square root, exponentiation convention, sign and any modular or factorization criterion.It remains its own entry because its identity is fixed by the integer domain, inclusion of zero, witness integer or exact square root, exponentiation convention, sign and any modular or factorization criterion.
- Stellar Classification Domain-specific is a kind of Classification
Stellar Classification is a strict kind of Classification: Standardized classification of stars from spectral morphology, ordinarily combining a temperature-sensitive spectral type with a surface-gravity-sensitive luminosity class and relevant peculiarity qualifiers.Stellar classification is a strict domain-specific kind of classification: it sorts stars into reusable categories by explicit spectral-morphology rules and standards.
- STRIDE Model Domain-specific is a kind of Classification
**Classification** is the broader abstraction this entry instantiates.Attack Surface, Boundary, Adversarial Thinking, Defense in Depth, and Risk Assessment are related.
- Størmer number Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- Structural type system Domain-specific is a kind of Classification
The system classifies program values by structural properties.What makes it its own entry: compile-time property-based compatibility and subtyping independent of explicit name lineage.
- Stylometry Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Subfield of an algebra Domain-specific is a kind of Classification
The identity classifies subalgebras by the stronger field condition.What makes it its own entry: field extension realized internally inside a possibly noncommutative algebra.
- Sublime number Domain-specific is a kind of Classification
The property classifies integers by two divisor-function tests.What makes it its own entry: simultaneous perfectness of two divisor-function values.
- Subminor and supermajor Domain-specific is a kind of Classification
It remains its own entry because its identity is fixed 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.It remains its own entry because its identity is fixed 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.
- Sum-product number Domain-specific is a kind of Classification
Sum-product number is a domain-specific kind of Classification: Sum-product number denotes a number equal to the product of the sum and product of its digits within recreational number theory.The parent supplies the necessary broader identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.—while the candidate adds the source-domain carrier, recognition rule, and failure conditions. The defining source account begins: A sum-product number in base b is a natural number equal to the product of the sum of its base-b digits and the product of those digits.
- Superalgebra Domain-specific is a kind of Classification
What makes it its own entry: the domain-specific identity determined by the base, algebra laws, direct even–odd decomposition, homogeneous parity, and parity-preserving multiplication rule are explicitly satisfied.What makes it its own entry: the domain-specific identity determined by the base, algebra laws, direct even–odd decomposition, homogeneous parity, and parity-preserving multiplication rule are explicitly satisfied.
- T-structure Domain-specific is a kind of Classification
A t-structure classifies objects by categorical degree and truncation.What makes it its own entry: categorical degree structure recovering abelian objects inside derived settings.
- 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.THEMATICS instantiates Classification because it assigns structural residues and their clusters to candidate functional-site classes by a repeatable feature-and-decision rule.
- Thick concept Domain-specific is a kind of Classification
The concept literally classifies cases under application criteria; What makes it its own entry: the inseparable or systematically coupled descriptive–evaluative profile of one concept.The concept literally classifies cases under application criteria; What makes it its own entry: the inseparable or systematically coupled descriptive–evaluative profile of one concept.
- Three-dimensional space Domain-specific is a kind of Classification
The identity classifies spaces by intrinsic dimension.What makes it its own entry: three-coordinate geometric carrier underlying spatial modeling and three-manifold theory.
- TNM Classification of Malignant Tumours Domain-specific is a kind of Classification
The eligible malignancy is the entity to be sorted; the governing manual supplies explicit site-, histology-, evidence-, and edition-specific criteria; and the T, N, and M rules assign it to a qualified tuple of discrete categories.That tuple becomes a reusable map for comparison and may feed a separate governed stage-group mapping. Unknown and negative states, clinical and pathological evidence routes, and edition provenance show that TNM is rule-bound assignment rather than informal severity grouping. If those criteria and assignment rules were removed, T/N/M symbols would no longer support reproducible category membership or downstream staging, collapsing both TNM's identity and Classification's entities→criteria→assignment→category structure. The anatomical axes and oncology governance are TNM's domain-specific residual.
- Transect (urban) Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Transparency and translucency Domain-specific is a kind of Classification
The terms classify optical transmission by scattering and image preservation.What makes it its own entry: paired material-property distinction between clear and diffuse light transmission.
- Turing degree Domain-specific is a kind of Classification
What makes it its own entry: An equivalence class of sets or decision problems under mutual Turing reducibility, representing one level of relative computability.What makes it its own entry: An equivalence class of sets or decision problems under mutual Turing reducibility, representing one level of relative computability.
- 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 broader abstraction this entry instantiates; Allocation and Partition describe cell content rather than the whole grid's ancestry.
- Type theory Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Ugly duckling theorem Domain-specific is a kind of Classification
The candidate literally instantiates prime:classification; What makes it its own entry: 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.The candidate literally instantiates prime:classification; What makes it its own entry: 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.
- Unusual number Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- 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 broader abstraction this entry instantiates; Sacred identifies domain but does not supply the labeling operation.
- Variable-order Bayesian network Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Vegetation Classification Domain-specific is a kind of Classification
Vegetation Classification is a strict kind of Classification: Vegetation classification is the process of classifying and mapping the vegetation over an area of the Earth's surface.The parent supplies the necessary broader identity—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.—while the candidate adds its domain carrier, relation, and rejection conditions.
- Von Neumann–Bernays–Gödel set theory Domain-specific is a kind of Classification
What makes it its own entry: 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.What makes it its own entry: 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.
- Webbed space Domain-specific is a kind of Classification
What makes it its own entry: the domain-specific identity determined by there exists a family satisfying the declared web axioms and strand convergence condition for the space’s topology.What makes it its own entry: the domain-specific identity determined by there exists a family satisfying the declared web axioms and strand convergence condition for the space’s topology.
- Will Rogers phenomenon Domain-specific is a kind of Classification
It remains its own entry because its identity is 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.It remains its own entry because its identity is 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.
- Zygosity Domain-specific is a kind of Classification
Zygosity classifies allele-copy relationships under ploidy.What makes it its own entry: copy-relative genotype relationship rather than an allele's identity by itself.
- 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.
- Achilles Number Domain-specific presupposes Classification
Achilles Number presupposes Classification because membership is determined by a rule over prime exponents: all at least two with greatest common divisor one.Every reviewed Achilles Number instance depends on the parent role: membership is determined by a rule over prime exponents: all at least two with greatest common divisor one. Removing that role makes the frozen child identity undefined or changes it into a different abstraction. Classification can occur without Achilles Number, so the relation is dependency rather than subsumption.
- Capped Trigonal Prismatic Molecular Geometry Domain-specific presupposes Classification
Capped Trigonal Prismatic Molecular Geometry presupposes Classification because the geometry category depends on classifying seven-coordinate arrangements by an ideal capped trigonal prism.Every reviewed Capped Trigonal Prismatic Molecular Geometry instance depends on the parent role: the geometry category depends on classifying seven-coordinate arrangements by an ideal capped trigonal prism. Removing that role makes the frozen child identity undefined or changes it into a different abstraction. Classification can occur without Capped Trigonal Prismatic Molecular Geometry, so the relation is dependency rather than subsumption.
- Classifying space for SU(n) Domain-specific presupposes Classification
Classifying space for SU(n) structurally presupposes Classification rather than being a subtype of it.The candidate identity is: Classifying space for SU(n) is a recurring identity in mathematics, logic, and statistics defined by this frozen evidence: In mathematics, the classifying space \operatorname{BSU}(n) for the special unitary group \operatorname{SU}(n) is the base space of the universal \operatorname{SU}(n) principal bundle \operatorname{ESU}(n)\rightarrow\operatorname{BSU}(n). Its operation cannot be stated without the parent relation—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.—but it adds domain-specific carriers, constraints, and warrants. The defining source account begins: The classifying space BSU(n) is a topological space that universally represents principal bundles with structure group SU(n), the group of n-by-n unitary matrices of determinant one.
- Commuting-Defined Functional Region Domain-specific includes Classification
Rule-governed classification of geographic units by commuting evidence is an identity-bearing internal operation of functional-region delineation.The EU–OECD method evaluates surrounding local units against a declared city-directed commuting criterion and assigns them into or outside a commuting zone; even an empty zone classifies all tested units outside. The ONS method groups statistical zones into travel-to-work-area membership using residence and workplace self-containment. Both contain entities, criteria, an assignment rule, reusable region membership, and downstream analysis. Removing the classification removes the delineation; Classification can occur without commuting geography. This is an internal operation, not a genus of the whole regional method or a claim that borders regulate travel.
- 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 broader abstraction this entry instantiates.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 broader abstraction this entry instantiates: 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.
- Social Label Domain-specific presupposes Classification
A Social Label presupposes Classification because applying or adopting the designation places a bearer in a socially interpreted category.The label's designation, bearer, and context-dependent expectations require a rule that sorts the bearer into a category; without that sorting relation it is merely a name or sign. Classification can sort chemical species, documents, or measurements without any social label, identity feedback, or power-laden interpretation.
- Moduli Space Domain-specific presupposes Classification
A moduli space presupposes a classification problem that fixes the objects and the equivalence under which its points represent classes.The moduli space is not the process of classification: it is a geometric object built from a prior classification problem. Remove the rule specifying admissible objects and when two presentations are equivalent, and its points no longer have a defined meaning. Classification can exist without a geometric moduli space, so dependency rather than subsumption captures the relation.
- Morphosyntactic Alignment Domain-specific presupposes Classification
The analytic alignment diagnosis requires criterion-bound grouping of S, A and P grammatical positions.Without declaring the comparison channel and grouping argument positions by shared grammatical treatment, an accusative, ergative or neutral alignment diagnosis is undefined. Classification can occur without grammar; this analytic alignment relation is not a subtype of the sorting operation.
- Ordinary-use wear claim boundary Domain-specific includes Classification
The claim assessment contains a rule-based Classification of changed condition against expected ordinary use before the instrument assigns a bounded cost result.In both admitted cases, a changed asset condition is evaluated under stated criteria and assigned to an ordinary-use or claimable-excess/premature-change side before a claim result is reached. The FOS case uses warranty wording, expected part life and garage evidence to reject the wear denial in its individual dispute. The Reading policy uses fair-wear criteria and expected carpet life to distinguish tenant-caused damage from ordinary consumption, then limits the illustrative deposit amount. This rule-based assignment is an internal step of the complete six-role claim assessment; remove it and the named ordinary-use claim boundary disappears even if damage and a contract remain. Classification can occur without a warranty, deposit, parties or payment consequence, so the parent is a necessary contained constituent, not a genus or an external prerequisite. The cost outcome may be proportional rather than binary; the contained Classification is the prior rule-based assignment of condition to ordinary-use versus outside-ordinary-use status.
- Phylogenetic nomenclature Domain-specific presupposes Classification
Phylogenetic nomenclature structurally presupposes Classification rather than being a subtype of it.The candidate identity is: Phylogenetic nomenclature names taxa by explicit reference to common ancestry and clade definitions rather than fixing names primarily through ranked taxonomic categories. Its operation cannot be stated without the parent relation—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.—but it adds domain-specific carriers, constraints, and warrants. The defining source account begins: Phylogenetic nomenclature assigns biological names through explicit definitions that refer to positions on a phylogenetic tree, especially clades consisting of an ancestor and all its descendants.
- Resource-Typing Mismatch Domain-specific includes 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.
- Sexy Primes Domain-specific presupposes Classification
Sexy Primes presupposes Classification because the class is established by the exact six-unit gap rule over pairs of primes.Every reviewed Sexy Primes instance depends on the parent role: the class is established by the exact six-unit gap rule over pairs of primes. Removing that role makes the frozen child identity undefined or changes it into a different abstraction. Classification can occur without Sexy Primes, so the relation is dependency rather than subsumption.
- Sloppiness Space Domain-specific presupposes Classification
Sloppiness Space presupposes Classification: the parent's defining role is necessary to the child's frozen mechanism or criterion.The reviewed Sloppiness Space identity—A handwriting-recognition feature space centered on an idealized allograph in which points represent possible written variants and class overlap expresses ambiguity caused by rapid or imprecise production—requires the structural role carried by Classification—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action; removing that role makes the child mechanism or criterion undefined. Classification can occur in settings that do not instantiate Sloppiness Space, so this is dependency rather than subsumption.
- Tertiary Carbon Domain-specific presupposes Classification
Tertiary Carbon presupposes Classification: the parent's defining role is necessary to the child's frozen mechanism or criterion.The reviewed Tertiary Carbon identity—A carbon atom directly bonded to three other carbon atoms, classified by local carbon–carbon connectivity—requires the structural role carried by Classification—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action; removing that role makes the child mechanism or criterion undefined. Classification can occur in settings that do not instantiate Tertiary Carbon, so this is dependency rather than subsumption.
- Thematic Analysis Domain-specific includes, 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.
- 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 (9th 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 — Structural Differentiation & Social Ordering (38 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-10-25
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 ↩ Show verification details
Supported in partVerified against the publisher's abstract
The abstract shows Bowker and Star treat classification systems as designed, consequential infrastructures, but it does not state the claim's definition of classification as rule-based assignment of entities to discrete categories.
“the authors review archives of classification design to understand how decisions have been made”
[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 ↩ Show verification details
Supported in partVerified against the publisher's abstract
The publisher abstract confirms a 2009 Springer text surveying supervised learning and classification trees, but it does not state that classification turns ad-hoc judgment into reproducible rules.
“This book contains topics including neural networks, support vector machines, classification trees and boosting”
[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 ↩