{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:6VK42ETCIQUJQ3YNULLOCG6CNL","short_pith_number":"pith:6VK42ETC","schema_version":"1.0","canonical_sha256":"f555cd12624428986f0da2d6e11bc26af05664fd1868a7ec8dd6addda3d10afd","source":{"kind":"arxiv","id":"2211.14973","version":1},"attestation_state":"computed","paper":{"title":"Winning Strategies for Generalized Zeckendorf Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Eliel Sosis, Jingkai Ye, Steven J. Miller","submitted_at":"2022-11-28T00:06:58Z","abstract_excerpt":"Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result holds for other positive linear recurrence sequences. These legal decompositions can be used to construct a game that starts with a fixed integer $n$, and players take turns using moves relating to a given recurrence relation. The game eventually terminates in a unique legal decomposition, and the player who makes the final move wins.\n  For the Fibonacci game, Player $2$ has the winning strategy for all $n>2$. We give a non-constructive proof that for the two"},"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":"2211.14973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2022-11-28T00:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"5a4d2ca02acda6c5083cc72eebc1c999271d82066b889e58a0c29e9e7a55d0d2","abstract_canon_sha256":"a5e57eba225ab01a1a5bf862d5d715105b17f24f91ab4a0a0fca4828af207cdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:58.022436Z","signature_b64":"pIDJl+gtQ2y6iXyCfEaW1hYAccc2agf3G0S9yNpJq+JWbR1jFyrrVS2oVC/KyaOtLjcTbUbov55GZ6k9yt90AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f555cd12624428986f0da2d6e11bc26af05664fd1868a7ec8dd6addda3d10afd","last_reissued_at":"2026-07-05T05:19:58.021997Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:58.021997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Winning Strategies for Generalized Zeckendorf Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Eliel Sosis, Jingkai Ye, Steven J. Miller","submitted_at":"2022-11-28T00:06:58Z","abstract_excerpt":"Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result holds for other positive linear recurrence sequences. These legal decompositions can be used to construct a game that starts with a fixed integer $n$, and players take turns using moves relating to a given recurrence relation. The game eventually terminates in a unique legal decomposition, and the player who makes the final move wins.\n  For the Fibonacci game, Player $2$ has the winning strategy for all $n>2$. We give a non-constructive proof that for the two"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14973","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/2211.14973/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":"2211.14973","created_at":"2026-07-05T05:19:58.022054+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.14973v1","created_at":"2026-07-05T05:19:58.022054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14973","created_at":"2026-07-05T05:19:58.022054+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VK42ETCIQUJ","created_at":"2026-07-05T05:19:58.022054+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VK42ETCIQUJQ3YN","created_at":"2026-07-05T05:19:58.022054+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VK42ETC","created_at":"2026-07-05T05:19:58.022054+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/6VK42ETCIQUJQ3YNULLOCG6CNL","json":"https://pith.science/pith/6VK42ETCIQUJQ3YNULLOCG6CNL.json","graph_json":"https://pith.science/api/pith-number/6VK42ETCIQUJQ3YNULLOCG6CNL/graph.json","events_json":"https://pith.science/api/pith-number/6VK42ETCIQUJQ3YNULLOCG6CNL/events.json","paper":"https://pith.science/paper/6VK42ETC"},"agent_actions":{"view_html":"https://pith.science/pith/6VK42ETCIQUJQ3YNULLOCG6CNL","download_json":"https://pith.science/pith/6VK42ETCIQUJQ3YNULLOCG6CNL.json","view_paper":"https://pith.science/paper/6VK42ETC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.14973&json=true","fetch_graph":"https://pith.science/api/pith-number/6VK42ETCIQUJQ3YNULLOCG6CNL/graph.json","fetch_events":"https://pith.science/api/pith-number/6VK42ETCIQUJQ3YNULLOCG6CNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VK42ETCIQUJQ3YNULLOCG6CNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VK42ETCIQUJQ3YNULLOCG6CNL/action/storage_attestation","attest_author":"https://pith.science/pith/6VK42ETCIQUJQ3YNULLOCG6CNL/action/author_attestation","sign_citation":"https://pith.science/pith/6VK42ETCIQUJQ3YNULLOCG6CNL/action/citation_signature","submit_replication":"https://pith.science/pith/6VK42ETCIQUJQ3YNULLOCG6CNL/action/replication_record"}},"created_at":"2026-07-05T05:19:58.022054+00:00","updated_at":"2026-07-05T05:19:58.022054+00:00"}