{
  "id": "20261109-0002",
  "version": "v1",
  "title": "Counting in Token Space: Finite Witnesses, Linear Tests and Regular Heaps",
  "authors": [
    {
      "name": "Wuming Pan",
      "affiliation": "Sichuan University"
    }
  ],
  "date": "2026-11-09",
  "type": "Research paper",
  "pages": 17,
  "subjects": [
    "Token Space",
    "Homomorphism counts",
    "Finite witnesses",
    "Regular languages"
  ],
  "summary": "Quantitative witness bounds for homomorphism tests, exact six-letter classifications, and state-resource bounds for regular heaps.",
  "abstract": "Token Space is a categorical framework motivated by the structural understanding of large language models and the development of related computational mechanisms. We study restricted homomorphism counts and witness resources. For core-free r-ary targets on n letters, a decoder gives the linear-test bound n + (r - 1) max(t, t′) ≤ rn, where t and t′ count twin classes; linear tests forbid repeated letters within records. Qualitative completeness follows from existing weighted-graph and simple-#CSP theorems; our contribution is the source-variable bound for Boolean relations. Standard directed cycles give linear growth of the binary witness bound. An exact search over 113,230 six-letter types finds two complement pairs agreeing on all five-letter linear tests but separated by one six-letter oriented path, proving a lower bound of six, not the exact unrestricted value. Complementation extends the classification to a specified 130,164-type family. Exact integer GPU computations are independently checked on CPU. For arbitrary heaps, finite witnesses use at most n letters and n! records; automata with m and m′ states give record length below mm′. For induced counting on regular heaps, the exact test-state threshold is m. A one-pattern reconstruction guarantee and classical Möbius inversion organize further observations. Potential uses for LLM-expressed relations require a suitable observation interface; no LLM application effects are established here.",
  "release_note": "Initial public release of manuscript V13 dated 8 November 2026. Repository imprint and an arXiv hyperlink have been added; mathematical claims, tables and numerical conclusions are unchanged.",
  "provenance": "AI-assisted preparation of the publication copy and source archive. The author remains responsible for the content. This deposit does not assert completed peer review.",
  "verification": "The source archive includes the finite checks, exact representatives, collision certificates, original and rerun results, timing records, and CPU/GPU verification programs described in the paper. The printed-claims check was rerun during publication preparation. The scientific GPU experiment was not rerun for this deposit; its stated scope and limitations remain unchanged.",
  "related": "20261109-0001",
  "namespace": "core",
  "number": 5,
  "identifier_profile": "1.1",
  "registration_date": "2026-11-09",
  "sequence": 2,
  "key": "core/20261109-0002",
  "schemaVersion": "1.0",
  "pid": "1id1:core:20261109-0002",
  "version_pid": "1id1:core:20261109-0002@v1",
  "url": "https://1id1.net/id/core/20261109-0002/",
  "version_url": "https://1id1.net/id/core/20261109-0002/v1/",
  "language": "en",
  "status": "preprint",
  "rights": "Copyright retained by the author. No additional reuse licence specified.",
  "relations": [
    {
      "predicate": "relatedTo",
      "target": "1id1:core:20261109-0001"
    }
  ],
  "externalIdentifiers": [],
  "files": [
    {
      "name": "paper.pdf",
      "url": "https://1id1.net/records/core/20261109-0002/v1/paper.pdf",
      "media_type": "application/pdf",
      "bytes": 449389,
      "sha256": "a35bcb4d553c6aff012e34f78c7054363860db4b6ba376a80189e9e72d07ec4e"
    },
    {
      "name": "source.zip",
      "url": "https://1id1.net/records/core/20261109-0002/v1/source.zip",
      "media_type": "application/zip",
      "bytes": 858544,
      "sha256": "37fe3d02a2463c060360b310dc0564162ecfde5a70f9a93576b032e5d20cfdad"
    }
  ]
}
