{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZTKIQ4XK6FN6EUMCZOGDFW3WN3","short_pith_number":"pith:ZTKIQ4XK","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"},"canonical_sha256":"ccd48872eaf15be25182cb8c32db766ed52006ced75aaeffc4227a11716218d7","source":{"kind":"arxiv","id":"1809.04883","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04883","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04883v2","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04883","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZTKIQ4XK6FN6","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZTKIQ4XK6FN6EUMC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZTKIQ4XK","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZTKIQ4XK6FN6EUMCZOGDFW3WN3","target":"record","payload":{"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"},"canonical_sha256":"ccd48872eaf15be25182cb8c32db766ed52006ced75aaeffc4227a11716218d7","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"},"source_kind":"arxiv","source_id":"1809.04883","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":"ln79JElduVc4yDVfUDQJgqNB3+EqPQO/W9fbeDQ6xJr6AvOyuW9F3h++dRXNwY8JGZa6JtxlulUdytkXp9GKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:52:15.840908Z"},"content_sha256":"c2d1cdc9b6ab75c89cf895ddcc75984a51c734cc514847ae6836e7f6d8518c0f","schema_version":"1.0","event_id":"sha256:c2d1cdc9b6ab75c89cf895ddcc75984a51c734cc514847ae6836e7f6d8518c0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZTKIQ4XK6FN6EUMCZOGDFW3WN3","target":"graph","payload":{"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"},"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":"e6645yIPqxrSzyR0ZE7DgtVqFyK6yR9GPc6FuOMtRdJcxyvUqk5CKiduFEWXFPU94mMJAYqxBV7B6O4jyZ9NDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:52:15.841255Z"},"content_sha256":"e6b56ed54c4d46e94d36e66cb989d729671fd28b7e6f67aa80f8e0cebb8ae923","schema_version":"1.0","event_id":"sha256:e6b56ed54c4d46e94d36e66cb989d729671fd28b7e6f67aa80f8e0cebb8ae923"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/bundle.json","state_url":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/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-05-29T17:52:15Z","links":{"resolver":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3","bundle":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/bundle.json","state":"https://pith.science/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTKIQ4XK6FN6EUMCZOGDFW3WN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZTKIQ4XK6FN6EUMCZOGDFW3WN3","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":"5a2f15128163f1d562b1c4aabcfe22247685aa32e302710e037eb1ec09407c55","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-13T10:56:15Z","title_canon_sha256":"68f34b42dd6fa6c70bb9390353f6c48ba6bcb71af8cb9b9c2ed7502dce617ed5"},"schema_version":"1.0","source":{"id":"1809.04883","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04883","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04883v2","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04883","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"ZTKIQ4XK6FN6","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZTKIQ4XK6FN6EUMC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZTKIQ4XK","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:e6b56ed54c4d46e94d36e66cb989d729671fd28b7e6f67aa80f8e0cebb8ae923","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; 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","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:56:15Z","title":"The Generalized Zeckendorf Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04883","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:c2d1cdc9b6ab75c89cf895ddcc75984a51c734cc514847ae6836e7f6d8518c0f","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":"5a2f15128163f1d562b1c4aabcfe22247685aa32e302710e037eb1ec09407c55","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-13T10:56:15Z","title_canon_sha256":"68f34b42dd6fa6c70bb9390353f6c48ba6bcb71af8cb9b9c2ed7502dce617ed5"},"schema_version":"1.0","source":{"id":"1809.04883","kind":"arxiv","version":2}},"canonical_sha256":"ccd48872eaf15be25182cb8c32db766ed52006ced75aaeffc4227a11716218d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccd48872eaf15be25182cb8c32db766ed52006ced75aaeffc4227a11716218d7","first_computed_at":"2026-05-18T00:05:44.756904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:44.756904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gcEfdiHO2+diWbZbrpHRLvz/ZUQ8W4gKK9UQJIFVbT3k77UZh96XmrlVd80GLUMuD2M5GVXWBV6FzmeGiCgqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:44.757656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04883","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2d1cdc9b6ab75c89cf895ddcc75984a51c734cc514847ae6836e7f6d8518c0f","sha256:e6b56ed54c4d46e94d36e66cb989d729671fd28b7e6f67aa80f8e0cebb8ae923"],"state_sha256":"b77f2050eaeba04a252adb00eafd97bd7fd168d729253a47548e4663471a02bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+2NK+2xhUq5+3W/K2NmRipuzq2+3y7IbO2nvaNpeIaQb0qmy8wKuUjwmI+IXFOa5JnijFDCuBboR1j19ehVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:52:15.843873Z","bundle_sha256":"bf0168132637441f091f4b562d14e15210e18eaca7958e20a07b4de8a55430bf"}}