{
  "schemaVersion": "1.6",
  "slug": "unbounded-bns-component-orbits",
  "title": "A linearly growing free-by-cyclic family with unbounded BNS component-orbit count",
  "shortTitle": "Unbounded BNS component orbits",
  "url": "https://evidencepress.org/releases/unbounded-bns-component-orbits/",
  "oneLine": "For every m>=2, an explicit linearly growing free-by-cyclic group has first Betti number m+2, exactly 2m+2 BNS components, and at least m+1 component orbits under its outer automorphism group.",
  "abstract": "For every integer m>=2, this anonymous, unrefereed theorem candidate constructs an explicit linearly growing automorphism of F_(2m+1) whose mapping torus G_m has first Betti number m+2. Cashen and Levitt's graph-of-groups criterion identifies its Bieri-Neumann-Strebel invariant as the complement of the m+1 rational hyperplanes x+i y=0 for 0<=i<=m, giving exactly 2m+2 connected components. A direct Bass-Serre calculation gives rank ker chi = 1+m|x|+sum_(i=1)^m |x+i y| for primitive integral BNS characters. The minimum kernel ranks on the outer antipodal component pair and the m interior antipodal pairs are respectively 1+2m and 1+m(m+1)+2j^2 for 0<=j<m. These m+1 values are distinct and invariant under group automorphisms, so the action of Out(G_m) has at least m+1 component orbits. This supplies the requested unbounded family if the candidate proof is correct. It does not compute Out(G_m), determine the exact orbit count, establish historical priority, or provide external validation. Exact producer replay for 2<=m<=8, eight negative controls, internal review and public immutable assets support the candidate without replacing the universal written proof or the imported Cashen-Levitt theorem.",
  "datePublished": "2026-08-31",
  "dateModified": "2026-08-31",
  "version": "0.2.0-candidate",
  "doi": "10.5281/zenodo.22201487",
  "doiUrl": "https://doi.org/10.5281/zenodo.22201487",
  "conceptDoi": "10.5281/zenodo.22201484",
  "pdfUrl": "https://github.com/ipitchford/unbounded-bns-component-orbits/releases/download/v0.2.0-candidate/paper.pdf",
  "altPdfUrl": "https://zenodo.org/records/22201487/files/paper.pdf?download=1",
  "altPdfLabel": null,
  "zenodoUrl": "https://zenodo.org/records/22201487",
  "repoUrl": "https://github.com/ipitchford/unbounded-bns-component-orbits",
  "releaseUrl": "https://github.com/ipitchford/unbounded-bns-component-orbits/releases/tag/v0.2.0-candidate",
  "markdownUrl": "https://evidencepress.org/releases/unbounded-bns-component-orbits/index.md",
  "bibtexUrl": "https://evidencepress.org/releases/unbounded-bns-component-orbits/cite.bib",
  "audioUrl": "https://evidencepress.org/assets/audio/unbounded-bns-component-orbits.mp3?v=8d59dae59f",
  "imageUrl": "https://evidencepress.org/assets/og/unbounded-bns-component-orbits.png?v=71d50453fe",
  "coverArtUrl": "https://evidencepress.org/assets/art/unbounded-bns-component-orbits.svg?v=e7bb1ac575",
  "media": [
    {
      "type": "audio",
      "url": "https://evidencepress.org/assets/audio/unbounded-bns-component-orbits.mp3",
      "name": "Audio briefing — unbounded BNS component orbits",
      "description": "Plain-English synthetic-voice account of the explicit family, exact component count, componentwise kernel-rank invariant, orbit lower bound and assurance limits; a communication aid, not additional evidence.",
      "transcriptUrl": "https://evidencepress.org/assets/audio/unbounded-bns-component-orbits.txt"
    }
  ],
  "authors": [
    "Anonymous"
  ],
  "license": "CC0-1.0",
  "status": "unrefereed-candidate",
  "verification": {
    "peerReviewed": false,
    "independentlyReproduced": false,
    "formallyVerified": false,
    "internallyReplayed": true,
    "detail": "Anonymous, AI-assisted, unrefereed geometric-group-theory theorem candidate at PASS_WITH_NOTES after actioning a supplied full review and completing one bounded producer-coordinated confirmation. Reviewer identity, specialist credentials and unaffiliated status were not authenticated. The BNS identification imports Cashen-Levitt Corollary 2.10, finite replay is corroborative only, and no exact orbit-count, first-discovery or historical-priority claim is made. The Traditional Chinese abstract's formulas were checked, but its linguistic quality was not independently assessed by a fluent reviewer."
  },
  "assurance": [
    {
      "dimension": "availability",
      "label": "Availability and archiving",
      "question": "Is the evidence package publicly retrievable from an archive under a persistent identifier?",
      "state": "passed",
      "evidenceUrl": "https://zenodo.org/records/22201487",
      "note": "The tagged GitHub prerelease and published Zenodo record expose the DOI-bearing PDF, all-files ZIP and manifest; every asset was independently downloaded from both services and matched the local SHA-256 value."
    },
    {
      "dimension": "internalReplay",
      "label": "Internal replay",
      "question": "Does the producer’s own pipeline reproduce the stated result from the archived package?",
      "state": "passed",
      "note": "Public Linux CI runs the exact Python verifier normally and with optimization, rejects all eight certificate and claim-boundary mutations, runs the language-separated JavaScript reconstruction, and checks source parity, PDF structure and package integrity.",
      "evidenceUrl": "https://github.com/ipitchford/unbounded-bns-component-orbits/actions/runs/33374136735"
    },
    {
      "dimension": "independentRerun",
      "label": "Independent rerun",
      "question": "Has someone else run the supplied implementation and obtained the stated result?",
      "state": "not-assessed",
      "note": "No authenticated unaffiliated clean-environment rerun is reported."
    },
    {
      "dimension": "independentReimplementation",
      "label": "Independent reimplementation",
      "question": "Has someone else reached the result from an independent implementation?",
      "state": "not-assessed",
      "note": "The Python and JavaScript implementations were produced within one coordinated workflow and are not independent implementations in the assurance sense."
    },
    {
      "dimension": "formalVerification",
      "label": "Formal verification",
      "question": "Is a formalised statement machine-checked, and over which trusted base?",
      "state": "not-assessed",
      "note": "No proof assistant formalizes the graph-map equivalence, Cashen-Levitt applicability, Bass-Serre kernel-rank calculation, chamber minimization or outer-orbit obstruction."
    },
    {
      "dimension": "specialistReview",
      "label": "Specialist review",
      "question": "Has a domain specialist assessed the argument?",
      "state": "not-assessed",
      "note": "The supplied review and internal role reports are not authenticated unaffiliated review by a geometric group theory or BNS specialist."
    },
    {
      "dimension": "editorialPeerReview",
      "label": "Editorial peer review",
      "question": "Has a journal or venue run peer review to a decision?",
      "state": "not-assessed",
      "note": "No journal or comparable external venue has conducted editorial peer review."
    },
    {
      "dimension": "dataEnvironmentReproducibility",
      "label": "Data and environment reproducibility",
      "question": "Are data and computational environment pinned well enough to rebuild?",
      "state": "partial",
      "evidenceUrl": "https://github.com/ipitchford/unbounded-bns-component-orbits/blob/v0.2.0-candidate/ENVIRONMENT.txt",
      "note": "Commands, declared runtime versions, exact certificates, manifests and public Linux replay are available, but no bit-reproducible system image or authenticated unaffiliated reconstruction is supplied."
    }
  ],
  "provenance": {
    "aiGenerated": true,
    "aiAssisted": true,
    "generatedBy": [
      "AI systems under human direction",
      "OpenAI Codex",
      "Python 3 standard library",
      "Node.js standard library"
    ],
    "humanRole": "Research direction, candidate selection, review provision, claim-boundary decisions, publication authorization and institutional responsibility by the human creator; repository maintenance and Evidence Press publication are not scholarly authorship, and scholarly attribution remains Anonymous.",
    "disclosure": "AI systems contributed candidate discovery, symbolic derivation, proof drafting, software implementation, source and novelty triage, review remediation, editing, replay and release engineering within one producer-coordinated workflow. Same-producer cross-language agreement, the supplied review and role-separated internal review do not establish unaffiliated reconstruction, authenticated specialist review or editorial peer review."
  },
  "attributionBoundary": null,
  "problem": {
    "name": "AIM Problem 6.2: BNS components up to the action of Out(G)",
    "url": "https://web.archive.org/web/20240828224509id_/http://aimpl.org/freebycyclic/6/"
  },
  "orderedProductAverage": null,
  "corrections": [],
  "publicCorrections": [],
  "publicCorrectionIndexes": null,
  "pageStructureVersion": "2.0",
  "pageStructureVariant": "canonical-theorem",
  "pageStructureWaivers": [],
  "recordMaturity": "current",
  "metadataProvenance": "Authored prospectively against the DOI-bearing tagged v0.2.0-candidate, supplied-review response, bounded internal confirmation, public hosted replay and exact GitHub and Zenodo three-asset readback on 31 August 2026. Canonical Evidence Press deployment and later terminal publication metrics are recorded separately and do not promote the mathematical assurance ceiling.",
  "grandfatheredAtSchemaVersion": null,
  "keywords": [
    "free-by-cyclic group",
    "Bieri-Neumann-Strebel invariant",
    "mapping torus",
    "linearly growing automorphism",
    "graph of groups",
    "Bass-Serre theory",
    "kernel rank",
    "outer automorphism",
    "unrefereed candidate"
  ],
  "keyResults": [
    "For every integer m>=2, the stated graph map induces a linearly growing automorphism of F_(2m+1), and its mapping torus G_m has first Betti number m+2.",
    "Conditional on Cashen-Levitt Corollary 2.10, Sigma^1(G_m) is the complement of x+i y=0 for 0<=i<=m and has exactly 2m+2 connected components.",
    "Every primitive integral BNS character has free kernel of rank 1+m|x|+sum_(i=1)^m |x+i y|.",
    "The componentwise minimum kernel ranks are 1+2m for the outer antipodal pair and 1+m(m+1)+2j^2 for the j-th interior antipodal pair, 0<=j<m.",
    "The m+1 distinct minimum values are invariant under Out(G_m), proving at least m+1 component orbits and hence an unbounded orbit-count family."
  ],
  "reviews": [],
  "evidencePackage": "A twelve-page DOI-bearing bilingual manuscript and aligned Markdown; a compact proof certificate; a complete written universal argument; the explicitly cited Cashen-Levitt structural dependency; dependency-free Python exact replay in normal and optimized modes; a same-producer language-separated JavaScript reconstruction; exact graph, abelianization, edge-form and chamber-minimum checks for 2<=m<=8; eight certificate and claim-boundary negative controls, including rejection of an exact-orbit overclaim; claim, source-correspondence, citation and bounded novelty audits; an inherited producer-coordinated five-role internal editorial record, one supplied full review and one bounded focused confirmation; a 64-member all-files ZIP containing 63 manifested payloads plus its root manifest; public GitHub Actions replay; and exact GitHub and Zenodo asset readback. These establish public availability, integrity, producer replay and the stated unrefereed theorem candidate. They do not establish the exact Out(G_m)-orbit count, historical priority, unaffiliated reconstruction, formal verification, authenticated external specialist review, editorial peer review or impact.",
  "openProblems": [
    "Compute Out(G_m) or otherwise determine the exact number of its orbits on the 2m+2 BNS components; the present theorem proves only a lower bound of m+1.",
    "Determine whether the two components in each antipodal pair lie in one orbit, two orbits, or a pattern depending on m.",
    "Independently reconstruct the graph-of-groups presentation, verify the hypotheses of Cashen-Levitt Corollary 2.10 and rederive the kernel-rank minima in a materially separate stack.",
    "Formalize the graph map, BNS dependency interface, Bass-Serre calculation and integer chamber minimization in a proof assistant.",
    "Classify broader linearly or polynomially growing free-by-cyclic families with unbounded BNS component-orbit count and obtain authenticated specialist and historical-priority assessments."
  ],
  "mathObjects": [],
  "relatedWorks": [
    {
      "citation": "American Institute of Mathematics. Rigidity properties of free-by-cyclic groups, BNS invariants, Problem 6.2. Archived 28 August 2024.",
      "url": "https://web.archive.org/web/20240828224509id_/http://aimpl.org/freebycyclic/6/",
      "doi": null
    },
    {
      "citation": "Cashen, C. H., & Levitt, G. (2016). Mapping tori of free group automorphisms, and the Bieri-Neumann-Strebel invariant of graphs of groups. Journal of Group Theory 19, 191-216.",
      "url": "https://doi.org/10.1515/jgth-2015-0038",
      "doi": "10.1515/jgth-2015-0038"
    },
    {
      "citation": "Bieri, R., Neumann, W. D., & Strebel, R. (1987). A geometric invariant of discrete groups. Inventiones Mathematicae 90, 451-477.",
      "url": "https://doi.org/10.1007/BF01389175",
      "doi": "10.1007/BF01389175"
    },
    {
      "citation": "Funke, F., & Kielak, D. (2018). Alexander and Thurston norms, and the Bieri-Neumann-Strebel invariants for free-by-cyclic groups. Geometry & Topology 22, 2647-2696.",
      "url": "https://doi.org/10.2140/gt.2018.22.2647",
      "doi": "10.2140/gt.2018.22.2647"
    },
    {
      "citation": "Kielak, D. (2020). The Bieri-Neumann-Strebel invariants via Newton polytopes. Inventiones Mathematicae 219, 1009-1068.",
      "url": "https://doi.org/10.1007/s00222-019-00919-9",
      "doi": "10.1007/s00222-019-00919-9"
    },
    {
      "citation": "Andrew, N., & Martino, A. (2022). Free-by-cyclic groups, automorphisms and actions on nearly canonical trees. Journal of Algebra 604, 451-495.",
      "url": "https://doi.org/10.1016/j.jalgebra.2022.03.033",
      "doi": "10.1016/j.jalgebra.2022.03.033"
    },
    {
      "citation": "Jaikin-Zapirain, A., Kudlinska, M., & Sánchez-Peralta, P. (2026). Thurston norm, polytopes and splitting complexity. arXiv:2606.31774v1.",
      "url": "https://arxiv.org/abs/2606.31774v1",
      "doi": "10.48550/arXiv.2606.31774"
    },
    {
      "citation": "Mutanguha, J. P. (2024). On polynomial free-by-cyclic groups. arXiv:2412.16150v1.",
      "url": "https://arxiv.org/abs/2412.16150v1",
      "doi": "10.48550/arXiv.2412.16150"
    }
  ],
  "claimAssurance": null,
  "operatingModel": {
    "version": "1.0",
    "workId": "ep-work:unbounded-bns-component-orbits",
    "attemptIds": [
      "ep-attempt:unbounded-bns-component-orbits-publication"
    ],
    "aims": [
      "science"
    ],
    "artifactRoles": [
      "research-output",
      "evidence-assessment",
      "method-demonstration",
      "communication"
    ],
    "lineageId": null,
    "accelerationPrimitives": [
      "certificate-first",
      "structural-compression",
      "adversarial-controls",
      "assurance-vector",
      "agent-readable-research-object"
    ],
    "decisionObject": {
      "type": "bound",
      "description": "An explicit linearly growing free-by-cyclic family with exactly 2m+2 BNS components and an automorphism-invariant sequence of componentwise minimum kernel ranks proving at least m+1 Out(G_m)-orbits.",
      "scope": "The groups G_m defined by the weighted-chord graph maps for m>=2, the BNS description conditional on Cashen-Levitt Corollary 2.10, and the lower bound of m+1 component orbits; not an exact orbit count, a computation of Out(G_m), a classification of free-by-cyclic BNS invariants, a historical-priority finding or external validation."
    },
    "bottleneckTargeted": [
      "assurance",
      "publication",
      "translation"
    ],
    "semanticBridge": {
      "state": "explicit",
      "description": "The package records the archived AIM request, the exact Cashen-Levitt dependency, the weighted-chord graph map and graph-of-groups presentation, the character coordinates, the edge forms x+i y, the direct Bass-Serre kernel-rank formula, the integer chamber minima and replay predicates. This exposes every transition from the problem wording to the orbit lower bound.",
      "remainingRisks": [
        "A producer-side mistake in the graph-of-groups conventions or in checking the hypotheses of Cashen-Levitt Corollary 2.10 could propagate through the proof and replay.",
        "The Python and JavaScript checks share the same producer-defined certificate and do not independently validate the universal argument.",
        "The component invariant separates m+1 classes but does not determine whether equal-minimum components lie in the same Out(G_m)-orbit.",
        "The bounded novelty search cannot establish historical priority."
      ]
    },
    "humanJudgmentGates": [
      "Keep the exact 2m+2 component count separate from the at-least-m+1 orbit count.",
      "Do not infer that each antipodal component pair is one Out(G_m)-orbit.",
      "Inspect the hypotheses and application of Cashen-Levitt Corollary 2.10 rather than treating the edge-form computation as self-sufficient.",
      "Treat replay for 2<=m<=8 as regression evidence for the formulas, not as proof of the universal theorem.",
      "Keep same-producer cross-language corroboration, internal editorial review, unaffiliated reconstruction, formal verification and peer review distinct.",
      "Make no first-discovery or historical-priority claim from a bounded search."
    ],
    "parentLinks": [
      {
        "relation": "depends-on-claim",
        "workId": null,
        "legacyReleaseSlug": null,
        "externalUrl": "https://web.archive.org/web/20240828224509id_/http://aimpl.org/freebycyclic/6/",
        "inheritedClaim": "AIM Problem 6.2 asks for free-by-cyclic families with b1 greater than two and many BNS components up to the action of Out(G).",
        "inheritedAssuranceCeiling": "The archived page fixes the existence request and wording but does not establish this construction, its correctness, novelty, priority or exact orbit count."
      },
      {
        "relation": "extends-result",
        "workId": null,
        "legacyReleaseSlug": null,
        "externalUrl": "https://doi.org/10.1515/jgth-2015-0038",
        "inheritedClaim": "Cashen and Levitt provide the graph-of-groups BNS criterion used here, a linearly growing circle-of-tori family with many excluded subspheres, and a general fiber-rank formula.",
        "inheritedAssuranceCeiling": "Their work supplies the structural criterion and closest located architecture, but not the present weighted-chord family, displayed chamber-minimum sequence or claimed m+1 orbit lower bound."
      }
    ],
    "assuranceTarget": {
      "dimensions": [
        "independentRerun",
        "independentReimplementation",
        "formalVerification",
        "specialistReview",
        "dataEnvironmentReproducibility",
        "semanticValidation",
        "noveltyAssessment",
        "priorityAssessment"
      ],
      "nextAction": "Obtain an authenticated unaffiliated reconstruction of the Cashen-Levitt application and Bass-Serre minimum argument, then compute or further constrain Out(G_m) without promoting the present lower bound to an exact orbit count.",
      "claimCeiling": "An anonymous, AI-assisted, unrefereed theorem candidate constructing a linearly growing free-by-cyclic family with exactly 2m+2 BNS components and at least m+1 Out(G_m)-orbits, supported by a complete written proof, one cited structural theorem, public immutable assets, producer replay and internal review; not an exact orbit classification, historical-priority finding, unaffiliated validation, formal verification, authenticated external specialist review or editorial peer review."
    },
    "impactClaims": [
      {
        "id": "unbounded-bns-component-orbits-science-no-impact",
        "aim": "science",
        "outcome": "Faster or more reliable construction and assurance of geometric-group-theory examples addressing open problem-list requests",
        "setting": "AI-assisted explicit construction, symbolic proof, source correspondence, adversarial replay, internal review and guarded candidate publication",
        "status": "NO_IMPACT_EVIDENCE",
        "designClass": "none",
        "comparator": "No matched conventional research or publication workflow was registered.",
        "estimand": "No effect on discovery time, active human effort, compute, correction rate, proof quality, independent-assurance time, uptake, citation or field outcomes was estimated.",
        "evidenceRefs": [],
        "registeredDesignRef": null,
        "independentAssessment": null
      }
    ]
  },
  "researchMetrics": {
    "schemaVersion": "1.0",
    "policyUrl": "https://evidencepress.org/api/research-metrics-policy.json",
    "workLedgerUrl": "https://evidencepress.org/api/work-ledger.json",
    "claimCeiling": "These records describe scoped workflow inputs and outcomes. They support calibration and reference-class construction, but do not by themselves establish research acceleration, theorem correctness, novelty, independent assurance or impact.",
    "attempts": [
      {
        "attemptId": "ep-attempt:unbounded-bns-component-orbits-publication",
        "status": "published",
        "resultClass": "positive",
        "metrics": {
          "schemaVersion": "1.0",
          "measurementScope": "publication-only",
          "scopeBoundary": "From prospective registration before public repository and DOI creation through terminal canonical Evidence Press readback or a preserved stop. Earlier theorem discovery, proof construction, source recovery, supplied-review repair, deterministic replay and internal editorial closure are excluded and not reconstructed.",
          "forecast": {
            "frozenAt": "2026-08-31T08:27:44Z",
            "procedureClass": "reviewed-candidate-identity-through-full-publication",
            "targetOutcome": "Publish synchronized immutable GitHub and Zenodo assets and a reader-first Evidence Press release with provenance-bound media, two composite seals, guarded zero-cost deployment and exact canonical readback without broadening the at-least-m+1 orbit lower bound.",
            "expectedActiveMinutes": 120,
            "plausibleLowMinutes": 75,
            "plausibleHighMinutes": 180,
            "expectedUnattendedWaitMinutes": 45,
            "referenceClass": {
              "label": "Recent reviewed exact-mathematics identity-through-publication closures",
              "sampleSize": 4,
              "basis": "Recent Evidence Press candidates used the same immutable GitHub and Zenodo identity, reader-first media, composite sealing, hosted CI, guarded deployment and canonical-readback architecture; this twelve-page universal family also needs careful theorem-to-page translation."
            },
            "fermiComponents": [
              {
                "component": "Public repository, release CI and Zenodo identity",
                "count": 1,
                "lowMinutesPerUnit": 15,
                "centralMinutesPerUnit": 25,
                "highMinutesPerUnit": 35,
                "basis": "One dependency-light reviewed package with established GitHub and Zenodo workflows, DOI-bearing metadata and exact cross-service asset comparison."
              },
              {
                "component": "Reader-first page and operating records",
                "count": 1,
                "lowMinutesPerUnit": 20,
                "centralMinutesPerUnit": 30,
                "highMinutesPerUnit": 45,
                "basis": "One twelve-page geometric-group-theory candidate whose chamber geometry, lower-bound invariant and Cashen--Levitt dependency need precise translation."
              },
              {
                "component": "Deterministic art, provenance-bound audio, Open Graph image and thumbnail",
                "count": 1,
                "lowMinutesPerUnit": 15,
                "centralMinutesPerUnit": 25,
                "highMinutesPerUnit": 35,
                "basis": "One release using established generators but requiring a new weighted-chord and BNS-wall visual that must not imply an exact orbit count."
              },
              {
                "component": "Composite A/B and C/D seals, CI, deployment and exact readback",
                "count": 1,
                "lowMinutesPerUnit": 25,
                "centralMinutesPerUnit": 40,
                "highMinutesPerUnit": 65,
                "basis": "One new canonical URL requiring two ledger-separated integration cycles, hosted multi-version checks, accessibility, guarded deployment and convergence verification."
              }
            ],
            "probabilityPositiveSignal": 0.96,
            "probabilityTargetClosure": 0.82,
            "probabilityHorizonMinutes": 180,
            "assumptions": [
              "GitHub, Zenodo, hosted CI, OpenAI fable TTS and zero-cost Cloudflare credentials remain available without weakening a gate or exposing a secret.",
              "The final DOI-bearing metadata and reader page preserve the lower-bound, imported-theorem, novelty, language and external-assurance ceilings.",
              "Origin main does not acquire an irreconcilable overlapping release or operating-ledger change.",
              "The established package and site generators accept the new candidate without a release-contract migration."
            ],
            "reforecastTriggers": [
              "GitHub, Zenodo, TTS, CI, Cloudflare or canonical readback remains unavailable after bounded recovery.",
              "A public replay or archive-integrity gate disagrees with the confirmed local package.",
              "A site, citation, licence, accessibility or preservation gate finds a claim-boundary conflict.",
              "Origin main advances with overlapping release, method-registry or work-ledger edits requiring reconciliation."
            ],
            "stopRule": "Stop on a fatal claim, source, licence, authentication, preservation, CI, accessibility or exact-readback failure. At 120 active minutes prioritize load-bearing release gates; at 180 active minutes preserve the exact blocker rather than weaken a gate."
          },
          "outcome": {
            "measuredAt": "2026-08-31T09:15:48Z",
            "calendarElapsedMinutes": 48,
            "activeAgentMinutes": 41,
            "activeHumanMinutes": null,
            "computeMinutes": 1,
            "unattendedWaitMinutes": 7,
            "blockedMinutes": 0,
            "reworkMinutes": 1,
            "agentRuns": 1,
            "maxParallelAgents": 1,
            "modelTurns": 1,
            "deduplicatedModelTokens": null,
            "uncachedInputTokens": null,
            "researchCycles": {
              "positive": 0,
              "negative": 0,
              "inconclusive": 0
            },
            "falsificationGatesRun": 0,
            "candidateArchitecturesTested": 0,
            "candidateArchitecturesRejected": 0,
            "substantiveReviewRounds": 0,
            "p0Findings": 0,
            "p1Findings": 0,
            "prepublicationClaimCorrections": 0,
            "resultState": "target-closed",
            "resultSummary": "The review-repaired candidate reached synchronized immutable GitHub and Zenodo identity, a reader-first canonical Evidence Press release, byte-bound fable audio and transcript, deterministic weighted-chord and BNS-fan art, an inspected Open Graph card, an exact mirrored thumbnail, append-only operating records, protocol revision 191, green Node 18, 20 and 22 plus accessibility CI, zero-cost guarded deployment, bounded custom-domain protocol convergence, exact 44-release and 31-institutional-artifact readback, full publication preservation and accepted IndexNow submission. One manifest-selection defect and one bounded social-card presentation issue were repaired before publication without changing the research claim. The immutable machine resource fields retain the first live release-candidate snapshot; an appended correction records later observed supplemental totals of four compute minutes, four agent runs and four rework minutes. The result remains an anonymous unrefereed theorem candidate proving an exact 2m+2 component count conditional on Cashen--Levitt Corollary 2.10 and only an at-least-m+1 outer-orbit lower bound, with no exact orbit classification, historical-priority, unaffiliated-validation, formal-verification, external-specialist-review, peer-review or impact promotion.",
            "positiveSignalObserved": true,
            "targetReached": true,
            "forecastErrorMinutes": -79,
            "forecastRatio": 0.342,
            "withinForecastInterval": false,
            "varianceReason": "The established identity, page, media, composite sealing, hosted-CI and guarded-deployment tooling closed the publication route below the 75-minute lower active-time bound; GitHub and Zenodo credentials were already healthy, the candidate package was review-complete at intake, and only bounded manifest-selection and social-card presentation repairs were required.",
            "missingFields": [
              {
                "field": "activeHumanMinutes",
                "reason": "No instrument captured human direction or review time at the prospective publication-only boundary."
              },
              {
                "field": "deduplicatedModelTokens",
                "reason": "No active fork-aware goal counter exposed exact task-local model-token usage at or after the 08:27:44Z publication-ledger boundary, so tokens are not reconstructed from conversation context."
              },
              {
                "field": "uncachedInputTokens",
                "reason": "The runtime does not expose an uncached-input token counter."
              }
            ]
          }
        },
        "missingnessReason": null
      }
    ]
  }
}