{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VXQAHDXIONVUF6WGRMI3WJD2QU","short_pith_number":"pith:VXQAHDXI","canonical_record":{"source":{"id":"1309.5599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-09-22T13:29:48Z","cross_cats_sorted":[],"title_canon_sha256":"613bfd92eac083b10b4256d52a50513cfe4df62414350e85ecf314f9d59a126f","abstract_canon_sha256":"1e3b49591ff5711e0360e17e0ad415ab37e42a539d75453acb04379336cff45b"},"schema_version":"1.0"},"canonical_sha256":"ade0038ee8736b42fac68b11bb247a850367fdb7011060ec69b96ed260a5dc68","source":{"kind":"arxiv","id":"1309.5599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5599","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5599v1","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5599","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"VXQAHDXIONVU","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VXQAHDXIONVUF6WG","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VXQAHDXI","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VXQAHDXIONVUF6WGRMI3WJD2QU","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-09-22T13:29:48Z","cross_cats_sorted":[],"title_canon_sha256":"613bfd92eac083b10b4256d52a50513cfe4df62414350e85ecf314f9d59a126f","abstract_canon_sha256":"1e3b49591ff5711e0360e17e0ad415ab37e42a539d75453acb04379336cff45b"},"schema_version":"1.0"},"canonical_sha256":"ade0038ee8736b42fac68b11bb247a850367fdb7011060ec69b96ed260a5dc68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:03.939423Z","signature_b64":"1FrwALRonj15UsgpzNVrQGeVq6NcSjQHM+1h+AkmIsZADFDueKB1O2+AuycObVnnCuoaHAZMN+yP8RppzmgPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ade0038ee8736b42fac68b11bb247a850367fdb7011060ec69b96ed260a5dc68","last_reissued_at":"2026-05-18T02:55:03.938776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:03.938776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5599","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:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhhhOTAEwWqPRUbnP7v2YDAizQIDTfu08g46Fy1AWgpCJJ+vxpUMc5hR38ihLCnj2KGErtg2IJ3tUWjC8bS4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:42:19.248960Z"},"content_sha256":"b3df75a690114b06165c3177c04e01f0cff09bf7e3f9742ffa327e734b1d4171","schema_version":"1.0","event_id":"sha256:b3df75a690114b06165c3177c04e01f0cff09bf7e3f9742ffa327e734b1d4171"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VXQAHDXIONVUF6WGRMI3WJD2QU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalizing Zeckendorf's Theorem to f-decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Archit Kulkarni, David Moon, Philippe Demontigny, Steven J. Miller, Thao Do, Umang Varma","submitted_at":"2013-09-22T13:29:48Z","abstract_excerpt":"A beautiful theorem of Zeckendorf states that every positive integer can be uniquely decomposed as a sum of non-consecutive Fibonacci numbers $\\{F_n\\}$, where $F_1 = 1$, $F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$. For general recurrences $\\{G_n\\}$ with non-negative coefficients, there is a notion of a legal decomposition which again leads to a unique representation, and the number of summands in the representations of uniformly randomly chosen $m \\in [G_n, G_{n+1})$ converges to a normal distribution as $n \\to \\infty$.\n  We consider the converse question: given a notion of legal decomposition, is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5599","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:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZ6jIJHjsy3giLptHVJ6Ta7bSryYbhfyILGG13u2oIbnC4F4CWFT2wInsoECY6VWK8UNd0VtLdp9AReAvN+RDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:42:19.249640Z"},"content_sha256":"7df65b6bf8ccbcadf06af5467745730f16d20c1c0dca23b4f4a16f582cb13a20","schema_version":"1.0","event_id":"sha256:7df65b6bf8ccbcadf06af5467745730f16d20c1c0dca23b4f4a16f582cb13a20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXQAHDXIONVUF6WGRMI3WJD2QU/bundle.json","state_url":"https://pith.science/pith/VXQAHDXIONVUF6WGRMI3WJD2QU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXQAHDXIONVUF6WGRMI3WJD2QU/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-27T11:42:19Z","links":{"resolver":"https://pith.science/pith/VXQAHDXIONVUF6WGRMI3WJD2QU","bundle":"https://pith.science/pith/VXQAHDXIONVUF6WGRMI3WJD2QU/bundle.json","state":"https://pith.science/pith/VXQAHDXIONVUF6WGRMI3WJD2QU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXQAHDXIONVUF6WGRMI3WJD2QU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VXQAHDXIONVUF6WGRMI3WJD2QU","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":"1e3b49591ff5711e0360e17e0ad415ab37e42a539d75453acb04379336cff45b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-09-22T13:29:48Z","title_canon_sha256":"613bfd92eac083b10b4256d52a50513cfe4df62414350e85ecf314f9d59a126f"},"schema_version":"1.0","source":{"id":"1309.5599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5599","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5599v1","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5599","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"VXQAHDXIONVU","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VXQAHDXIONVUF6WG","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VXQAHDXI","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:7df65b6bf8ccbcadf06af5467745730f16d20c1c0dca23b4f4a16f582cb13a20","target":"graph","created_at":"2026-05-18T02:55: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":"A beautiful theorem of Zeckendorf states that every positive integer can be uniquely decomposed as a sum of non-consecutive Fibonacci numbers $\\{F_n\\}$, where $F_1 = 1$, $F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$. For general recurrences $\\{G_n\\}$ with non-negative coefficients, there is a notion of a legal decomposition which again leads to a unique representation, and the number of summands in the representations of uniformly randomly chosen $m \\in [G_n, G_{n+1})$ converges to a normal distribution as $n \\to \\infty$.\n  We consider the converse question: given a notion of legal decomposition, is","authors_text":"Archit Kulkarni, David Moon, Philippe Demontigny, Steven J. Miller, Thao Do, Umang Varma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-09-22T13:29:48Z","title":"Generalizing Zeckendorf's Theorem to f-decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5599","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:b3df75a690114b06165c3177c04e01f0cff09bf7e3f9742ffa327e734b1d4171","target":"record","created_at":"2026-05-18T02:55: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":"1e3b49591ff5711e0360e17e0ad415ab37e42a539d75453acb04379336cff45b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-09-22T13:29:48Z","title_canon_sha256":"613bfd92eac083b10b4256d52a50513cfe4df62414350e85ecf314f9d59a126f"},"schema_version":"1.0","source":{"id":"1309.5599","kind":"arxiv","version":1}},"canonical_sha256":"ade0038ee8736b42fac68b11bb247a850367fdb7011060ec69b96ed260a5dc68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ade0038ee8736b42fac68b11bb247a850367fdb7011060ec69b96ed260a5dc68","first_computed_at":"2026-05-18T02:55:03.938776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:03.938776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1FrwALRonj15UsgpzNVrQGeVq6NcSjQHM+1h+AkmIsZADFDueKB1O2+AuycObVnnCuoaHAZMN+yP8RppzmgPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:03.939423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3df75a690114b06165c3177c04e01f0cff09bf7e3f9742ffa327e734b1d4171","sha256:7df65b6bf8ccbcadf06af5467745730f16d20c1c0dca23b4f4a16f582cb13a20"],"state_sha256":"d2fa1ef603aeea7b4fa302d4df2559044fb924ad6d2a2166a625258de474aead"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CutIqNPbUB2lnmVuhhF3oT29gtGy9SdFdzX478j2TNv1HoRbt25z7fTqmzjJ3/xgIprZvGxxhThFwgBqpIRFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:42:19.253134Z","bundle_sha256":"09707791b4b71bcb68b9a5a2ebeb935b7eb72eaaea73f72e1b392acf4a9327b3"}}