{
  "id": "20261109-0001",
  "version": "v1",
  "title": "Token Linkages: Effective Realizability and Decision Boundaries",
  "authors": [
    {
      "name": "Wuming Pan",
      "affiliation": "Sichuan University"
    }
  ],
  "date": "2026-11-09",
  "type": "Research paper",
  "pages": 15,
  "subjects": [
    "Token Space",
    "Tree automata",
    "Tree relations",
    "Decidability"
  ],
  "summary": "An effective realizability test and least tile bound for recognizable Token linkages, with EXPTIME-complete tree-behavior equivalence and an undecidable yield boundary.",
  "abstract": "Token linkages use structural witnesses and two original heap-preserving tree Token maps. For finite ranked signatures, their recognizable behaviors admit an effective characterization: a convolution-recognizable relation is realizable exactly when it has no root core obstruction and its language of canonically forced leaf tiles is finite. A four-state annotation of the relation automaton constructs this language. With fixed maximum rank, realizability and the least uniform tile-size bound are computable in polynomial time; constructing a full realization need not have polynomial output size. The canonical decomposition requires a core check before descending through matching constructors. We retain recognizable pullback composition, EXPTIME-complete equivalence of explicit linkage presentations, and undecidable equivalence after yield. Context can be internalized, while weighted behavior records witness multiplicity. Comparisons with established tree-relation classes locate the constructor-fixing fragment without claiming a new general transducer formalism. Node-size bounds permit shorter tree outputs but limit unbounded contraction in a fixed finite presentation.",
  "release_note": "Initial public release of manuscript V7. Repository imprint and public-version references have been added; mathematical statements, proofs and recorded verification results 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 contains five finite verification programs and recorded passing results. The effective-cut checks include 6,400 tree-pair comparisons and exact finite and infinite automaton cases. Bounded checks supplement the proofs; they do not establish general complexity or undecidability.",
  "related": "20261109-0002",
  "namespace": "core",
  "number": 4,
  "identifier_profile": "1.1",
  "registration_date": "2026-11-09",
  "sequence": 1,
  "key": "core/20261109-0001",
  "schemaVersion": "1.0",
  "pid": "1id1:core:20261109-0001",
  "version_pid": "1id1:core:20261109-0001@v1",
  "url": "https://1id1.net/id/core/20261109-0001/",
  "version_url": "https://1id1.net/id/core/20261109-0001/v1/",
  "language": "en",
  "status": "preprint",
  "rights": "Copyright retained by the author. No additional reuse licence specified.",
  "relations": [
    {
      "predicate": "relatedTo",
      "target": "1id1:core:20261109-0002"
    }
  ],
  "externalIdentifiers": [],
  "files": [
    {
      "name": "paper.pdf",
      "url": "https://1id1.net/records/core/20261109-0001/v1/paper.pdf",
      "media_type": "application/pdf",
      "bytes": 519112,
      "sha256": "f1869a2a902827dc5a7461c117104265a5581dfd1d16c4f972e9ab53e5f0be1b"
    },
    {
      "name": "source.zip",
      "url": "https://1id1.net/records/core/20261109-0001/v1/source.zip",
      "media_type": "application/zip",
      "bytes": 41281,
      "sha256": "0dc3ffc4612aba70b38404ab7522081d37c972c3718fcd80a38d45d6081f3d11"
    }
  ]
}
