{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UYCYPB6LTSN4IDVC4GDSBFDYRI","short_pith_number":"pith:UYCYPB6L","schema_version":"1.0","canonical_sha256":"a6058787cb9c9bc40ea2e1872094788a2433bbe5b6324675a484304360b2f9e6","source":{"kind":"arxiv","id":"2603.29622","version":2},"attestation_state":"computed","paper":{"title":"Certified Finite-State Induction for a Perturbed Hofstadter Recursion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Marco Mantovanelli","submitted_at":"2026-03-31T11:44:45Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2603.29622","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-31T11:44:45Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"8b1b994a18e64c6e2681241cb442d82155ee31f4f3c0e275966d515e11c99a84","abstract_canon_sha256":"9251bd9e2e9b273b035b367630e0b68c760e4c581d956142715a4b2c99eac7c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:43.986302Z","signature_b64":"YX5QFhFovhVFh0+PGPy6eveIyDcNLPgpW9qbSyhJDQ3BfeZSdxL3CUFtIi9Snsv9xKpwMQTChRg3H7ojURkTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6058787cb9c9bc40ea2e1872094788a2433bbe5b6324675a484304360b2f9e6","last_reissued_at":"2026-05-20T00:05:43.985786Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:43.985786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Certified Finite-State Induction for a Perturbed Hofstadter Recursion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Marco Mantovanelli","submitted_at":"2026-03-31T11:44:45Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.29622","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.29622/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.29622","created_at":"2026-05-20T00:05:43.985871+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.29622v2","created_at":"2026-05-20T00:05:43.985871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.29622","created_at":"2026-05-20T00:05:43.985871+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYCYPB6LTSN4","created_at":"2026-05-20T00:05:43.985871+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYCYPB6LTSN4IDVC","created_at":"2026-05-20T00:05:43.985871+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYCYPB6L","created_at":"2026-05-20T00:05:43.985871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UYCYPB6LTSN4IDVC4GDSBFDYRI","json":"https://pith.science/pith/UYCYPB6LTSN4IDVC4GDSBFDYRI.json","graph_json":"https://pith.science/api/pith-number/UYCYPB6LTSN4IDVC4GDSBFDYRI/graph.json","events_json":"https://pith.science/api/pith-number/UYCYPB6LTSN4IDVC4GDSBFDYRI/events.json","paper":"https://pith.science/paper/UYCYPB6L"},"agent_actions":{"view_html":"https://pith.science/pith/UYCYPB6LTSN4IDVC4GDSBFDYRI","download_json":"https://pith.science/pith/UYCYPB6LTSN4IDVC4GDSBFDYRI.json","view_paper":"https://pith.science/paper/UYCYPB6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.29622&json=true","fetch_graph":"https://pith.science/api/pith-number/UYCYPB6LTSN4IDVC4GDSBFDYRI/graph.json","fetch_events":"https://pith.science/api/pith-number/UYCYPB6LTSN4IDVC4GDSBFDYRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYCYPB6LTSN4IDVC4GDSBFDYRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYCYPB6LTSN4IDVC4GDSBFDYRI/action/storage_attestation","attest_author":"https://pith.science/pith/UYCYPB6LTSN4IDVC4GDSBFDYRI/action/author_attestation","sign_citation":"https://pith.science/pith/UYCYPB6LTSN4IDVC4GDSBFDYRI/action/citation_signature","submit_replication":"https://pith.science/pith/UYCYPB6LTSN4IDVC4GDSBFDYRI/action/replication_record"}},"created_at":"2026-05-20T00:05:43.985871+00:00","updated_at":"2026-05-20T00:05:43.985871+00:00"}