{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UYCYPB6LTSN4IDVC4GDSBFDYRI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9251bd9e2e9b273b035b367630e0b68c760e4c581d956142715a4b2c99eac7c2","cross_cats_sorted":["math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-31T11:44:45Z","title_canon_sha256":"8b1b994a18e64c6e2681241cb442d82155ee31f4f3c0e275966d515e11c99a84"},"schema_version":"1.0","source":{"id":"2603.29622","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.29622","created_at":"2026-05-20T00:05:43Z"},{"alias_kind":"arxiv_version","alias_value":"2603.29622v2","created_at":"2026-05-20T00:05:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.29622","created_at":"2026-05-20T00:05:43Z"},{"alias_kind":"pith_short_12","alias_value":"UYCYPB6LTSN4","created_at":"2026-05-20T00:05:43Z"},{"alias_kind":"pith_short_16","alias_value":"UYCYPB6LTSN4IDVC","created_at":"2026-05-20T00:05:43Z"},{"alias_kind":"pith_short_8","alias_value":"UYCYPB6L","created_at":"2026-05-20T00:05:43Z"}],"graph_snapshots":[{"event_id":"sha256:4e05e6e63b761a46d4f1e4f322d5ce5f5509581ed765688b8dca10a89c548675","target":"graph","created_at":"2026-05-20T00:05:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.29622/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the parity-perturbed Hofstadter-type recursion $$ Q(1)=Q(2)=1,\\qquad Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2))+(-1)^n . $$ We prove, by computer-certified finite-state induction, that this recursion is well-defined for all $(n\\ge 1)$.\n  The proof extracts a finite symbolic recursive model from a directly verified initial trace and then verifies an exported machine-readable certificate by independent checkers. The certificate consists of finite symbolic word systems, radius-$(R)$ contexts, context-extension records, symbolic realizations, and arithmetic recurrence records. The checkers verify symbo","authors_text":"Marco Mantovanelli","cross_cats":["math.NT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-31T11:44:45Z","title":"Certified Finite-State Induction for a Perturbed Hofstadter Recursion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.29622","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3f292c03ed22d011802192c83d1000d3f4563523cd9fc8dea97017a52ecf37bc","target":"record","created_at":"2026-05-20T00:05:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9251bd9e2e9b273b035b367630e0b68c760e4c581d956142715a4b2c99eac7c2","cross_cats_sorted":["math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-31T11:44:45Z","title_canon_sha256":"8b1b994a18e64c6e2681241cb442d82155ee31f4f3c0e275966d515e11c99a84"},"schema_version":"1.0","source":{"id":"2603.29622","kind":"arxiv","version":2}},"canonical_sha256":"a6058787cb9c9bc40ea2e1872094788a2433bbe5b6324675a484304360b2f9e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6058787cb9c9bc40ea2e1872094788a2433bbe5b6324675a484304360b2f9e6","first_computed_at":"2026-05-20T00:05:43.985786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:43.985786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YX5QFhFovhVFh0+PGPy6eveIyDcNLPgpW9qbSyhJDQ3BfeZSdxL3CUFtIi9Snsv9xKpwMQTChRg3H7ojURkTCg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:43.986302Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.29622","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f292c03ed22d011802192c83d1000d3f4563523cd9fc8dea97017a52ecf37bc","sha256:4e05e6e63b761a46d4f1e4f322d5ce5f5509581ed765688b8dca10a89c548675"],"state_sha256":"d7dab5c54ddbf786316949fda9331170e90afc03a37557c7c6e0e474c66b655f"}