{ "model": { "rank": 5424, "code": "thing-q188804", "model_id": "vr.tr.factorization", "name": "factorization", "purpose": "Enable an agent to recognize a factorization task, record its mathematical constraints, judge a proposed decomposition, and choose justified next steps.", "family": "Thing Registry", "category": "Activities and processes", "status": "research-draft", "kind": "thing", "plane": "ACT", "domain": "ACT.ACT", "industry": "", "version": "", "url": "/models/thing/q188804/", "tier": 2, "score": 67, "payload": { "layer": "wikidata", "aliases": [ "Gaussian integer factorization", "matrix decomposition", "Multiple factor analysis", "factorization of polynomials", "integer factorization", "graph factorization", "Schur decomposition", "non-negative matrix factorization", "eigendecomposition of a matrix", "polar decomposition", "probabilistic latent semantic analysis", "LUP decomposition", "Block LU decomposition", "Rank factorization" ], "aliasCount": 14, "merged": 14, "knownIn": 67, "facets": null, "markers": [], "lexicalClass": "", "senseRank": null, "alsoRegisteredAs": null, "source": { "dataset": "wikidata", "item": "Q188804", "url": "https://www.wikidata.org/wiki/Q188804", "license": "CC0 1.0" } }, "research": { "vercy": "1.0-draft", "publication": { "status": "research-draft", "adjudicationStatus": "unreviewed", "publishableCanonical": false, "generatedAt": "2026-09-09T22:20:47Z", "providers": [ "Codex" ], "breadth": "recalled by Codex without web access - no source was read", "missingProviders": [], "pass": 2, "cost": { "grok": { "seconds": 17.7, "error": "Reading additional input from stdin...\nOpenAI Codex v0.153.4\n--------\nworkdir: R:\\02_PROJECTS\\02_Meta_Models_Platforms\\Ver.cy\\current\\thing-registry-backlog\nmodel: gpt-6-astra\nprovider: openai\napproval: never\nsandbox: read-only\nreasoning effort: none\nreasoning summaries: none\nsession id: 01a08841-766c-72e1-b055-3a1a2d00a779\n--------\nuser\nDescribe what is already known about one registered thing. Answer as JSON only, no prose around it.\n\nThing: factorization\nSense to describe: (none recorded)\nDomain code: ACT.PRC\nAlso known as: (none)\n\n\nContext for this batch of 1001 things:\n# Batch 005: 1001 r", "usd": 0, "recall": true }, "codex": { "seconds": 61.4, "error": "Reading additional input from stdin...\nOpenAI Codex v0.153.4\n--------\nworkdir: R:\\02_PROJECTS\\02_Meta_Models_Platforms\\Ver.cy\\current\\thing-registry-backlog\nmodel: gpt-6-astra\nprovider: openai\napproval: never\nsandbox: read-only\nreasoning effort: none\nreasoning summaries: none\nsession id: 01a08841-7667-7a53-85f0-079d83ccb31b\n--------\nuser\nYou are drafting a Vercy meta-model for one registered thing. Answer as JSON only, no prose around it.\n\nThing: factorization\nRegistry id: vr.tr.factorization\nPlane / domain: ACT / ACT.PRC\nRegistry definition: (none recorded)\nNames folded into this entry: (none" } } }, "metaModel": { "id": "THING-Q188804", "registryId": "vr.tr.factorization", "name": "factorization", "version": "0.1.0-research.1", "entryKind": "thing", "family": "Thing Registry", "domain": [ "ACT.PRC" ], "status": "research-draft" }, "canonicalUrl": "https://ver.cy/models/thing/q188804/", "model": { "registry_id": "vr.tr.factorization", "name": "factorization", "purpose": "Enable an agent to recognize a factorization task, record its mathematical constraints, judge a proposed decomposition, and choose justified next steps.", "definition": "Factorization is the mathematical process of expressing an object as a product of factors under a specified multiplication or composition operation, with admissible factors and uniqueness depending on the algebraic setting.", "scope_statement": "This model owns factorization as the mathematical process of expressing a specified object as a product of admissible factors, including exact and explicitly approximate variants; it records the process and its result without treating every form of decomposition as factorization.", "in_scope": [ "The object being factored and the algebraic domain in which its factors must lie", "The multiplication or composition operation that reconstructs the object from its factors", "Requirements on factors, including nontriviality, irreducibility, shape, normalization, or rank", "Methods, intermediate states, and stopping conditions for a factorization attempt", "Verification of exact products or assessment of approximate reconstruction", "Equivalence, uniqueness qualifications, and unresolved factorization obligations" ], "out_of_scope": [ "General additive, set-theoretic, or semantic decomposition without a specified factor product", "Solving equations or finding roots except where used to obtain or verify factors", "The full theory of integers, polynomials, matrices, or their surrounding algebraic structures", "Application models such as cryptographic security, recommender systems, or statistical latent-variable interpretation", "Refactoring software or reorganizing work under a metaphorical use of factorization" ], "distinguishing_features": [ "A candidate factorization specifies factors and an operation whose product reconstructs the target exactly or within a declared approximation criterion.", "A decomposition into summands alone does not qualify unless an explicit factor-product representation is also supplied.", "Validity depends on the permitted domain: a polynomial may admit factors over one coefficient field that are unavailable over another.", "Merely multiplying by an identity element does not satisfy a requirement for nontrivial factors.", "A product identity establishes reconstruction but does not by itself establish that the factors are prime, irreducible, canonical, or fully refined." ], "characteristics": [ { "name": "Target object", "kind": "relation", "unit_or_values": "Reference to an integer, polynomial, matrix, or other object with a specified product operation", "why_it_matters": "Identifies what must be reconstructed and prevents a transformed intermediate object from being mistaken for the original target." }, { "name": "Ambient domain", "kind": "category", "unit_or_values": "Declared coefficient domain, algebraic structure, and relevant dimensions", "why_it_matters": "Determines which factors, inverses, identities, and irreducibility claims are admissible." }, { "name": "Product convention", "kind": "category", "unit_or_values": "Scalar multiplication, polynomial multiplication, ordered matrix multiplication, or another explicitly defined product", "why_it_matters": "Controls reconstruction, factor order, and dimensional compatibility." }, { "name": "Factor admissibility", "kind": "category", "unit_or_values": "Prime, irreducible, nonunit, triangular, orthogonal, nonnegative, prescribed rank, or other declared constraints", "why_it_matters": "Separates an acceptable factorization from an arbitrary product identity." }, { "name": "Reconstruction regime", "kind": "category", "unit_or_values": "Exact symbolic, numerical evaluation of an exact identity, or approximate factorization", "why_it_matters": "Distinguishes approximation permitted by the task from error introduced by computation." }, { "name": "Completion state", "kind": "state", "unit_or_values": "Unstarted, in progress, partial, candidate complete, verified complete, stopped without completion, or infeasible under stated constraints", "why_it_matters": "Makes outstanding factor discovery and certification obligations visible." }, { "name": "Reconstruction residual", "kind": "measurement", "unit_or_values": "Specified norm or error metric, with absolute or relative scale and declared tolerance", "why_it_matters": "Supports assessment of numerical reconstruction without implying exact equality." }, { "name": "Factor equivalence convention", "kind": "category", "unit_or_values": "Permitted permutations, unit or scale transfers, sign conventions, and other explicitly justified transformations", "why_it_matters": "Determines whether different factor lists represent materially different results." }, { "name": "Verification evidence", "kind": "relation", "unit_or_values": "Product check, exact derivation, primality or irreducibility evidence, structural checks, or numerical error report", "why_it_matters": "Connects each claimed property to evidence appropriate to that property." } ], "affordances": [ "Formulate a factorization request with a target, permitted domain, factor constraints, and completion criterion.", "Select a method whose preconditions match the target and requested factor form.", "Record discovered factors and the remaining cofactor or unresolved component.", "Reconstruct the target and test each factor against its required properties.", "Compare candidate factorizations under declared equivalence and normalization rules.", "Continue refinement, change the declared domain, or stop with explicit unresolved obligations." ] }, "sources": [], "structure": { "bundles": [ { "id": "factorization-contract", "name": "Factorization contract", "description": "Identifies the target and the mathematical meaning of a valid product representation.", "rationale": "A factorization cannot be judged without knowing what is being multiplied, where the factors may live, and what product must result.", "layers": [ { "id": "target-and-domain", "name": "Target and domain", "description": "Fixes the input object and the algebraic setting of the request.", "findings": [ { "id": "domain-relative-target", "name": "Domain-relative target", "description": "Record the target's exact representation and permitted factor domain; distinguish a domain extension from progress within the original request.", "questions": [ { "text": "What object is to be factored, and which coefficient domain or algebraic structure contains the permitted factors?", "kind": "definition", "id": "domain-relative-target-q01" }, { "text": "Would introducing complex coefficients, fractions, or another extension change the authorized task?", "kind": "boundary", "id": "domain-relative-target-q02" } ] } ] }, { "id": "reconstruction-operation", "name": "Reconstruction operation", "description": "Specifies the product expression, including order and auxiliary transformations.", "findings": [ { "id": "explicit-product-identity", "name": "Explicit product identity", "description": "Require a reconstruction expression that exposes factor order, dimensions, powers, permutations, and transposes or adjoints where applicable.", "questions": [ { "text": "What explicit product expression must equal or approximate the target?", "kind": "definition", "id": "explicit-product-identity-q01" }, { "text": "Which factor orders and dimensions are valid, and are permutations, transposes, or adjoints part of the expression?", "kind": "boundary", "id": "explicit-product-identity-q02" } ] } ] } ] }, { "id": "admissible-factor-form", "name": "Admissible factor form", "description": "Defines which product representations satisfy the requested factorization.", "rationale": "Reconstruction alone permits trivial or unsuitable products and does not determine whether further factorization is required.", "layers": [ { "id": "factor-property-requirements", "name": "Factor property requirements", "description": "Captures mathematical constraints on individual factors and their collective form.", "findings": [ { "id": "required-factor-properties", "name": "Required factor properties", "description": "Record whether factors must be prime, irreducible, nonunit, or structurally constrained, and specify how those requirements apply to each factor.", "questions": [ { "text": "Which factors must be prime, irreducible, nonunit, triangular, orthogonal, nonnegative, or otherwise constrained?", "kind": "definition", "id": "required-factor-properties-q01" }, { "text": "Are identity factors, zero factors, rectangular factors, or repeated factors permitted for this target?", "kind": "boundary", "id": "required-factor-properties-q02" } ] } ] }, { "id": "refinement-and-multiplicity", "name": "Refinement and multiplicity", "description": "Separates discovery of a useful split from completion of the requested factor form.", "findings": [ { "id": "remaining-factor-obligations", "name": "Remaining factor obligations", "description": "Track multiplicities and unresolved cofactors explicitly; define completeness against the requested endpoint rather than the existence of any split.", "questions": [ { "text": "What establishes completion: one nontrivial split, full prime or irreducible refinement, or a specified structured product?", "kind": "definition", "id": "remaining-factor-obligations-q01" }, { "text": "Which factors still require splitting, multiplicity determination, or certification?", "kind": "action", "id": "remaining-factor-obligations-q02" } ] } ] } ] }, { "id": "factorization-method-and-progress", "name": "Factorization method and progress", "description": "Records how factors are sought and how a computation advances or stops.", "rationale": "Method suitability and incomplete search outcomes must remain distinguishable from mathematical existence or impossibility claims.", "layers": [ { "id": "method-preconditions", "name": "Method preconditions", "description": "Connects a chosen procedure to the target's structure and the requested factor form.", "findings": [ { "id": "method-applicability", "name": "Method applicability", "description": "Record the procedure, its assumptions, and any preprocessing that must be reversed when reconstructing the original target.", "questions": [ { "text": "Which method is being used, and which properties of this integer, polynomial, matrix, or other target make it applicable?", "kind": "action", "id": "method-applicability-q01" }, { "text": "What scaling, content extraction, variable substitution, or pivoting has been applied, and how is it included in reconstruction?", "kind": "provenance", "id": "method-applicability-q02" } ] } ] }, { "id": "search-and-stopping-state", "name": "Search and stopping state", "description": "Captures partial results and the reason an attempt ended.", "findings": [ { "id": "qualified-attempt-outcome", "name": "Qualified attempt outcome", "description": "Separate verified completion, a resource-limited stop, numerical failure, and demonstrated infeasibility under the stated constraints.", "questions": [ { "text": "What factors and remaining cofactor or residual are available at the current stopping point?", "kind": "measurement", "id": "qualified-attempt-outcome-q01" }, { "text": "Did the attempt stop because the requested form was verified, resources ran out, the method failed, or infeasibility was established?", "kind": "action", "id": "qualified-attempt-outcome-q02" } ] } ] } ] }, { "id": "reconstruction-and-certification", "name": "Reconstruction and certification", "description": "Evaluates product accuracy and evidence for the required factor properties.", "rationale": "A plausible factor list can reconstruct incorrectly, while a correct product can still fail the requested primality, irreducibility, or structural requirements.", "layers": [ { "id": "product-verification", "name": "Product verification", "description": "Checks the reconstructed object against the target using the declared exactness regime.", "findings": [ { "id": "reconstruction-evidence", "name": "Reconstruction evidence", "description": "Record an exact equality check or a numerical residual with its norm, scale, precision, and acceptance threshold.", "questions": [ { "text": "Does multiplying the factors in the specified order reproduce the original target exactly?", "kind": "measurement", "id": "reconstruction-evidence-q01" }, { "text": "If reconstruction is numerical or approximate, what residual metric, precision, and tolerance determine acceptance?", "kind": "measurement", "id": "reconstruction-evidence-q02" } ] } ] }, { "id": "factor-property-certification", "name": "Factor property certification", "description": "Checks claims about factors separately from product reconstruction.", "findings": [ { "id": "property-specific-evidence", "name": "Property-specific evidence", "description": "Associate each required factor property with a suitable check, and preserve uncertainty where evidence is probabilistic or incomplete.", "questions": [ { "text": "What evidence establishes each required primality, irreducibility, rank, orthogonality, or sign constraint?", "kind": "provenance", "id": "property-specific-evidence-q01" }, { "text": "Which properties remain conjectured, probabilistically supported, or untested despite a successful product check?", "kind": "boundary", "id": "property-specific-evidence-q02" } ] } ] } ] }, { "id": "equivalence-and-result-interpretation", "name": "Equivalence and result interpretation", "description": "Determines how alternative factor lists relate and what conclusions a verified result supports.", "rationale": "Factorizations can vary by harmless conventions or substantive choices, and uniqueness claims require explicit assumptions.", "layers": [ { "id": "normalization-and-equivalence", "name": "Normalization and equivalence", "description": "Defines permitted changes of presentation that preserve the relevant result.", "findings": [ { "id": "factor-list-equivalence", "name": "Factor-list equivalence", "description": "Record allowed reorderings and transfers of units, signs, or scales between factors; apply them only when they preserve the product and constraints.", "questions": [ { "text": "Which permutations or transfers of units, signs, or scales make two factor lists equivalent in this setting?", "kind": "definition", "id": "factor-list-equivalence-q01" }, { "text": "What normalization convention should be applied before comparing or storing the results?", "kind": "action", "id": "factor-list-equivalence-q02" } ] } ] }, { "id": "uniqueness-and-supported-use", "name": "Uniqueness and supported use", "description": "Qualifies uniqueness and limits conclusions drawn from the decomposition.", "findings": [ { "id": "qualified-result-claims", "name": "Qualified result claims", "description": "Distinguish a verified factorization from a unique one, and separate algebraic validity from any application-specific interpretation of the factors.", "questions": [ { "text": "Under which domain assumptions and equivalence convention, if any, is this factorization claimed to be unique?", "kind": "boundary", "id": "qualified-result-claims-q01" }, { "text": "Which intended next actions are justified by the verified factor properties, and which require additional application evidence?", "kind": "action", "id": "qualified-result-claims-q02" } ] } ] } ] }, { "id": "evidence-and-external-alignment", "name": "Evidence and external alignment", "description": "What the world already says about this thing, gathered so the model can be checked against it.", "rationale": "A model that cannot be lined up against existing standards, identifiers and practice cannot be adopted by anyone who already uses them.", "layers": [ { "id": "reported-evidence", "name": "Reported evidence", "description": "Findings from the breadth pass, kept separate from the structural claims.", "findings": [ { "id": "evidence-confidence-notes", "name": "Check these first", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "No sense is recorded; this description assumes the mathematical process, consistent with ACT.PRC.", "Integer and polynomial factorizations may seek prime or irreducible factors, whereas matrix and operator factorizations usually seek factors with specified structural properties.", "This is recall-based; no sources or standards were consulted." ], "questions": [ { "id": "evidence-confidence-notes-q01", "text": "Which of these check these first hold for the sense of factorization this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-kinds", "name": "Kinds and varieties", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Integer prime factorization", "Polynomial factorization", "Factorization into irreducibles in rings", "Matrix factorization", "Operator factorization", "Factorization of morphisms in category theory" ], "questions": [ { "id": "evidence-kinds-q01", "text": "Which of these kinds and varieties hold for the sense of factorization this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-real-world-use", "name": "Real-world use", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Simplifying algebraic expressions and solving polynomial equations.", "Solving linear systems and least-squares problems through matrix factorizations.", "Assessing the security of cryptographic systems whose assumptions involve integer factorization.", "Constructing low-rank representations for compression and recommendation systems.", "Exposing divisibility and structural properties in mathematical proofs." ], "questions": [ { "id": "evidence-real-world-use-q01", "text": "Which of these real-world use hold for the sense of factorization this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-measurements", "name": "Typical measurements", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ { "quantity": "Integer input size", "typical_range": "Problem-dependent; commonly expressed as the number of binary digits.", "unit": "bit" }, { "quantity": "Relative matrix reconstruction residual", "typical_range": "Zero for an exact reconstruction; a nonnegative, problem-dependent value for an approximate or floating-point reconstruction.", "unit": "dimensionless" } ], "questions": [ { "id": "evidence-measurements-q01", "text": "Which of these typical measurements hold for the sense of factorization this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-failure-modes-and-hazards", "name": "Failure modes and hazards", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Claiming uniqueness without specifying the algebraic setting or accounting for units and factor order.", "Treating a polynomial as irreducible without specifying its coefficient field or ring.", "Assuming that finding an integer factorization is as computationally easy as verifying a proposed one.", "Using a matrix factorization whose assumptions, such as positive definiteness, are not satisfied.", "Obtaining inaccurate numerical results through ill-conditioning, roundoff, or unstable algorithm choices." ], "questions": [ { "id": "evidence-failure-modes-and-hazards-q01", "text": "Which of these failure modes and hazards hold for the sense of factorization this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-regional-variation", "name": "Regional variation", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "\"Factorization\" and \"factorisation\" are spelling variants; mathematical distinctions primarily follow subfield and algebraic setting." ], "questions": [ { "id": "evidence-regional-variation-q01", "text": "Which of these regional variation hold for the sense of factorization this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-neighbours", "name": "Neighbouring kinds and how to tell them apart", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ { "name": "Multiplication", "difference": "Multiplication combines supplied factors into a product; factorization seeks factors of a supplied object." }, { "name": "Decomposition", "difference": "Decomposition includes additive and other structural representations; factorization specifically uses a product or composition." }, { "name": "Primality testing", "difference": "Primality testing decides whether an integer is prime; factorization produces factors of an integer." }, { "name": "Root finding", "difference": "Root finding seeks values where a function vanishes; polynomial factorization seeks polynomial factors over a specified coefficient domain." }, { "name": "Expansion", "difference": "Expansion distributes products into sums; factorization rewrites a suitable expression as a product." } ], "questions": [ { "id": "evidence-neighbours-q01", "text": "Which of these neighbouring kinds and how to tell them apart hold for the sense of factorization this model covers, and on what evidence?", "kind": "provenance" } ] } ] } ] } ] }, "openQuestions": [ "Does the registry intend factorization to cover integer and polynomial factorization only, or also structured matrix and approximate numerical factorizations?", "Should factorizations under general composition operations belong here, or to a neighbouring model of mathematical decomposition?", "Which factorization families need separate profiles so that completeness, admissibility, and verification retain precise meanings?", "What evidence standards should distinguish certified, probabilistically supported, and numerically accepted results in each supported family?", "How should the model represent exceptional inputs such as zero and units, where ordinary expectations about nontrivial factors or uniqueness need qualification?" ], "statistics": { "bundles": 6, "layers": 11, "findings": 17, "questions": 27 } }, "draft": { "generator": "vr.draft.v3", "status": "draft-generated", "researched": false, "archetype": "abstract concept", "method": "Written from the archetype playbook - what this kind of thing needs beyond identity and provenance - and from the structure that recurred across 6,333 models already researched by two engines. Applied to this entry by rule. No source was read for this thing and no claim here is researched. This entry carries no facets of its own, so they were inferred from its domain - a guess about a whole domain applied to one thing.", "facetsInferred": true, "nextPass": "A researcher replaces this draft with a sourced specification. Treat every sentence below as a proposal to argue with.", "purpose": "Give an agent a durable, checkable way to recognise a factorization, record what state it is in, and decide what may be done with it.", "whatItIs": "Enable an agent to recognize a factorization task, record its mathematical constraints, judge a proposed decomposition, and choose justified next steps.", "characteristics": { "substance": "activity", "origin": "conceptual", "agency": "inert" }, "whatYouCanDoWithIt": [ "observed and measured" ], "distinguishingFeatures": [ "Names folded into this entry, which a task may need to split apart again: Gaussian integer factorization, matrix decomposition, Multiple factor analysis, factorization of polynomials, integer factorization, graph factorization, Schur decomposition, non-negative matrix factorization, eigendecomposition of a matrix, polar decomposition, probabilistic latent semantic analysis, LUP decomposition.", "14 finer distinctions are held as aliases rather than separate entries, because telling them apart needs a task that asks for it.", "Described in 67 Wikipedia languages, which is a measure of how widely the thing is known, not of how important it is." ], "openQuestionsForResearch": [ "Which of the bundles below does a real task actually need, and which are ceremony?", "What does this thing have that the facets do not capture at all?", "Which neighbouring kind is most often confused with a factorization, and on what evidence are they told apart?" ], "whatItIsMadeOf": "something that happens over time", "physicalCharacter": [ "Does nothing on its own; everything it does, something else did to it.", "These come from the domain this entry sits in rather than from the entry itself, so treat them as a first guess about the whole domain applied to one thing." ], "whatCanBeDoneWithIt": [ "observe it, measure it, record its state" ], "howItIsRecognised": [ "Nothing to see. What is recognised is an instance of it, and which instances count is exactly what is argued about." ], "relatedModels": [ { "relation": "covers", "note": "Finer kinds folded into this entry because telling them apart needs a task that asks for it. Each is a model waiting to be split out when one does.", "targets": [ "Gaussian integer factorization", "matrix decomposition", "Multiple factor analysis", "factorization of polynomials", "integer factorization", "graph factorization", "Schur decomposition", "non-negative matrix factorization", "eigendecomposition of a matrix", "polar decomposition", "probabilistic latent semantic analysis", "LUP decomposition" ] } ], "standing": "Described in 67 Wikipedia languages, which measures how widely it is written about rather than how important or how common it is. 14 finer distinctions are held inside this entry as names rather than as separate models.", "structure": { "bundles": [ { "id": "identity-and-classification", "name": "Identity, naming and classification", "description": "How an agent tells one factorization from another, and a factorization from things that resemble it.", "rationale": "Recognition comes before every other claim. Without stable identity nothing else in the model can be trusted to be about the same thing twice.", "layers": [ { "id": "naming-and-identifiers", "name": "Names and identifiers", "description": "The names this thing goes by and the identifiers that survive translation and time.", "findings": [ { "id": "preferred-name-and-aliases", "name": "Preferred name, aliases and local names", "description": "Which name to use, which names mean the same thing, and which merely sound similar.", "questions": [ { "id": "preferred-name-and-aliases-q01", "text": "What identifies and describes the name of a factorization, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "preferred-name-and-aliases-q02", "text": "Who or what asserted this about the name of a factorization, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "preferred-name-and-aliases-q03", "text": "What may an agent decide or do once the name of a factorization is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] }, { "id": "stable-identifiers", "name": "Stable identifiers and external keys", "description": "Identifiers that keep pointing at this kind of thing across systems and languages.", "questions": [ { "id": "stable-identifiers-q01", "text": "What identifies and describes an identifier for a factorization, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "stable-identifiers-q02", "text": "Who or what asserted this about an identifier for a factorization, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "stable-identifiers-q03", "text": "What may an agent decide or do once an identifier for a factorization is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] } ] }, { "id": "classification-and-granularity", "name": "Classification and granularity", "description": "Where a factorization sits among kinds, and how finely a task needs to cut it.", "findings": [ { "id": "kind-and-parents", "name": "Kind, parents and neighbouring kinds", "description": "The classes this thing belongs to and the ones it is next to.", "questions": [ { "id": "kind-and-parents-q01", "text": "What identifies and describes the kind of a factorization, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "kind-and-parents-q02", "text": "Who or what asserted this about the kind of a factorization, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "kind-and-parents-q03", "text": "What may an agent decide or do once the kind of a factorization is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] }, { "id": "distinguishing-features", "name": "Distinguishing features", "description": "What separates a factorization from the things most often confused with it.", "questions": [ { "id": "distinguishing-features-q01", "text": "What identifies and describes what distinguishes a factorization, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "distinguishing-features-q02", "text": "Who or what asserted this about what distinguishes a factorization, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "distinguishing-features-q03", "text": "What may an agent decide or do once what distinguishes a factorization is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] } ] } ] }, { "id": "state-and-lifecycle", "name": "State and lifecycle", "description": "The states a factorization passes through and the events that move it between them.", "rationale": "Most decisions about a thing depend on what state it is in now, which is a claim with a time on it, not a property.", "layers": [ { "id": "lifecycle-stages", "name": "Lifecycle stages", "description": "From coming into existence to ceasing to be one of these.", "findings": [ { "id": "stages-and-transitions", "name": "Stages and transitions", "description": "The stages worth naming and what moves a factorization between them.", "questions": [ { "id": "stages-and-transitions-q01", "text": "What identifies and describes the lifecycle of a factorization, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "stages-and-transitions-q02", "text": "Who or what asserted this about the lifecycle of a factorization, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "stages-and-transitions-q03", "text": "What may an agent decide or do once the lifecycle of a factorization is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] } ] }, { "id": "observations-and-status", "name": "Observations and current status", "description": "What is observed about a factorization, how often and by whom.", "findings": [ { "id": "observation-record", "name": "Observation record", "description": "How an observation of a factorization is recorded so that it can be superseded rather than overwritten.", "questions": [ { "id": "observation-record-q01", "text": "What identifies and describes an observation of a factorization, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "observation-record-q02", "text": "Who or what asserted this about an observation of a factorization, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "observation-record-q03", "text": "What may an agent decide or do once an observation of a factorization is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] } ] } ] }, { "id": "process-and-outcome", "name": "Process, inputs and outcome", "description": "How a factorization proceeds, what it needs and what it leaves behind.", "rationale": "An activity is known by its steps and its results, and both have to be recordable while it is still running.", "layers": [ { "id": "steps-and-sequence", "name": "Steps and sequence", "description": "The steps of a factorization, their order and what may run in parallel.", "findings": [ { "id": "steps-and-preconditions", "name": "Steps, preconditions and completion", "description": "What has to be true before each step of a factorization and what marks it done.", "questions": [ { "id": "steps-and-preconditions-q01", "text": "What identifies and describes a step of a factorization, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "steps-and-preconditions-q02", "text": "Who or what asserted this about a step of a factorization, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "steps-and-preconditions-q03", "text": "What may an agent decide or do once a step of a factorization is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] } ] }, { "id": "inputs-and-results", "name": "Inputs, resources and results", "description": "What a factorization consumes and what it produces.", "findings": [ { "id": "inputs-and-outputs", "name": "Inputs, outputs and side effects", "description": "The resources a factorization takes and the results it leaves, wanted or not.", "questions": [ { "id": "inputs-and-outputs-q01", "text": "What identifies and describes the inputs and results of a factorization, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "inputs-and-outputs-q02", "text": "Who or what asserted this about the inputs and results of a factorization, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "inputs-and-outputs-q03", "text": "What may an agent decide or do once the inputs and results of a factorization is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] } ] } ] }, { "id": "definitions-in-contest", "name": "Definitions and who holds them", "description": "What factorization is taken to mean, and by whom.", "rationale": "When a field disagrees about a concept, the disagreement is the content. A model that picks one definition silently destroys the information.", "layers": [ { "id": "competing-definitions", "name": "Competing definitions", "description": "The main readings and the traditions behind them.", "findings": [ { "id": "definition-map", "name": "Definitions and their holders", "description": "Each definition with the school or body that holds it.", "questions": [ { "id": "definition-map-q01", "text": "Which definitions of factorization are in use, and which tradition or body holds each?", "kind": "definition" }, { "id": "definition-map-q02", "text": "What turns on the difference between them in practice?", "kind": "boundary" } ] } ] }, { "id": "operationalisation", "name": "Operationalisation", "description": "How it is measured or applied when it has to be.", "findings": [ { "id": "operational-record", "name": "Measures and proxies", "description": "Instruments and indicators used to stand in for it.", "questions": [ { "id": "operational-record-q01", "text": "How is factorization operationalised or measured in practice, and by what instrument?", "kind": "measurement" }, { "id": "operational-record-q02", "text": "What does that operationalisation leave out, and when does that matter?", "kind": "boundary" } ] } ] } ] }, { "id": "instances-and-use", "name": "Instances, use and consequence", "description": "What counts as an instance of factorization and what follows from calling something that.", "rationale": "Applying a concept is an act with consequences, so a model must say what the label licenses and what it does not.", "layers": [ { "id": "instances", "name": "What counts as an instance", "description": "Clear cases, borderline cases and non-cases.", "findings": [ { "id": "instance-tests", "name": "Tests for an instance", "description": "What would settle whether something falls under it.", "questions": [ { "id": "instance-tests-q01", "text": "What would settle whether something is an instance of factorization?", "kind": "boundary" }, { "id": "instance-tests-q02", "text": "Which borderline cases are argued about, and on what grounds?", "kind": "definition" } ] } ] }, { "id": "consequence", "name": "Consequence of application", "description": "Rights, duties or decisions that follow from the label.", "findings": [ { "id": "consequence-record", "name": "What the label licenses", "description": "What an agent may do once something is classified this way.", "questions": [ { "id": "consequence-record-q01", "text": "What follows practically once something is treated as factorization?", "kind": "action" }, { "id": "consequence-record-q02", "text": "What must an agent not infer from the label alone?", "kind": "action" } ] } ] } ] }, { "id": "provenance-and-evidence", "name": "Provenance, evidence and time", "description": "Where every claim about a factorization came from and when it held.", "rationale": "A claim without a source and a time cannot be superseded, only overwritten, and an agent that overwrites loses the ability to explain itself.", "layers": [ { "id": "source-and-authority", "name": "Source and authority", "description": "Who said it, on what evidence, and how strongly.", "findings": [ { "id": "claim-provenance", "name": "Claim provenance and confidence", "description": "The authority behind each claim about a factorization and how confident it is.", "questions": [ { "id": "claim-provenance-q01", "text": "What identifies and describes a claim about a factorization, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "claim-provenance-q02", "text": "Who or what asserted this about a claim about a factorization, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "claim-provenance-q03", "text": "What may an agent decide or do once a claim about a factorization is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] } ] }, { "id": "time-and-versions", "name": "Time, versions and supersession", "description": "When a claim was true, when it was learnt, and what replaced it.", "findings": [ { "id": "validity-and-supersession", "name": "Validity period and supersession", "description": "How an old claim about a factorization is retired without being erased.", "questions": [ { "id": "validity-and-supersession-q01", "text": "What identifies and describes the validity of a claim about a factorization, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "validity-and-supersession-q02", "text": "Who or what asserted this about the validity of a claim about a factorization, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "validity-and-supersession-q03", "text": "What may an agent decide or do once the validity of a claim about a factorization is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] } ] } ] } ] }, "statistics": { "bundles": 6, "layers": 12, "findings": 14, "questions": 38 } } } }