{ "model": { "rank": 6244, "code": "thing-q180943", "model_id": "vr.tr.caesar-cipher", "name": "Caesar cipher", "purpose": "Enable an agent to recognise a Caesar cipher, determine whether its alphabet and shift are sufficiently specified, and choose valid transformation, recovery or replacement actions.", "family": "Thing Registry", "category": "Information and virtual systems", "status": "research-draft", "kind": "thing", "plane": "INF", "domain": "INF.MED", "industry": "", "version": "", "url": "/models/thing/q180943/", "tier": 2, "score": 61, "payload": { "layer": "wikidata", "aliases": [ "ROT13" ], "aliasCount": 1, "merged": 1, "knownIn": 61, "facets": null, "markers": [], "lexicalClass": "", "senseRank": null, "alsoRegisteredAs": null, "source": { "dataset": "wikidata", "item": "Q180943", "url": "https://www.wikidata.org/wiki/Q180943", "license": "CC0 1.0" } }, "research": { "vercy": "1.0-draft", "publication": { "status": "research-draft", "adjudicationStatus": "unreviewed", "publishableCanonical": false, "generatedAt": "2026-09-07T13:24:22Z", "providers": [ "Codex", "Grok" ], "missingProviders": [], "pass": 2, "cost": { "grok": { "usd": 0.00694824, "turns": 1, "seconds": 109.7, "error": null }, "codex": { "seconds": 79.3, "error": "Reading additional input from stdin...\nOpenAI Codex v0.153.3\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: 01a07c08-8026-7091-bf41-ded26d7ba5a2\n--------\nuser\nYou are drafting a Vercy meta-model for one registered thing. Answer as JSON only, no prose around it.\n\nThing: Caesar cipher\nRegistry id: vr.tr.caesar-cipher\nPlane / domain: INF / INF.MED\nRegistry definition: (none recorded)\nNames folded into this entry: (none" } } }, "metaModel": { "id": "THING-Q180943", "registryId": "vr.tr.caesar-cipher", "name": "Caesar cipher", "version": "0.1.0-research.1", "entryKind": "thing", "family": "Thing Registry", "domain": [ "INF.MED" ], "status": "research-draft" }, "canonicalUrl": "https://ver.cy/models/thing/q180943/", "model": { "registry_id": "vr.tr.caesar-cipher", "name": "Caesar cipher", "purpose": "Enable an agent to recognise a Caesar cipher, determine whether its alphabet and shift are sufficiently specified, and choose valid transformation, recovery or replacement actions.", "definition": "A Caesar cipher is a monoalphabetic substitution on a cyclic alphabet in which every letter is replaced by the letter a fixed number of positions away, equivalently c ≡ p + k (mod n) for alphabet size n and constant shift k.", "scope_statement": "This model owns a Caesar cipher's fixed cyclic substitution rule, alphabet conventions, application to text, evidence for identifying its parameters, and suitability for the intended use.", "in_scope": [ "The ordered alphabet and its cyclic indexing", "The constant shift, direction convention and inverse transformation", "Treatment of case, unsupported characters and text normalization", "Plaintext-ciphertext relationships and evidence supporting candidate shifts", "Completeness, consistency and security suitability of a Caesar-cipher configuration" ], "out_of_scope": [ "Arbitrary monoalphabetic substitution mappings", "Position-dependent or repeating-key shifts such as Vigenère", "General affine ciphers whose multiplier is not one", "Transposition ciphers that rearrange character positions", "Modern encryption protocols, key management and access control", "Historical attribution, biographies and transmission of particular documents" ], "distinguishing_features": [ "For an explicitly ordered alphabet of size N, every supported symbol maps to the symbol at index (i + k) mod N for one constant k.", "Repeated occurrences of a supported symbol receive the same substitution regardless of position or neighbouring symbols.", "The substitution preserves cyclic alphabet order; an arbitrary substitution permutation generally does not.", "Supported symbols retain their positions rather than being rearranged, distinguishing the cipher from transposition.", "ROT13 is the specific shift-13 case on a 26-letter alphabet; a Caesar cipher need not use either that shift or that alphabet." ], "characteristics": [ { "name": "Ordered alphabet", "kind": "category", "unit_or_values": "Explicit finite sequence of distinct symbols", "why_it_matters": "The same numerical shift produces different substitutions when alphabet membership or order changes." }, { "name": "Alphabet size", "kind": "measurement", "unit_or_values": "N distinct symbols", "why_it_matters": "Determines wraparound, the number of distinct shifts and the size of exhaustive recovery." }, { "name": "Canonical encryption shift", "kind": "measurement", "unit_or_values": "Integer k in 0 through N−1, with encryption defined as i ↦ (i + k) mod N", "why_it_matters": "Makes equivalent shift descriptions comparable and fixes the direction of the transformation." }, { "name": "Shift knowledge", "kind": "state", "unit_or_values": "Unspecified | candidate set | uniquely supported | contradicted", "why_it_matters": "Separates an executable configuration from an inference that still requires evidence." }, { "name": "Case treatment", "kind": "category", "unit_or_values": "Separate aligned alphabets | case normalization | case included in alphabet | other explicitly defined policy", "why_it_matters": "Controls whether uppercase and lowercase characters transform alike and whether original case can be recovered." }, { "name": "Unsupported-symbol treatment", "kind": "category", "unit_or_values": "Preserve | reject | remove | explicitly defined preprocessing", "why_it_matters": "Determines the handling of spaces, punctuation, digits and symbols outside the alphabet." }, { "name": "Paired-text evidence", "kind": "relation", "unit_or_values": "Links to plaintext-ciphertext pairs with alignment and provenance", "why_it_matters": "Allows the agent to test whether observed substitutions support one constant shift." }, { "name": "Exact recovery status", "kind": "state", "unit_or_values": "Original input recoverable | normalized input only recoverable | unresolved", "why_it_matters": "The substitution is reversible, but normalization or symbol removal can discard information." }, { "name": "Intended use", "kind": "category", "unit_or_values": "Teaching | puzzle | reversible obfuscation | claimed confidentiality | unspecified", "why_it_matters": "Distinguishes appropriate illustrative uses from security requirements the cipher cannot meet." } ], "affordances": [ "Encode supported text using a declared alphabet, shift and character policy.", "Decode text by applying the inverse of the declared encryption shift.", "Enumerate candidate shifts and retain ambiguity where evidence does not select one.", "Test paired samples for a constant modular offset and identify contradictions.", "Compare configurations for equivalent mappings, including shifts differing by a multiple of the alphabet size.", "Flag confidentiality requirements that require a different encryption mechanism." ] }, "sources": [ { "id": "wikipedia-caesar-cipher", "title": "Caesar cipher - Wikipedia, Wikimedia Foundation", "url": "https://en.wikipedia.org/wiki/Caesar_cipher", "what_it_supports": "Definition as a constant-shift substitution, relation to ROT13, brute-force and frequency-analysis weakness, and the Suetonius attribution of k = 3 and k = 1.", "url_status": "live" }, { "id": "suetonius-de-vita-caesarum", "title": "Suetonius, De vita Caesarum (Divus Iulius 56; Divus Augustus 88) - Loeb Classical Library, Harvard University Press", "url": "", "what_it_supports": "Primary historical witness that Julius Caesar wrote with a three-letter shift and that Augustus used a one-letter shift." }, { "id": "kahn-codebreakers", "title": "David Kahn, The Codebreakers - Scribner (1967; revised 1996)", "url": "", "what_it_supports": "Placement of the Caesar shift among classical substitution ciphers and its status as a teaching example rather than a practical secrecy system." }, { "id": "wikipedia-rot13", "title": "ROT13 - Wikipedia, Wikimedia Foundation", "url": "https://en.wikipedia.org/wiki/ROT13", "what_it_supports": "ROT13 as the self-inverse Caesar special case and its real-world use for Usenet/forum spoiler hiding rather than confidentiality.", "url_status": "live" } ], "structure": { "bundles": [ { "id": "cyclic-substitution-identity", "name": "Cyclic substitution identity", "description": "Establishes whether the proposed transformation is a Caesar cipher over a declared alphabet.", "rationale": "A constant numerical shift is meaningful only relative to a fixed alphabet order and must be distinguished from other substitution rules.", "layers": [ { "id": "alphabet-basis", "name": "Alphabet basis", "description": "Records the symbols and order that define the substitution cycle.", "findings": [ { "id": "explicit-alphabet-cycle", "name": "Explicit alphabet cycle", "description": "Recognition requires a finite ordered alphabet with distinct symbols and a defined indexing convention.", "questions": [ { "text": "Which distinct symbols form the alphabet, and in what exact order?", "kind": "definition", "id": "explicit-alphabet-cycle-q01" }, { "text": "Is that order supplied by the configuration, established by a source, or assumed during analysis?", "kind": "provenance", "id": "explicit-alphabet-cycle-q02" } ] } ] }, { "id": "constant-offset-test", "name": "Constant offset test", "description": "Tests whether the mapping is one rotation of that alphabet.", "findings": [ { "id": "uniform-modular-displacement", "name": "Uniform modular displacement", "description": "Every supported substitution must have the same modular displacement; variation by position or symbol contradicts the declared Caesar rule.", "questions": [ { "text": "Does every observed supported substitution satisfy (ciphertext index − plaintext index) mod N = k for the same k?", "kind": "measurement", "id": "uniform-modular-displacement-q01" }, { "text": "Does any observed mapping require an arbitrary permutation, a changing shift or a rearrangement of positions?", "kind": "boundary", "id": "uniform-modular-displacement-q02" } ] } ] } ] }, { "id": "shift-and-inverse", "name": "Shift and inverse", "description": "Makes the transformation executable and its parameter descriptions comparable.", "rationale": "A shift value without direction and modulus can produce the wrong result even when the cipher family is correctly identified.", "layers": [ { "id": "encryption-parameter", "name": "Encryption parameter", "description": "Expresses the shift under one explicit encryption convention.", "findings": [ { "id": "canonical-shift", "name": "Canonical shift", "description": "Represent encryption as addition of k modulo N and reduce equivalent signed or oversized shifts to the same canonical value.", "questions": [ { "text": "What value of k represents encryption under the declared positive alphabet direction?", "kind": "definition", "id": "canonical-shift-q01" }, { "text": "What canonical value results when the supplied shift is reduced modulo N?", "kind": "measurement", "id": "canonical-shift-q02" } ] } ] }, { "id": "inverse-and-special-cases", "name": "Inverse and special cases", "description": "Determines the reverse operation and identifies identity or self-inverse rotations.", "findings": [ { "id": "inverse-shift-behaviour", "name": "Inverse shift behaviour", "description": "Decoding uses −k modulo N; k = 0 is the identity, and a rotation is self-inverse when 2k is divisible by N.", "questions": [ { "text": "Which inverse shift restores supported input symbols after encryption?", "kind": "action", "id": "inverse-shift-behaviour-q01" }, { "text": "Does this configuration produce an identity mapping or a self-inverse rotation?", "kind": "measurement", "id": "inverse-shift-behaviour-q02" } ] } ] } ] }, { "id": "text-handling-contract", "name": "Text handling contract", "description": "Defines how actual text is converted into cipher symbols and reconstructed.", "rationale": "Unstated case, punctuation or normalization rules can prevent reproducibility and exact recovery.", "layers": [ { "id": "symbol-interpretation", "name": "Symbol interpretation", "description": "Establishes the units shifted and how textual variants enter the alphabet.", "findings": [ { "id": "case-and-normalization-policy", "name": "Case and normalization policy", "description": "The agent needs explicit rules for case and normalization rather than assuming that all visually similar text denotes identical cipher symbols.", "questions": [ { "text": "What constitutes one cipher symbol, and how are uppercase, lowercase and accented forms handled?", "kind": "definition", "id": "case-and-normalization-policy-q01" }, { "text": "If case uses separate alphabets, do they apply the same shift under aligned alphabet orders?", "kind": "boundary", "id": "case-and-normalization-policy-q02" } ] } ] }, { "id": "preservation-and-loss", "name": "Preservation and loss", "description": "Separates reversible substitution from information lost through text preparation.", "findings": [ { "id": "unsupported-symbol-and-round-trip-policy", "name": "Unsupported symbols and round-trip recovery", "description": "Preservation, rejection or removal of unsupported symbols must be recorded, together with any effect on recovering the original input.", "questions": [ { "text": "Are spaces, punctuation, digits and other unsupported symbols preserved, rejected or removed?", "kind": "definition", "id": "unsupported-symbol-and-round-trip-policy-q01" }, { "text": "Does decoding an encoded sample reproduce the original input exactly or only its normalized form?", "kind": "measurement", "id": "unsupported-symbol-and-round-trip-policy-q02" } ] } ] } ] }, { "id": "identification-and-recovery", "name": "Identification and recovery", "description": "Tracks evidence for recognizing the cipher and recovering its shift.", "rationale": "Plausible decoded text alone does not establish a unique shift or prove that an unknown text uses this cipher.", "layers": [ { "id": "paired-evidence", "name": "Paired evidence", "description": "Uses aligned plaintext and ciphertext to support or contradict a candidate configuration.", "findings": [ { "id": "sample-consistency", "name": "Sample consistency", "description": "An aligned supported symbol pair determines a candidate offset for a fixed alphabet; additional pairs test whether that offset remains consistent.", "questions": [ { "text": "Where did the paired samples come from, and is their alignment established?", "kind": "provenance", "id": "sample-consistency-q01" }, { "text": "Which pairs support the candidate shift, and which contradict it after the declared preprocessing?", "kind": "measurement", "id": "sample-consistency-q02" } ] } ] }, { "id": "ciphertext-only-candidates", "name": "Ciphertext-only candidates", "description": "Manages candidate rotations when the plaintext or shift is unknown.", "findings": [ { "id": "candidate-set-and-ambiguity", "name": "Candidate set and ambiguity", "description": "A fixed alphabet permits enumeration of N distinct shift mappings, including the identity; language expectations can rank outputs without guaranteeing a unique answer.", "questions": [ { "text": "Which shifts remain plausible after enumeration, and what evidence supports their ranking?", "kind": "measurement", "id": "candidate-set-and-ambiguity-q01" }, { "text": "What additional known text, language information or external clue would distinguish the remaining candidates?", "kind": "action", "id": "candidate-set-and-ambiguity-q02" } ] } ] } ] }, { "id": "use-and-exposure", "name": "Use and exposure", "description": "Connects the cipher's limited concealment properties to decisions about its use.", "rationale": "Successful encoding must not be mistaken for adequate protection of confidential information.", "layers": [ { "id": "observable-patterns", "name": "Observable patterns", "description": "Records information retained by the substitution and character-handling policy.", "findings": [ { "id": "pattern-preservation", "name": "Pattern preservation", "description": "Within each shifted alphabet, the substitution preserves symbol-frequency counts up to relabelling and repeated-symbol patterns; preserved separators also expose text structure.", "questions": [ { "text": "Which repeated-symbol patterns, frequency counts and separators remain observable after transformation?", "kind": "measurement", "id": "pattern-preservation-q01" }, { "text": "How many distinct shift mappings must be tried for the declared alphabet?", "kind": "measurement", "id": "pattern-preservation-q02" } ] } ] }, { "id": "fitness-for-intent", "name": "Fitness for intent", "description": "Determines whether to apply the cipher or direct the task to another mechanism.", "findings": [ { "id": "concealment-versus-confidentiality", "name": "Concealment and confidentiality requirements", "description": "A Caesar cipher can serve teaching, puzzles and reversible obfuscation, but its small enumerable shift space makes it unsuitable for modern confidentiality requirements.", "questions": [ { "text": "Is the requested outcome demonstration, puzzle solving, casual concealment or protection against an adversary?", "kind": "boundary", "id": "concealment-versus-confidentiality-q01" }, { "text": "Should the agent perform the declared transformation or route a confidentiality requirement to a suitable encryption model?", "kind": "action", "id": "concealment-versus-confidentiality-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-kinds", "name": "Kinds and varieties", "description": "Reported by the breadth pass; each item needs checking against its source before it becomes normative.", "evidence": [ "Classical Caesar (k = 3 on the Latin alphabet, the form Suetonius attributes to Julius Caesar)", "Augustan shift (k = 1, the form Suetonius attributes to Augustus)", "General shift/additive cipher (arbitrary k, usually 1-25 on a 26-letter alphabet)", "ROT13 (k = 13 on 26 letters; an involution, widely used as a distinct named convention)", "ROT5 / ROT18 / ROT47 (digit-only, alphanumeric, and printable-ASCII shift variants used in puzzles and light obfuscation)", "Non-Latin modular Caesar (same additive rule on other cyclic alphabets, e.g. 32- or 33-letter Cyrillic)" ], "questions": [ { "id": "evidence-kinds-q01", "text": "Which of these kinds and varieties hold for the sense of Caesar cipher this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-identifiers", "name": "Identifiers and schemes", "description": "Reported by the breadth pass; each item needs checking against its source before it becomes normative.", "evidence": [ { "scheme": "Wikidata item", "value_or_pattern": "Q190234", "note": "Item for the Caesar cipher as a cipher type." }, { "scheme": "Wikidata item", "value_or_pattern": "Q541169", "note": "Item for ROT13, the k = 13 special case treated as a named convention of its own." } ], "questions": [ { "id": "evidence-identifiers-q01", "text": "Which of these identifiers and schemes hold for the sense of Caesar cipher this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-standards-and-regulation", "name": "Standards and regulation", "description": "Reported by the breadth pass; each item needs checking against its source before it becomes normative.", "evidence": [ "Not an approved cryptographic algorithm under NIST FIPS 140-3 or in the NSA Commercial National Security Algorithm (CNSA) suite; those regimes require modern, specified primitives rather than classical shifts.", "Taught as an insecure classical cipher in several national secondary-computing specifications (notably UK GCSE Computer Science papers such as OCR and AQA), which is curricular description, not an operational crypto standard.", "ROT13 is a community convention of Netnews/Usenet and later forums for hiding spoilers, not a standardised encryption algorithm in the IETF sense." ], "questions": [ { "id": "evidence-standards-and-regulation-q01", "text": "Which of these standards and regulation hold for the sense of Caesar cipher this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-real-world-use", "name": "Real-world use", "description": "Reported by the breadth pass; each item needs checking against its source before it becomes normative.", "evidence": [ "Classroom and textbook introduction to substitution, modular arithmetic, and why key space and frequency statistics matter.", "ROT13 (and ROT47) to hide spoilers, punchlines, and puzzle solutions on Usenet, mailing lists, and forums.", "Puzzle hunts, escape rooms, geocaching listings, and CTF warm-up challenges.", "Toy or legacy obfuscation in source comments and config values; not relied on for actual secrecy.", "Historical reconstruction of Roman military correspondence as reported by Suetonius, not as a living field cipher." ], "questions": [ { "id": "evidence-real-world-use-q01", "text": "Which of these real-world use hold for the sense of Caesar cipher this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-measurements", "name": "Typical measurements", "description": "Reported by the breadth pass; each item needs checking against its source before it becomes normative.", "evidence": [ { "quantity": "Shift key k", "typical_range": "0-25 (often 1-25; 0 is the identity)", "unit": "alphabet positions" }, { "quantity": "Alphabet size n", "typical_range": "26 for English Latin; 27 if Ñ is included; ~32-33 for Russian Cyrillic", "unit": "letters" }, { "quantity": "Keyspace size", "typical_range": "n distinct shifts, n−1 non-trivial", "unit": "keys" }, { "quantity": "Nominal key entropy (English 26-letter case)", "typical_range": "about 4.7", "unit": "bits" }, { "quantity": "Trials for exhaustive search", "typical_range": "25 for a 26-letter alphabet", "unit": "decryptions" } ], "questions": [ { "id": "evidence-measurements-q01", "text": "Which of these typical measurements hold for the sense of Caesar cipher this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-failure-modes-and-hazards", "name": "Failure modes and hazards", "description": "Reported by the breadth pass; each item needs checking against its source before it becomes normative.", "evidence": [ "Exhaustive search over 25 keys recovers English plaintext immediately.", "Letter-frequency analysis identifies k because each plaintext letter has a single ciphertext image.", "A single known plaintext-ciphertext letter pair determines k.", "Using it as if it provided confidentiality (passwords, exam answers, 'encrypted' backups) yields a false sense of security.", "Implementations disagree on case, diacritics, digits, and whether non-letters are passed through, so interoperable decrypt often fails.", "Ciphertext is malleably additive: an attacker who knows the scheme can apply a further shift without the key." ], "questions": [ { "id": "evidence-failure-modes-and-hazards-q01", "text": "Which of these failure modes and hazards hold for the sense of Caesar cipher this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-regional-variation", "name": "Regional variation", "description": "Reported by the breadth pass; each item needs checking against its source before it becomes normative.", "evidence": [ "English usage splits between 'Caesar cipher' for any constant shift and a stricter use that reserves 'Caesar' for k = 3 and calls the rest a shift cipher.", "French chiffre de César, German Cäsar-Chiffre / Cäsar-Verschlüsselung, and Russian шифр Цезаря are the ordinary textbook names.", "ROT13 is a named everyday practice mainly in English-language internet culture; it is less often treated as a separate object in non-English school syllabi.", "Alphabet size and wrap-around follow the local orthographic alphabet, so a 'Caesar' tool built for A-Z mis-handles Ñ, Ä/Ö/Ü, or Cyrillic unless n is changed." ], "questions": [ { "id": "evidence-regional-variation-q01", "text": "Which of these regional variation hold for the sense of Caesar cipher this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-neighbours", "name": "Neighbouring kinds and how to tell them apart", "description": "Reported by the breadth pass; each item needs checking against its source before it becomes normative.", "evidence": [ { "name": "Vigenère cipher", "difference": "Vigenère applies a repeating sequence of Caesar shifts keyed by a word, so the same plaintext letter can map to different ciphertext letters; a true Caesar map is one shift for the whole text." }, { "name": "Affine cipher", "difference": "Affine encryption is c ≡ ap + b (mod n) with gcd(a, n) = 1; Caesar is the special case a = 1. Presence of a multiplier other than 1 separates them." }, { "name": "Atbash", "difference": "Atbash reflects the alphabet (A↔Z, B↔Y, …), which is not a rotation; the mapping is an involution whose pairs sit at complementary positions, not a constant offset." }, { "name": "General monoalphabetic substitution", "difference": "A mixed-alphabet cipher uses an arbitrary permutation of the alphabet. Caesar is only the n rotations; if the permutation is not a cyclic shift, it is not Caesar." }, { "name": "Transposition ciphers (e.g. rail fence, columnar)", "difference": "Those rearrange letter order and leave the letters themselves unchanged; Caesar changes identities and leaves order unchanged." } ], "questions": [ { "id": "evidence-neighbours-q01", "text": "Which of these neighbouring kinds and how to tell them apart hold for the sense of Caesar cipher this model covers, and on what evidence?", "kind": "provenance" } ] } ] } ] } ] }, "openQuestions": [ "Should the registry explicitly include Caesar rotations over arbitrary finite ordered symbol sets, or reserve the unqualified name for conventional letter alphabets?", "Should zero-shift identity configurations be recognized as degenerate Caesar ciphers or recorded as outside the registry entry's accepted boundary?", "Which case and normalization conventions should the model recognize as named profiles, and which must always be specified explicitly?", "What evidence standard should distinguish a plausible Caesar decoding from a confirmed identification when only a short ciphertext is available?" ], "statistics": { "bundles": 6, "layers": 11, "findings": 18, "questions": 28 } }, "draft": { "generator": "vr.draft.v3", "status": "draft-generated", "researched": false, "archetype": "work, medium or creative form", "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 Caesar cipher, record what state it is in, and decide what may be done with it.", "whatItIs": "Enable an agent to recognise a Caesar cipher, determine whether its alphabet and shift are sufficiently specified, and choose valid transformation, recovery or replacement actions.", "characteristics": { "substance": "information", "origin": "conceptual", "agency": "inert" }, "whatYouCanDoWithIt": [ "read and interpreted", "observed and measured" ], "distinguishingFeatures": [ "Names folded into this entry, which a task may need to split apart again: ROT13.", "1 finer distinctions are held as aliases rather than separate entries, because telling them apart needs a task that asks for it.", "Described in 61 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 Caesar cipher, and on what evidence are they told apart?" ], "whatItIsMadeOf": "content that has to be carried by something else", "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": [ "read it and act on what it says", "observe it, measure it, record its state" ], "howItIsRecognised": [ "What is seen is a copy or a performance, not the work. Recognising the work means recognising the content through whatever is carrying it." ], "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": [ "ROT13" ] } ], "standing": "Described in 61 Wikipedia languages, which measures how widely it is written about rather than how important or how common it is. 1 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 Caesar cipher from another, and a Caesar cipher 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 Caesar cipher, 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 Caesar cipher, 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 Caesar cipher 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 Caesar cipher, 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 Caesar cipher, 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 Caesar cipher 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 Caesar cipher 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 Caesar cipher, 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 Caesar cipher, 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 Caesar cipher 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 Caesar cipher from the things most often confused with it.", "questions": [ { "id": "distinguishing-features-q01", "text": "What identifies and describes what distinguishes a Caesar cipher, 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 Caesar cipher, 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 Caesar cipher 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 Caesar cipher 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 Caesar cipher between them.", "questions": [ { "id": "stages-and-transitions-q01", "text": "What identifies and describes the lifecycle of a Caesar cipher, 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 Caesar cipher, 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 Caesar cipher 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 Caesar cipher, how often and by whom.", "findings": [ { "id": "observation-record", "name": "Observation record", "description": "How an observation of a Caesar cipher 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 Caesar cipher, 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 Caesar cipher, 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 Caesar cipher is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] } ] } ] }, { "id": "content-and-access", "name": "Content, encoding and access", "description": "What a Caesar cipher says, how it is encoded and who may read it.", "rationale": "An informational thing carries content that can be copied, versioned and withheld, none of which its physical carrier explains.", "layers": [ { "id": "content-and-encoding", "name": "Content and encoding", "description": "The content itself, its format and its language.", "findings": [ { "id": "content-and-format", "name": "Content, format and language", "description": "What a Caesar cipher contains and in what form it is held.", "questions": [ { "id": "content-and-format-q01", "text": "What identifies and describes the content of a Caesar cipher, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "content-and-format-q02", "text": "Who or what asserted this about the content of a Caesar cipher, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "content-and-format-q03", "text": "What may an agent decide or do once the content of a Caesar cipher is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] } ] }, { "id": "access-and-rights", "name": "Access, rights and retention", "description": "Who may read, copy or change it, and for how long it is kept.", "findings": [ { "id": "access-rules", "name": "Access rules and retention", "description": "The permissions attached to a Caesar cipher and the period it survives.", "questions": [ { "id": "access-rules-q01", "text": "What identifies and describes access to a Caesar cipher, and in what units or vocabulary?", "kind": "definition", "answer_data": [ "identifiers", "types and classes", "values with units", "explicit unknowns" ] }, { "id": "access-rules-q02", "text": "Who or what asserted this about access to a Caesar cipher, by which method, and when was it true?", "kind": "provenance", "answer_data": [ "authority", "method", "evidence", "event time", "knowledge time" ] }, { "id": "access-rules-q03", "text": "What may an agent decide or do once access to a Caesar cipher is known, and what must it refuse?", "kind": "action", "answer_data": [ "permitted actions", "preconditions", "refusals", "escalation" ] } ] } ] } ] }, { "id": "work-and-manifestation", "name": "Work, version and copy", "description": "Which level of Caesar cipher a statement is about.", "rationale": "The work, the edition, the file and the copy in hand are four things; rights and content attach to different ones.", "layers": [ { "id": "levels", "name": "Levels of the thing", "description": "Work, expression, manifestation and item, in plain terms.", "findings": [ { "id": "level-rules", "name": "What belongs at each level", "description": "Which facts hold for the work and which only for one copy.", "questions": [ { "id": "level-rules-q01", "text": "For Caesar cipher, which facts belong to the work itself, which to a version, and which to a single copy?", "kind": "boundary" }, { "id": "level-rules-q02", "text": "What identifier exists at each level, and which one is being cited?", "kind": "definition" } ] } ] }, { "id": "versions", "name": "Versions, editions and variants", "description": "How versions differ and which is canonical to whom.", "findings": [ { "id": "version-record", "name": "Versions and canonicity", "description": "Differences that matter and who calls one authoritative.", "questions": [ { "id": "version-record-q01", "text": "Which versions or editions of Caesar cipher exist, and how do they differ substantively?", "kind": "definition" }, { "id": "version-record-q02", "text": "Who treats which version as authoritative, and for what purpose?", "kind": "provenance" } ] } ] } ] }, { "id": "authorship-and-rights", "name": "Authorship, rights and permitted use", "description": "Who made Caesar cipher and what may be done with it.", "rationale": "Rights are jurisdictional, time-limited and attached to a level, and an agent that ignores that will copy what it may not.", "layers": [ { "id": "authorship", "name": "Authorship and contribution", "description": "Who contributed what, and in what capacity.", "findings": [ { "id": "contribution-record", "name": "Contributors and roles", "description": "The people and bodies behind it, with their roles.", "questions": [ { "id": "contribution-record-q01", "text": "Who authored or contributed to Caesar cipher, in what roles, and how is that attested?", "kind": "provenance" }, { "id": "contribution-record-q02", "text": "Where authorship is disputed or anonymous, what is recorded instead?", "kind": "boundary" } ] } ] }, { "id": "rights", "name": "Rights and permissions", "description": "Which rights subsist, where, until when, and what they permit.", "findings": [ { "id": "rights-record", "name": "Rights, term and permitted acts", "description": "The regime in force and what it allows.", "questions": [ { "id": "rights-record-q01", "text": "What rights subsist in Caesar cipher, in which jurisdictions, and until when?", "kind": "definition" }, { "id": "rights-record-q02", "text": "Which acts are permitted without further permission, and which must an agent refuse?", "kind": "action" } ] } ] } ] }, { "id": "provenance-and-evidence", "name": "Provenance, evidence and time", "description": "Where every claim about a Caesar cipher 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 Caesar cipher and how confident it is.", "questions": [ { "id": "claim-provenance-q01", "text": "What identifies and describes a claim about a Caesar cipher, 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 Caesar cipher, 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 Caesar cipher 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 Caesar cipher is retired without being erased.", "questions": [ { "id": "validity-and-supersession-q01", "text": "What identifies and describes the validity of a claim about a Caesar cipher, 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 Caesar cipher, 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 Caesar cipher 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 } } } }