{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PGGHV4F7N5TNNSVF5MWGSTEH4O","short_pith_number":"pith:PGGHV4F7","canonical_record":{"source":{"id":"1809.04881","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-13T10:43:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6d7fc859c09b182cb6825fa0a53d3a6bcad8b1ffc61b38b41d71c7a167a20c1b","abstract_canon_sha256":"0acb86091afa3e4b9f061d9a50d6f962b10920f83797627b787647678691142c"},"schema_version":"1.0"},"canonical_sha256":"798c7af0bf6f66d6caa5eb2c694c87e393919d54f0d8158f4787e2b541465a5c","source":{"kind":"arxiv","id":"1809.04881","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04881","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04881v2","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04881","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"PGGHV4F7N5TN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGGHV4F7N5TNNSVF","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGGHV4F7","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PGGHV4F7N5TNNSVF5MWGSTEH4O","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04881","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-13T10:43:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6d7fc859c09b182cb6825fa0a53d3a6bcad8b1ffc61b38b41d71c7a167a20c1b","abstract_canon_sha256":"0acb86091afa3e4b9f061d9a50d6f962b10920f83797627b787647678691142c"},"schema_version":"1.0"},"canonical_sha256":"798c7af0bf6f66d6caa5eb2c694c87e393919d54f0d8158f4787e2b541465a5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:44.766344Z","signature_b64":"nB1G+iAjtubk86w948JT+D9sE/ORdFx0xstnaFPoNVOSs62DzbFu3sLnjXdPPYyWP5V0uv5KfzPmgsFKF5qBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"798c7af0bf6f66d6caa5eb2c694c87e393919d54f0d8158f4787e2b541465a5c","last_reissued_at":"2026-05-18T00:05:44.765753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:44.765753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04881","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qm8ouVXIq5E/pgQMp0J1x0xVlQfeA4tkNEdQOCIdDb6drMhK27YH45L8mxvkk8uPrgnxg469nEkeAEmFZWlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:19:25.402976Z"},"content_sha256":"caab70b75f42d1eb766d1e98e029296d5abe4c52294062c7e53e4f4f657fd517","schema_version":"1.0","event_id":"sha256:caab70b75f42d1eb766d1e98e029296d5abe4c52294062c7e53e4f4f657fd517"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PGGHV4F7N5TNNSVF5MWGSTEH4O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The 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:43:26Z","abstract_excerpt":"Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers. We use this to create 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, though depending on the choice of moves the length of the game and the winner can vary. We find upper and lower bounds on the number of moves possible. The upper bound is on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04881","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zyy8WlBazW3EXtOBjAzdUAwyM6r7D1ULx1GPIXeaMKlNA/DyN2EwtMornJm/lVHzdLrLMx7d8if4de+2tQ63Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:19:25.403688Z"},"content_sha256":"d5884bde594b79ca98947f26b642feea7af6d0339ef510848a4483201f8a30ef","schema_version":"1.0","event_id":"sha256:d5884bde594b79ca98947f26b642feea7af6d0339ef510848a4483201f8a30ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGGHV4F7N5TNNSVF5MWGSTEH4O/bundle.json","state_url":"https://pith.science/pith/PGGHV4F7N5TNNSVF5MWGSTEH4O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGGHV4F7N5TNNSVF5MWGSTEH4O/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T20:19:25Z","links":{"resolver":"https://pith.science/pith/PGGHV4F7N5TNNSVF5MWGSTEH4O","bundle":"https://pith.science/pith/PGGHV4F7N5TNNSVF5MWGSTEH4O/bundle.json","state":"https://pith.science/pith/PGGHV4F7N5TNNSVF5MWGSTEH4O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGGHV4F7N5TNNSVF5MWGSTEH4O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PGGHV4F7N5TNNSVF5MWGSTEH4O","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0acb86091afa3e4b9f061d9a50d6f962b10920f83797627b787647678691142c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-13T10:43:26Z","title_canon_sha256":"6d7fc859c09b182cb6825fa0a53d3a6bcad8b1ffc61b38b41d71c7a167a20c1b"},"schema_version":"1.0","source":{"id":"1809.04881","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04881","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04881v2","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04881","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"PGGHV4F7N5TN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGGHV4F7N5TNNSVF","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGGHV4F7","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:d5884bde594b79ca98947f26b642feea7af6d0339ef510848a4483201f8a30ef","target":"graph","created_at":"2026-05-18T00:05:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers. We use this to create 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, though depending on the choice of moves the length of the game and the winner can vary. We find upper and lower bounds on the number of moves possible. The upper bound is on th","authors_text":"Alyssa Epstein, Kristen Flint, Paul Baird-Smith, Steven J. Miller","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-13T10:43:26Z","title":"The Zeckendorf Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04881","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:caab70b75f42d1eb766d1e98e029296d5abe4c52294062c7e53e4f4f657fd517","target":"record","created_at":"2026-05-18T00:05:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0acb86091afa3e4b9f061d9a50d6f962b10920f83797627b787647678691142c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-13T10:43:26Z","title_canon_sha256":"6d7fc859c09b182cb6825fa0a53d3a6bcad8b1ffc61b38b41d71c7a167a20c1b"},"schema_version":"1.0","source":{"id":"1809.04881","kind":"arxiv","version":2}},"canonical_sha256":"798c7af0bf6f66d6caa5eb2c694c87e393919d54f0d8158f4787e2b541465a5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"798c7af0bf6f66d6caa5eb2c694c87e393919d54f0d8158f4787e2b541465a5c","first_computed_at":"2026-05-18T00:05:44.765753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:44.765753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nB1G+iAjtubk86w948JT+D9sE/ORdFx0xstnaFPoNVOSs62DzbFu3sLnjXdPPYyWP5V0uv5KfzPmgsFKF5qBAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:44.766344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04881","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:caab70b75f42d1eb766d1e98e029296d5abe4c52294062c7e53e4f4f657fd517","sha256:d5884bde594b79ca98947f26b642feea7af6d0339ef510848a4483201f8a30ef"],"state_sha256":"bdcc970bf7ccf038a7ea530ebc799c7f33d9d16b309fd2c6ccc683c98c81a29e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u0jTUKugNL1m877Mz49OH08mQtn7JZcgSFOxjyeisiwWdBrONjzTJpIPkcQiLSoJBB3TzMUBgpHM95Gml2smBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:19:25.407661Z","bundle_sha256":"16ee50c9d0fab0b09897f010346892ede25efa9d868c556835e31a94ee9608e5"}}