{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZTKIQ4XK6FN6EUMCZOGDFW3WN3","short_pith_number":"pith:ZTKIQ4XK","schema_version":"1.0","canonical_sha256":"ccd48872eaf15be25182cb8c32db766ed52006ced75aaeffc4227a11716218d7","source":{"kind":"arxiv","id":"1809.04883","version":2},"attestation_state":"computed","paper":{"title":"The Generalized Zeckendorf Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Alyssa Epstein, Kristen Flint, Paul Baird-Smith, Steven J. Miller","submitted_at":"2018-09-13T10:56:15Z","abstract_excerpt":"Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result, though with a different notion of a legal decomposition, holds for many other sequences. We use these decompositions to construct a two-player game, which can be completely analyzed for linear recurrence relations of the form $G_n = \\sum_{i=1}^{k} c G_{n-i}$ for a fixed positive integer $c$ ($c=k-1=1$ gives the Fibonaccis). Given a fixed integer $n$ and an initial decomposition of $n = n G_1$, the two players alternate by using moves related to the recurrenc"},"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":"1809.04883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-13T10:56:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"68f34b42dd6fa6c70bb9390353f6c48ba6bcb71af8cb9b9c2ed7502dce617ed5","abstract_canon_sha256":"5a2f15128163f1d562b1c4aabcfe22247685aa32e302710e037eb1ec09407c55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:44.757656Z","signature_b64":"gcEfdiHO2+diWbZbrpHRLvz/ZUQ8W4gKK9UQJIFVbT3k77UZh96XmrlVd80GLUMuD2M5GVXWBV6FzmeGiCgqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccd48872eaf15be25182cb8c32db766ed52006ced75aaeffc4227a11716218d7","last_reissued_at":"2026-05-18T00:05:44.756904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:44.756904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Generalized Zeckendorf Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Alyssa Epstein, Kristen Flint, Paul Baird-Smith, Steven J. Miller","submitted_at":"2018-09-13T10:56:15Z","abstract_excerpt":"Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result, though with a different notion of a legal decomposition, holds for many other sequences. We use these decompositions to construct a two-player game, which can be completely analyzed for linear recurrence relations of the form $G_n = \\sum_{i=1}^{k} c G_{n-i}$ for a fixed positive integer $c$ ($c=k-1=1$ gives the Fibonaccis). Given a fixed integer $n$ and an initial decomposition of $n = n G_1$, the two players alternate by using moves related to the recurrenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04883","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":""},"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":"1809.04883","created_at":"2026-05-18T00:05:44.757031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.04883v2","created_at":"2026-05-18T00:05:44.757031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04883","created_at":"2026-05-18T00:05:44.757031+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTKIQ4XK6FN6","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTKIQ4XK6FN6EUMC","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTKIQ4XK","created_at":"2026-05-18T12:33:07.085635+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/ZTKIQ4XK6FN6EUMCZOGDFW3WN3","json":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3.json","graph_json":"https://pith.science/api/pith-number/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/graph.json","events_json":"https://pith.science/api/pith-number/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/events.json","paper":"https://pith.science/paper/ZTKIQ4XK"},"agent_actions":{"view_html":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3","download_json":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3.json","view_paper":"https://pith.science/paper/ZTKIQ4XK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.04883&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/action/storage_attestation","attest_author":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/action/author_attestation","sign_citation":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/action/citation_signature","submit_replication":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/action/replication_record"}},"created_at":"2026-05-18T00:05:44.757031+00:00","updated_at":"2026-05-18T00:05:44.757031+00:00"}