{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MN2VWHRD6MANXQ3W53KRMVE5UF","short_pith_number":"pith:MN2VWHRD","schema_version":"1.0","canonical_sha256":"63755b1e23f300dbc376eed516549da16fed4690924598431bae43b1238c8277","source":{"kind":"arxiv","id":"1409.0483","version":1},"attestation_state":"computed","paper":{"title":"Gaussian Behavior of the Number of Summands in Zeckendorf Decompositions in Small Intervals","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:30Z","abstract_excerpt":"Zeckendorf's theorem states that every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers ${F_n}$, with initial terms $F_1 = 1, F_2 = 2$. We consider the distribution of the number of summands involved in such decompositions. Previous work proved that as $n \\to \\infty$ the distribution of the number of summands in the Zeckendorf decompositions of $m \\in [F_n, F_{n+1})$, appropriately normalized, converges to the standard normal. The proofs crucially used the fact that all integers in $[F_n, F_{n+1})$ share the same potential summands.\n  We generalize these r"},"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.0483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-01T17:11:30Z","cross_cats_sorted":[],"title_canon_sha256":"9cbee68b117ac7d9d049d08d73c1694d73c08e3c6a8888d978be9e9ed7622ba4","abstract_canon_sha256":"e188714918221bb09b7409f6160b3103c85542bd882c78b2b95b313a99916253"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:52.681532Z","signature_b64":"u+9bgk5MgtzqGzyDk+HHeKnV8lC/Fc+eFKH1OlbOG4Zv2lGId4MJyMStQe/7yC67LA1bwlk/TYb3Ewmt8NZQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63755b1e23f300dbc376eed516549da16fed4690924598431bae43b1238c8277","last_reissued_at":"2026-05-18T02:43:52.681104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:52.681104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gaussian Behavior of the Number of Summands in Zeckendorf Decompositions in Small Intervals","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:30Z","abstract_excerpt":"Zeckendorf's theorem states that every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers ${F_n}$, with initial terms $F_1 = 1, F_2 = 2$. We consider the distribution of the number of summands involved in such decompositions. Previous work proved that as $n \\to \\infty$ the distribution of the number of summands in the Zeckendorf decompositions of $m \\in [F_n, F_{n+1})$, appropriately normalized, converges to the standard normal. The proofs crucially used the fact that all integers in $[F_n, F_{n+1})$ share the same potential summands.\n  We generalize these r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0483","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.0483","created_at":"2026-05-18T02:43:52.681161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0483v1","created_at":"2026-05-18T02:43:52.681161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0483","created_at":"2026-05-18T02:43:52.681161+00:00"},{"alias_kind":"pith_short_12","alias_value":"MN2VWHRD6MAN","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MN2VWHRD6MANXQ3W","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MN2VWHRD","created_at":"2026-05-18T12:28:38.356838+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/MN2VWHRD6MANXQ3W53KRMVE5UF","json":"https://pith.science/pith/MN2VWHRD6MANXQ3W53KRMVE5UF.json","graph_json":"https://pith.science/api/pith-number/MN2VWHRD6MANXQ3W53KRMVE5UF/graph.json","events_json":"https://pith.science/api/pith-number/MN2VWHRD6MANXQ3W53KRMVE5UF/events.json","paper":"https://pith.science/paper/MN2VWHRD"},"agent_actions":{"view_html":"https://pith.science/pith/MN2VWHRD6MANXQ3W53KRMVE5UF","download_json":"https://pith.science/pith/MN2VWHRD6MANXQ3W53KRMVE5UF.json","view_paper":"https://pith.science/paper/MN2VWHRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0483&json=true","fetch_graph":"https://pith.science/api/pith-number/MN2VWHRD6MANXQ3W53KRMVE5UF/graph.json","fetch_events":"https://pith.science/api/pith-number/MN2VWHRD6MANXQ3W53KRMVE5UF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MN2VWHRD6MANXQ3W53KRMVE5UF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MN2VWHRD6MANXQ3W53KRMVE5UF/action/storage_attestation","attest_author":"https://pith.science/pith/MN2VWHRD6MANXQ3W53KRMVE5UF/action/author_attestation","sign_citation":"https://pith.science/pith/MN2VWHRD6MANXQ3W53KRMVE5UF/action/citation_signature","submit_replication":"https://pith.science/pith/MN2VWHRD6MANXQ3W53KRMVE5UF/action/replication_record"}},"created_at":"2026-05-18T02:43:52.681161+00:00","updated_at":"2026-05-18T02:43:52.681161+00:00"}