{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LQCLYU24AX27SUR57ZZCZGZUK2","short_pith_number":"pith:LQCLYU24","canonical_record":{"source":{"id":"1412.6839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-12-21T22:26:56Z","cross_cats_sorted":[],"title_canon_sha256":"a05c199038513dcbcd5ad625f321dd3c94dbc2b845e4213085065cbe8a9ce0fd","abstract_canon_sha256":"873a2fc50d510188fcd8796299bedd638fda86c1492b50a0a2fd279234bfa9c4"},"schema_version":"1.0"},"canonical_sha256":"5c04bc535c05f5f9523dfe722c9b345688f78d2766c1ae705a43ce2ca252013a","source":{"kind":"arxiv","id":"1412.6839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6839","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6839v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6839","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"LQCLYU24AX27","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LQCLYU24AX27SUR5","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LQCLYU24","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LQCLYU24AX27SUR57ZZCZGZUK2","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-12-21T22:26:56Z","cross_cats_sorted":[],"title_canon_sha256":"a05c199038513dcbcd5ad625f321dd3c94dbc2b845e4213085065cbe8a9ce0fd","abstract_canon_sha256":"873a2fc50d510188fcd8796299bedd638fda86c1492b50a0a2fd279234bfa9c4"},"schema_version":"1.0"},"canonical_sha256":"5c04bc535c05f5f9523dfe722c9b345688f78d2766c1ae705a43ce2ca252013a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:46.118011Z","signature_b64":"F8TNJ0kmzk9YbU0PBbVIdHXcLn+i70eReIxlrm+z0Pl6ehNoB26P/lunoXNEEHwJbXFNDpVniynyqZKYeWbiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c04bc535c05f5f9523dfe722c9b345688f78d2766c1ae705a43ce2ca252013a","last_reissued_at":"2026-05-18T02:30:46.117604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:46.117604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6839","source_version":1,"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-18T02:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/bm0Rt1pnFNHUCIF99AiS3m5kBIFHtthuIypIOzoAeYku46F6QQ/ZogsyfRrEzZY+DDQbI63MokbLrhV5snCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:58:21.300603Z"},"content_sha256":"e9a5b84753d9383aa6634a68eb1680fa056ce847851e62748a512cbc240a4683","schema_version":"1.0","event_id":"sha256:e9a5b84753d9383aa6634a68eb1680fa056ce847851e62748a512cbc240a4683"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LQCLYU24AX27SUR57ZZCZGZUK2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Benford Behavior of Generalized Zeckendorf Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew Best, Brian McDonald, Caroline Turnage-Butterbaugh, Kimsy Tor, Madeleine Weinstein, Patrick Dynes, Steven J. Miller, Xixi Edelsbrunner","submitted_at":"2014-12-21T22:26:56Z","abstract_excerpt":"We prove connections between Zeckendorf decompositions and Benford's law. Recall that if we define the Fibonacci numbers by $F_1 = 1, F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$, every positive integer can be written uniquely as a sum of non-adjacent elements of this sequence; this is called the Zeckendorf decomposition, and similar unique decompositions exist for sequences arising from recurrence relations of the form $G_{n+1}=c_1G_n+\\cdots+c_LG_{n+1-L}$ with $c_i$ positive and some other restrictions. Additionally, a set $S \\subset \\mathbb{Z}$ is said to satisfy Benford's law base 10 if the densi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6839","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":""},"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-18T02:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ngPAXGPMytSd7qWL0sfBY7hMgsLbvDPe0yb68x0yGKG6hOZPs7qyC6ENv79T6YUb0YPbESyJhUysrx5IDMZvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:58:21.301212Z"},"content_sha256":"aee95e6dd71fcbd277d6a261eb7fb94fe2c0b886901341a121ea63af39f2528b","schema_version":"1.0","event_id":"sha256:aee95e6dd71fcbd277d6a261eb7fb94fe2c0b886901341a121ea63af39f2528b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQCLYU24AX27SUR57ZZCZGZUK2/bundle.json","state_url":"https://pith.science/pith/LQCLYU24AX27SUR57ZZCZGZUK2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQCLYU24AX27SUR57ZZCZGZUK2/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-09T13:58:21Z","links":{"resolver":"https://pith.science/pith/LQCLYU24AX27SUR57ZZCZGZUK2","bundle":"https://pith.science/pith/LQCLYU24AX27SUR57ZZCZGZUK2/bundle.json","state":"https://pith.science/pith/LQCLYU24AX27SUR57ZZCZGZUK2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQCLYU24AX27SUR57ZZCZGZUK2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LQCLYU24AX27SUR57ZZCZGZUK2","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":"873a2fc50d510188fcd8796299bedd638fda86c1492b50a0a2fd279234bfa9c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-12-21T22:26:56Z","title_canon_sha256":"a05c199038513dcbcd5ad625f321dd3c94dbc2b845e4213085065cbe8a9ce0fd"},"schema_version":"1.0","source":{"id":"1412.6839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6839","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6839v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6839","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"LQCLYU24AX27","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LQCLYU24AX27SUR5","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LQCLYU24","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:aee95e6dd71fcbd277d6a261eb7fb94fe2c0b886901341a121ea63af39f2528b","target":"graph","created_at":"2026-05-18T02:30:46Z","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":"We prove connections between Zeckendorf decompositions and Benford's law. Recall that if we define the Fibonacci numbers by $F_1 = 1, F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$, every positive integer can be written uniquely as a sum of non-adjacent elements of this sequence; this is called the Zeckendorf decomposition, and similar unique decompositions exist for sequences arising from recurrence relations of the form $G_{n+1}=c_1G_n+\\cdots+c_LG_{n+1-L}$ with $c_i$ positive and some other restrictions. Additionally, a set $S \\subset \\mathbb{Z}$ is said to satisfy Benford's law base 10 if the densi","authors_text":"Andrew Best, Brian McDonald, Caroline Turnage-Butterbaugh, Kimsy Tor, Madeleine Weinstein, Patrick Dynes, Steven J. Miller, Xixi Edelsbrunner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-12-21T22:26:56Z","title":"Benford Behavior of Generalized Zeckendorf Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6839","kind":"arxiv","version":1},"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:e9a5b84753d9383aa6634a68eb1680fa056ce847851e62748a512cbc240a4683","target":"record","created_at":"2026-05-18T02:30:46Z","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":"873a2fc50d510188fcd8796299bedd638fda86c1492b50a0a2fd279234bfa9c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-12-21T22:26:56Z","title_canon_sha256":"a05c199038513dcbcd5ad625f321dd3c94dbc2b845e4213085065cbe8a9ce0fd"},"schema_version":"1.0","source":{"id":"1412.6839","kind":"arxiv","version":1}},"canonical_sha256":"5c04bc535c05f5f9523dfe722c9b345688f78d2766c1ae705a43ce2ca252013a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c04bc535c05f5f9523dfe722c9b345688f78d2766c1ae705a43ce2ca252013a","first_computed_at":"2026-05-18T02:30:46.117604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:46.117604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F8TNJ0kmzk9YbU0PBbVIdHXcLn+i70eReIxlrm+z0Pl6ehNoB26P/lunoXNEEHwJbXFNDpVniynyqZKYeWbiBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:46.118011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9a5b84753d9383aa6634a68eb1680fa056ce847851e62748a512cbc240a4683","sha256:aee95e6dd71fcbd277d6a261eb7fb94fe2c0b886901341a121ea63af39f2528b"],"state_sha256":"bf557da35443d1690fc5551c00fbc50e58a5c603d26f3343a45ad6708a651180"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T1AiNrYsYF2RZw7B/fsOLGSCs+dHkZ51zwUBVRYPWNc9EMw+KYnEYgDv65AIlkFuK/xVaKV+JpHlfcqEMvyRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:58:21.304378Z","bundle_sha256":"6f845913a2e436dbd81e2b3f4c95cdb33fa38e59c6d4548ed8c7b059a547bc12"}}