{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6SGT2RYPT5D7WYHPPZSKEZ6JDA","short_pith_number":"pith:6SGT2RYP","canonical_record":{"source":{"id":"1608.08764","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-31T08:23:38Z","cross_cats_sorted":[],"title_canon_sha256":"b3657507c2cc2197b938debe095a2291a576a540088ddeb1840e9eca91c62955","abstract_canon_sha256":"1a916444f2ec3a6d2a4b66d5ac4d2246a510a246606bec638eeccf1ff3b0e689"},"schema_version":"1.0"},"canonical_sha256":"f48d3d470f9f47fb60ef7e64a267c9181367eed025d7e171d9e00265c824899f","source":{"kind":"arxiv","id":"1608.08764","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08764","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08764v4","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08764","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"6SGT2RYPT5D7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6SGT2RYPT5D7WYHP","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6SGT2RYP","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6SGT2RYPT5D7WYHPPZSKEZ6JDA","target":"record","payload":{"canonical_record":{"source":{"id":"1608.08764","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-31T08:23:38Z","cross_cats_sorted":[],"title_canon_sha256":"b3657507c2cc2197b938debe095a2291a576a540088ddeb1840e9eca91c62955","abstract_canon_sha256":"1a916444f2ec3a6d2a4b66d5ac4d2246a510a246606bec638eeccf1ff3b0e689"},"schema_version":"1.0"},"canonical_sha256":"f48d3d470f9f47fb60ef7e64a267c9181367eed025d7e171d9e00265c824899f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:25.320573Z","signature_b64":"UTsyOUq8l1Gh/5q06GKZwvRmCxrWgict+ZjteKXER1y09ALDqRgqjA72ZPw7NvdR7Ekqx6g0XKi47pcwS1Z3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f48d3d470f9f47fb60ef7e64a267c9181367eed025d7e171d9e00265c824899f","last_reissued_at":"2026-05-18T00:03:25.320150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:25.320150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.08764","source_version":4,"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-18T00:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTHmcApA79PoT3tN5KxgmxnomAmEixRG2PtLm/W3aAjUEUAj6AF3LVRHGepO5htboFyToTuxAo4q2NeUFlhJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:04:01.281870Z"},"content_sha256":"cc1c2b1b0421c5d593f6c4bf581de03b1ec25b4bbbc0f09dcfe50bf04db8387d","schema_version":"1.0","event_id":"sha256:cc1c2b1b0421c5d593f6c4bf581de03b1ec25b4bbbc0f09dcfe50bf04db8387d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6SGT2RYPT5D7WYHPPZSKEZ6JDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Summand minimality and asymptotic convergence of generalized Zeckendorf decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Carsten Peterson, Chi Huynh, Katherine Cordwell, Max Hlavacek, Steven J. Miller, Yen Nhi Truong Vu","submitted_at":"2016-08-31T08:23:38Z","abstract_excerpt":"Given a recurrence sequence $H$, with $H_n = c_1 H_{n-1} + \\dots + c_t H_{n-t}$ where $c_i \\in \\mathbb{N}_0$ for all $i$ and $c_1, c_t \\geq 1$, the generalized Zeckendorf decomposition (gzd) of $m \\in \\mathbb{N}_0$ is the unique representation of $m$ using $H$ composed of blocks lexicographically less than $\\sigma = (c_1, \\dots, c_t)$. We prove that the gzd of $m$ uses the fewest number of summands among all representations of $m$ using $H$, for all $m$, if and only if $\\sigma$ is weakly decreasing. We develop an algorithm for moving from any representation of $m$ to the gzd, the analysis of w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08764","kind":"arxiv","version":4},"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-18T00:03:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mIQgD6XiuxWu05sq4MsFjLW1PV6mRVGEvnREoNyk0/6oBLj5Xvu6th34DCb7adl9Z0tjoRl5bqaMK9PUuoesDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:04:01.282712Z"},"content_sha256":"b9427a555f552352d735e8f6f43ca321f9c641ddfa3ef25dcca0b73bd563c874","schema_version":"1.0","event_id":"sha256:b9427a555f552352d735e8f6f43ca321f9c641ddfa3ef25dcca0b73bd563c874"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SGT2RYPT5D7WYHPPZSKEZ6JDA/bundle.json","state_url":"https://pith.science/pith/6SGT2RYPT5D7WYHPPZSKEZ6JDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SGT2RYPT5D7WYHPPZSKEZ6JDA/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-31T19:04:01Z","links":{"resolver":"https://pith.science/pith/6SGT2RYPT5D7WYHPPZSKEZ6JDA","bundle":"https://pith.science/pith/6SGT2RYPT5D7WYHPPZSKEZ6JDA/bundle.json","state":"https://pith.science/pith/6SGT2RYPT5D7WYHPPZSKEZ6JDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SGT2RYPT5D7WYHPPZSKEZ6JDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6SGT2RYPT5D7WYHPPZSKEZ6JDA","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":"1a916444f2ec3a6d2a4b66d5ac4d2246a510a246606bec638eeccf1ff3b0e689","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-31T08:23:38Z","title_canon_sha256":"b3657507c2cc2197b938debe095a2291a576a540088ddeb1840e9eca91c62955"},"schema_version":"1.0","source":{"id":"1608.08764","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08764","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08764v4","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08764","created_at":"2026-05-18T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"6SGT2RYPT5D7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6SGT2RYPT5D7WYHP","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6SGT2RYP","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:b9427a555f552352d735e8f6f43ca321f9c641ddfa3ef25dcca0b73bd563c874","target":"graph","created_at":"2026-05-18T00:03:25Z","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":"Given a recurrence sequence $H$, with $H_n = c_1 H_{n-1} + \\dots + c_t H_{n-t}$ where $c_i \\in \\mathbb{N}_0$ for all $i$ and $c_1, c_t \\geq 1$, the generalized Zeckendorf decomposition (gzd) of $m \\in \\mathbb{N}_0$ is the unique representation of $m$ using $H$ composed of blocks lexicographically less than $\\sigma = (c_1, \\dots, c_t)$. We prove that the gzd of $m$ uses the fewest number of summands among all representations of $m$ using $H$, for all $m$, if and only if $\\sigma$ is weakly decreasing. We develop an algorithm for moving from any representation of $m$ to the gzd, the analysis of w","authors_text":"Carsten Peterson, Chi Huynh, Katherine Cordwell, Max Hlavacek, Steven J. Miller, Yen Nhi Truong Vu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-31T08:23:38Z","title":"Summand minimality and asymptotic convergence of generalized Zeckendorf decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08764","kind":"arxiv","version":4},"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:cc1c2b1b0421c5d593f6c4bf581de03b1ec25b4bbbc0f09dcfe50bf04db8387d","target":"record","created_at":"2026-05-18T00:03:25Z","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":"1a916444f2ec3a6d2a4b66d5ac4d2246a510a246606bec638eeccf1ff3b0e689","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-08-31T08:23:38Z","title_canon_sha256":"b3657507c2cc2197b938debe095a2291a576a540088ddeb1840e9eca91c62955"},"schema_version":"1.0","source":{"id":"1608.08764","kind":"arxiv","version":4}},"canonical_sha256":"f48d3d470f9f47fb60ef7e64a267c9181367eed025d7e171d9e00265c824899f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f48d3d470f9f47fb60ef7e64a267c9181367eed025d7e171d9e00265c824899f","first_computed_at":"2026-05-18T00:03:25.320150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:25.320150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UTsyOUq8l1Gh/5q06GKZwvRmCxrWgict+ZjteKXER1y09ALDqRgqjA72ZPw7NvdR7Ekqx6g0XKi47pcwS1Z3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:25.320573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08764","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc1c2b1b0421c5d593f6c4bf581de03b1ec25b4bbbc0f09dcfe50bf04db8387d","sha256:b9427a555f552352d735e8f6f43ca321f9c641ddfa3ef25dcca0b73bd563c874"],"state_sha256":"406e0a73fc0dd4d63306dcea6a373a9413c143a32eab427f5ed3302890d8701b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P56XHMOio7BX9YRZPcOuVAcSVNgxL4/1NZYl5H/F18tRRiFZR8iisQpY/rzwOITbt6TqJ+DyxIAtg5LENTjcBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:04:01.287119Z","bundle_sha256":"bf6e39a85fe3eb45e6f71ee2531db29e3f50c4cee9522dd16aff1705c712c2b4"}}