{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7SN6H3TLYCJUQD2A64GURQOVKN","short_pith_number":"pith:7SN6H3TL","schema_version":"1.0","canonical_sha256":"fc9be3ee6bc093480f40f70d48c1d55365efa08d4425bb6811981b1634bbef54","source":{"kind":"arxiv","id":"1409.0482","version":1},"attestation_state":"computed","paper":{"title":"Benford Behavior of 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, K. Tor, Madeleine Weinstein, Patrick Dynes, Steven J. Miller, Xixi Edelsbrunner","submitted_at":"2014-09-01T17:11:07Z","abstract_excerpt":"A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers $\\{ F_i \\}_{i = 1}^{\\infty}$. A set $S \\subset \\mathbb{Z}$ is said to satisfy Benford's law if the density of the elements in $S$ with leading digit $d$ is $\\log_{10}{(1+\\frac{1}{d})}$; in other words, smaller leading digits are more likely to occur. We prove that, as $n\\to\\infty$, for a randomly selected integer $m$ in $[0, F_{n+1})$ the distribution of the leading digits of the Fibonacci summands in its Zeckendorf decomposition converge to Benford's law almost s"},"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":"1409.0482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-01T17:11:07Z","cross_cats_sorted":[],"title_canon_sha256":"8acb3f6c19596fb9f2fac7c70354a88ef872e224f1aff5414f908508b4b2a66b","abstract_canon_sha256":"a89895dd42ab1568efc1161840228627821f315d8b9c889c1467eb8b23e421e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:52.687478Z","signature_b64":"i0KF+VhpSv/W1pUBIIsLVzZ9i0D5kOjgCBwtdY7H5CC7hn5D4jByWQ0I9KwdR2INt9r2TEjdsUIj2zXYNZeYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc9be3ee6bc093480f40f70d48c1d55365efa08d4425bb6811981b1634bbef54","last_reissued_at":"2026-05-18T02:43:52.687053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:52.687053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benford Behavior of 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, K. Tor, Madeleine Weinstein, Patrick Dynes, Steven J. Miller, Xixi Edelsbrunner","submitted_at":"2014-09-01T17:11:07Z","abstract_excerpt":"A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers $\\{ F_i \\}_{i = 1}^{\\infty}$. A set $S \\subset \\mathbb{Z}$ is said to satisfy Benford's law if the density of the elements in $S$ with leading digit $d$ is $\\log_{10}{(1+\\frac{1}{d})}$; in other words, smaller leading digits are more likely to occur. We prove that, as $n\\to\\infty$, for a randomly selected integer $m$ in $[0, F_{n+1})$ the distribution of the leading digits of the Fibonacci summands in its Zeckendorf decomposition converge to Benford's law almost s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0482","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.0482","created_at":"2026-05-18T02:43:52.687114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0482v1","created_at":"2026-05-18T02:43:52.687114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0482","created_at":"2026-05-18T02:43:52.687114+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SN6H3TLYCJU","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SN6H3TLYCJUQD2A","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SN6H3TL","created_at":"2026-05-18T12:28:19.803747+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/7SN6H3TLYCJUQD2A64GURQOVKN","json":"https://pith.science/pith/7SN6H3TLYCJUQD2A64GURQOVKN.json","graph_json":"https://pith.science/api/pith-number/7SN6H3TLYCJUQD2A64GURQOVKN/graph.json","events_json":"https://pith.science/api/pith-number/7SN6H3TLYCJUQD2A64GURQOVKN/events.json","paper":"https://pith.science/paper/7SN6H3TL"},"agent_actions":{"view_html":"https://pith.science/pith/7SN6H3TLYCJUQD2A64GURQOVKN","download_json":"https://pith.science/pith/7SN6H3TLYCJUQD2A64GURQOVKN.json","view_paper":"https://pith.science/paper/7SN6H3TL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0482&json=true","fetch_graph":"https://pith.science/api/pith-number/7SN6H3TLYCJUQD2A64GURQOVKN/graph.json","fetch_events":"https://pith.science/api/pith-number/7SN6H3TLYCJUQD2A64GURQOVKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SN6H3TLYCJUQD2A64GURQOVKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SN6H3TLYCJUQD2A64GURQOVKN/action/storage_attestation","attest_author":"https://pith.science/pith/7SN6H3TLYCJUQD2A64GURQOVKN/action/author_attestation","sign_citation":"https://pith.science/pith/7SN6H3TLYCJUQD2A64GURQOVKN/action/citation_signature","submit_replication":"https://pith.science/pith/7SN6H3TLYCJUQD2A64GURQOVKN/action/replication_record"}},"created_at":"2026-05-18T02:43:52.687114+00:00","updated_at":"2026-05-18T02:43:52.687114+00:00"}