{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GNQCDO26WJKQL2YMHIQYBRMAII","short_pith_number":"pith:GNQCDO26","schema_version":"1.0","canonical_sha256":"336021bb5eb25505eb0c3a2180c58042094833efcb2376567a6b7cc4cd70f047","source":{"kind":"arxiv","id":"2009.09510","version":1},"attestation_state":"computed","paper":{"title":"Bounds on Zeckendorf Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Aiden Dunkelberg, Anna Cusenza, Clayton Mizgerd, Dianhui Ke, Jingkai Ye, Kate Huffman, Micah McClatchey, Steven J. Miller, Vashisth Tiwari, Xiaoyan Zheng","submitted_at":"2020-09-20T19:52:31Z","abstract_excerpt":"Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers. We use this decomposition to construct a two-player game. Given a fixed integer $n$ and an initial decomposition of $n=n F_1$, the two players alternate by using moves related to the recurrence relation $F_{n+1}=F_n+F_{n-1}$, and whoever moves last wins. The game always terminates in the Zeckendorf decomposition; depending on the choice of moves the length of the game and the winner can vary, though for $n\\ge 2$ there is a non-constructive proof that Player 2 has a winning st"},"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":"2009.09510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2020-09-20T19:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"ebb17cc416a506fcc70f2038bc7fa1a75b965ba87506c604b66a0936fda8838a","abstract_canon_sha256":"aa26113e3ac1634a19d604fd284c9ea7819820bb54f4640c9a709308af3ce6f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:36:41.349225Z","signature_b64":"irl6LJMoyz7kwJSXSwhOYwXoIvY4DdoUJeOPMhhwrRqH4cCal/I2CTo3/Qr5JTKZ+YaOFqVm5O3wdRrIBR7NDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"336021bb5eb25505eb0c3a2180c58042094833efcb2376567a6b7cc4cd70f047","last_reissued_at":"2026-07-05T01:36:41.348850Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:36:41.348850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on Zeckendorf Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Aiden Dunkelberg, Anna Cusenza, Clayton Mizgerd, Dianhui Ke, Jingkai Ye, Kate Huffman, Micah McClatchey, Steven J. Miller, Vashisth Tiwari, Xiaoyan Zheng","submitted_at":"2020-09-20T19:52:31Z","abstract_excerpt":"Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers. We use this decomposition to construct a two-player game. Given a fixed integer $n$ and an initial decomposition of $n=n F_1$, the two players alternate by using moves related to the recurrence relation $F_{n+1}=F_n+F_{n-1}$, and whoever moves last wins. The game always terminates in the Zeckendorf decomposition; depending on the choice of moves the length of the game and the winner can vary, though for $n\\ge 2$ there is a non-constructive proof that Player 2 has a winning st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.09510","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.09510/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":"2009.09510","created_at":"2026-07-05T01:36:41.348905+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.09510v1","created_at":"2026-07-05T01:36:41.348905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.09510","created_at":"2026-07-05T01:36:41.348905+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNQCDO26WJKQ","created_at":"2026-07-05T01:36:41.348905+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNQCDO26WJKQL2YM","created_at":"2026-07-05T01:36:41.348905+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNQCDO26","created_at":"2026-07-05T01:36:41.348905+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/GNQCDO26WJKQL2YMHIQYBRMAII","json":"https://pith.science/pith/GNQCDO26WJKQL2YMHIQYBRMAII.json","graph_json":"https://pith.science/api/pith-number/GNQCDO26WJKQL2YMHIQYBRMAII/graph.json","events_json":"https://pith.science/api/pith-number/GNQCDO26WJKQL2YMHIQYBRMAII/events.json","paper":"https://pith.science/paper/GNQCDO26"},"agent_actions":{"view_html":"https://pith.science/pith/GNQCDO26WJKQL2YMHIQYBRMAII","download_json":"https://pith.science/pith/GNQCDO26WJKQL2YMHIQYBRMAII.json","view_paper":"https://pith.science/paper/GNQCDO26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.09510&json=true","fetch_graph":"https://pith.science/api/pith-number/GNQCDO26WJKQL2YMHIQYBRMAII/graph.json","fetch_events":"https://pith.science/api/pith-number/GNQCDO26WJKQL2YMHIQYBRMAII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNQCDO26WJKQL2YMHIQYBRMAII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNQCDO26WJKQL2YMHIQYBRMAII/action/storage_attestation","attest_author":"https://pith.science/pith/GNQCDO26WJKQL2YMHIQYBRMAII/action/author_attestation","sign_citation":"https://pith.science/pith/GNQCDO26WJKQL2YMHIQYBRMAII/action/citation_signature","submit_replication":"https://pith.science/pith/GNQCDO26WJKQL2YMHIQYBRMAII/action/replication_record"}},"created_at":"2026-07-05T01:36:41.348905+00:00","updated_at":"2026-07-05T01:36:41.348905+00:00"}