{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:C56AAEUZWFAXIMH57FRW3M6UWX","short_pith_number":"pith:C56AAEUZ","schema_version":"1.0","canonical_sha256":"177c001299b1417430fdf9636db3d4b5fa9bb5996ccdc27106b7cc5d960042f6","source":{"kind":"arxiv","id":"1203.0586","version":1},"attestation_state":"computed","paper":{"title":"An Undecidable Nested Recurrence Relation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Frank Ruskey, Marcel Celaya","submitted_at":"2012-03-02T23:15:42Z","abstract_excerpt":"Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form ... A(...A(...)...). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and highly dependent on their initial conditions. A nested recurrence relation A(n) is said to be undecidable if the following problem is undecidable: given a finite set of initial conditions for A(n), is the recurrence relation calculable? Here calculable means that for every n >= 0, either A(n) is an initial condition or the calculation of A(n) involves only invoca"},"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":"1203.0586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-02T23:15:42Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3471bef07536fb8c9ed0aaa503814e369b7c1c865151d852ba1b3801e5c5dc93","abstract_canon_sha256":"5aae328ec101de3bd1a7d243fd4269eed7387022dc0e5fbb847e7a8fe514c47b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:51.201971Z","signature_b64":"cI+68oM37488czYeu866i0tEPD+ObHhmtdeASCS+IKzeRoLYWrQIz4iIpoMTODabaLjIdk1RW2GbmMW6+B5LAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"177c001299b1417430fdf9636db3d4b5fa9bb5996ccdc27106b7cc5d960042f6","last_reissued_at":"2026-05-18T04:00:51.201435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:51.201435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Undecidable Nested Recurrence Relation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Frank Ruskey, Marcel Celaya","submitted_at":"2012-03-02T23:15:42Z","abstract_excerpt":"Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form ... A(...A(...)...). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and highly dependent on their initial conditions. A nested recurrence relation A(n) is said to be undecidable if the following problem is undecidable: given a finite set of initial conditions for A(n), is the recurrence relation calculable? Here calculable means that for every n >= 0, either A(n) is an initial condition or the calculation of A(n) involves only invoca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0586","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1203.0586","created_at":"2026-05-18T04:00:51.201520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.0586v1","created_at":"2026-05-18T04:00:51.201520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0586","created_at":"2026-05-18T04:00:51.201520+00:00"},{"alias_kind":"pith_short_12","alias_value":"C56AAEUZWFAX","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"C56AAEUZWFAXIMH5","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"C56AAEUZ","created_at":"2026-05-18T12:27:01.376967+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/C56AAEUZWFAXIMH57FRW3M6UWX","json":"https://pith.science/pith/C56AAEUZWFAXIMH57FRW3M6UWX.json","graph_json":"https://pith.science/api/pith-number/C56AAEUZWFAXIMH57FRW3M6UWX/graph.json","events_json":"https://pith.science/api/pith-number/C56AAEUZWFAXIMH57FRW3M6UWX/events.json","paper":"https://pith.science/paper/C56AAEUZ"},"agent_actions":{"view_html":"https://pith.science/pith/C56AAEUZWFAXIMH57FRW3M6UWX","download_json":"https://pith.science/pith/C56AAEUZWFAXIMH57FRW3M6UWX.json","view_paper":"https://pith.science/paper/C56AAEUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.0586&json=true","fetch_graph":"https://pith.science/api/pith-number/C56AAEUZWFAXIMH57FRW3M6UWX/graph.json","fetch_events":"https://pith.science/api/pith-number/C56AAEUZWFAXIMH57FRW3M6UWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C56AAEUZWFAXIMH57FRW3M6UWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C56AAEUZWFAXIMH57FRW3M6UWX/action/storage_attestation","attest_author":"https://pith.science/pith/C56AAEUZWFAXIMH57FRW3M6UWX/action/author_attestation","sign_citation":"https://pith.science/pith/C56AAEUZWFAXIMH57FRW3M6UWX/action/citation_signature","submit_replication":"https://pith.science/pith/C56AAEUZWFAXIMH57FRW3M6UWX/action/replication_record"}},"created_at":"2026-05-18T04:00:51.201520+00:00","updated_at":"2026-05-18T04:00:51.201520+00:00"}