{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:W43EDQQIJ5PK42Y2KMLGNHW7UH","short_pith_number":"pith:W43EDQQI","canonical_record":{"source":{"id":"1008.3204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-08-19T03:00:51Z","cross_cats_sorted":[],"title_canon_sha256":"927310da03ba649564ba43db9655bcfb41d3dd5ba187af5482671ebba1e7500f","abstract_canon_sha256":"58fc35c41945807f16b473accb743084ab110f6ea987db46ef591d98324fc110"},"schema_version":"1.0"},"canonical_sha256":"b73641c2084f5eae6b1a5316669edfa1f36ece04ab69b403844ed1b70f45fbba","source":{"kind":"arxiv","id":"1008.3204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3204","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3204v1","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3204","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"W43EDQQIJ5PK","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"W43EDQQIJ5PK42Y2","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"W43EDQQI","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:W43EDQQIJ5PK42Y2KMLGNHW7UH","target":"record","payload":{"canonical_record":{"source":{"id":"1008.3204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-08-19T03:00:51Z","cross_cats_sorted":[],"title_canon_sha256":"927310da03ba649564ba43db9655bcfb41d3dd5ba187af5482671ebba1e7500f","abstract_canon_sha256":"58fc35c41945807f16b473accb743084ab110f6ea987db46ef591d98324fc110"},"schema_version":"1.0"},"canonical_sha256":"b73641c2084f5eae6b1a5316669edfa1f36ece04ab69b403844ed1b70f45fbba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.136100Z","signature_b64":"prWdnpS7BaQac1RFmbvIyEu9tPqWh3fLB8CYHvNtXre9//ji/kf1bnlRODJFYpWfnwwxzMLUx4fLAXkAarBJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b73641c2084f5eae6b1a5316669edfa1f36ece04ab69b403844ed1b70f45fbba","last_reissued_at":"2026-05-18T04:42:03.135628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.135628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.3204","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-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Smt2+vNqmqLuEnRDhXQdTRXe3wSX2LtpLzxEQiSCbGJi7jmN75j3LhGOuOCp6ktMOecfcoDNJ4sasz42xPITCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:55:24.007290Z"},"content_sha256":"d9477b7147bdb7a67e1708955fcdb2aa8d6ffebbbc22da252b957483c13867d4","schema_version":"1.0","event_id":"sha256:d9477b7147bdb7a67e1708955fcdb2aa8d6ffebbbc22da252b957483c13867d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:W43EDQQIJ5PK42Y2KMLGNHW7UH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of summands in Zeckendorf decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Gene Kopp, Murat Kologlu, Steven J. Miller, Yinghui Wang","submitted_at":"2010-08-19T03:00:51Z","abstract_excerpt":"Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. Once this has been shown, it's natural to ask how many summands are needed. Using a continued fraction approach, Lekkerkerker proved that the average number of such summands needed for integers in $[F_n, F_{n+1})$ is $n / (\\varphi^2 + 1) + O(1)$, where $\\varphi = \\frac{1+\\sqrt{5}}2$ is the golden mean. Surprisingly, no one appears to have investigated the distribution of the number of summands; our main result is that this converges to a Gaussian as $n\\to\\infty$. Moreover, s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3204","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-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fqcMQoeBuR1BGKNIJZkZfk9lnEYDTyXUuF6KofDX5SNnGUbADWlYnswSScnO/udcj1jbgeRT3ynBo90v0Qu9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:55:24.007673Z"},"content_sha256":"3e00b7d54cdd1c2b2b19893dec1cff57cdd8d0d02cbc456458899d9f31a43af7","schema_version":"1.0","event_id":"sha256:3e00b7d54cdd1c2b2b19893dec1cff57cdd8d0d02cbc456458899d9f31a43af7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W43EDQQIJ5PK42Y2KMLGNHW7UH/bundle.json","state_url":"https://pith.science/pith/W43EDQQIJ5PK42Y2KMLGNHW7UH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W43EDQQIJ5PK42Y2KMLGNHW7UH/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-30T18:55:24Z","links":{"resolver":"https://pith.science/pith/W43EDQQIJ5PK42Y2KMLGNHW7UH","bundle":"https://pith.science/pith/W43EDQQIJ5PK42Y2KMLGNHW7UH/bundle.json","state":"https://pith.science/pith/W43EDQQIJ5PK42Y2KMLGNHW7UH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W43EDQQIJ5PK42Y2KMLGNHW7UH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:W43EDQQIJ5PK42Y2KMLGNHW7UH","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":"58fc35c41945807f16b473accb743084ab110f6ea987db46ef591d98324fc110","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-08-19T03:00:51Z","title_canon_sha256":"927310da03ba649564ba43db9655bcfb41d3dd5ba187af5482671ebba1e7500f"},"schema_version":"1.0","source":{"id":"1008.3204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3204","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3204v1","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3204","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"W43EDQQIJ5PK","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"W43EDQQIJ5PK42Y2","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"W43EDQQI","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:3e00b7d54cdd1c2b2b19893dec1cff57cdd8d0d02cbc456458899d9f31a43af7","target":"graph","created_at":"2026-05-18T04:42:03Z","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 has a unique representation as a sum of non-consecutive Fibonacci numbers. Once this has been shown, it's natural to ask how many summands are needed. Using a continued fraction approach, Lekkerkerker proved that the average number of such summands needed for integers in $[F_n, F_{n+1})$ is $n / (\\varphi^2 + 1) + O(1)$, where $\\varphi = \\frac{1+\\sqrt{5}}2$ is the golden mean. Surprisingly, no one appears to have investigated the distribution of the number of summands; our main result is that this converges to a Gaussian as $n\\to\\infty$. Moreover, s","authors_text":"Gene Kopp, Murat Kologlu, Steven J. Miller, Yinghui Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-08-19T03:00:51Z","title":"On the number of summands in Zeckendorf decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3204","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:d9477b7147bdb7a67e1708955fcdb2aa8d6ffebbbc22da252b957483c13867d4","target":"record","created_at":"2026-05-18T04:42:03Z","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":"58fc35c41945807f16b473accb743084ab110f6ea987db46ef591d98324fc110","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-08-19T03:00:51Z","title_canon_sha256":"927310da03ba649564ba43db9655bcfb41d3dd5ba187af5482671ebba1e7500f"},"schema_version":"1.0","source":{"id":"1008.3204","kind":"arxiv","version":1}},"canonical_sha256":"b73641c2084f5eae6b1a5316669edfa1f36ece04ab69b403844ed1b70f45fbba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b73641c2084f5eae6b1a5316669edfa1f36ece04ab69b403844ed1b70f45fbba","first_computed_at":"2026-05-18T04:42:03.135628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:03.135628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"prWdnpS7BaQac1RFmbvIyEu9tPqWh3fLB8CYHvNtXre9//ji/kf1bnlRODJFYpWfnwwxzMLUx4fLAXkAarBJBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:03.136100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9477b7147bdb7a67e1708955fcdb2aa8d6ffebbbc22da252b957483c13867d4","sha256:3e00b7d54cdd1c2b2b19893dec1cff57cdd8d0d02cbc456458899d9f31a43af7"],"state_sha256":"18ca7aaf96861a6795e050cd662eaf616365193969b1f40bea2f3f5a60ef1945"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7jRMSIV64zEFQzSs0OGpm6m7w1/LVq0P31wDCPx6xRBwEzKOx9fYPnWk2my/0wSNwYpnr2LYJwG6jryf2nzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T18:55:24.009860Z","bundle_sha256":"140e7e2e183238483de03b1a989be4c797c79c4b0e4c3e003edecc153e3282de"}}