{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XT23PKZWGLHAOJBJPEHZCBI4OA","short_pith_number":"pith:XT23PKZW","canonical_record":{"source":{"id":"1807.03918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-11T01:28:45Z","cross_cats_sorted":[],"title_canon_sha256":"244f37ef9259b4eddaf6f835dd458d9209f94c0d8ceaf6fcb3477a9c786ba93f","abstract_canon_sha256":"8c6aa867f8214c6d3ce8c0789e48ada010bcf8a7330e3686cf7f14255cae704c"},"schema_version":"1.0"},"canonical_sha256":"bcf5b7ab3632ce072429790f91051c700b72340912c429cce3f27c77a7967a56","source":{"kind":"arxiv","id":"1807.03918","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03918","created_at":"2026-05-17T23:54:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03918v1","created_at":"2026-05-17T23:54:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03918","created_at":"2026-05-17T23:54:43Z"},{"alias_kind":"pith_short_12","alias_value":"XT23PKZWGLHA","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XT23PKZWGLHAOJBJ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XT23PKZW","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XT23PKZWGLHAOJBJPEHZCBI4OA","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-11T01:28:45Z","cross_cats_sorted":[],"title_canon_sha256":"244f37ef9259b4eddaf6f835dd458d9209f94c0d8ceaf6fcb3477a9c786ba93f","abstract_canon_sha256":"8c6aa867f8214c6d3ce8c0789e48ada010bcf8a7330e3686cf7f14255cae704c"},"schema_version":"1.0"},"canonical_sha256":"bcf5b7ab3632ce072429790f91051c700b72340912c429cce3f27c77a7967a56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:43.834533Z","signature_b64":"pJsrCZU/4vTSZ+1VqsP4ZO+jzEdXXB3PYzAQnux4i3yTlkasSctgMx7K1U+0IJZS10fgSdu8njb3Ei9UCUs/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcf5b7ab3632ce072429790f91051c700b72340912c429cce3f27c77a7967a56","last_reissued_at":"2026-05-17T23:54:43.833922Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:43.833922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03918","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-17T23:54:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojx6KjfymL0Z0fb9/wXhMQq6obdz8g13s1Lo0G1Yw5hb3a7bvaPwASJ5fVONf4d/BnCwnF2Yi4Ut/1AuWJp9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:00:04.421530Z"},"content_sha256":"605b921152fd27f1f0ffc7f44182b700eba2f36b0e280343fa77c83273f792ba","schema_version":"1.0","event_id":"sha256:605b921152fd27f1f0ffc7f44182b700eba2f36b0e280343fa77c83273f792ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XT23PKZWGLHAOJBJPEHZCBI4OA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bin Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cameron Voigt, Daniel Gotshall, Dawn Nelson, Maria D. Vega, Pamela E. Harris","submitted_at":"2018-07-11T01:28:45Z","abstract_excerpt":"It is well known that every positive integer can be expressed as a sum of nonconsecutive Fibonacci numbers provided the Fibonacci numbers satisfy $F_n =F_{n-1}+F_{n-2}$ for $n\\geq 3$, $F_1 =1$ and $F_2 =2$. In this paper, for any $n,m\\in\\mathbb{N}$ we create a sequence called the $(n,m)$-bin sequence with which we can define a notion of a legal decomposition for every positive integer. These sequences are not always positive linear recurrences, which have been studied in the literature, yet we prove, that like positive linear recurrences, these decompositions exist and are unique. Moreover, ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03918","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-17T23:54:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26Mp9jRJHz5C8Jg26t0ceppJQZhtU071ITqEcQtzyLcs9RTBjqLsEJi1YhT0nTKyJNw9b7IiMiiEgVHk+yq3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:00:04.421874Z"},"content_sha256":"6c83b05d558134a60dc724ef2505c2342f6e8fc5187566f42fa690170271922f","schema_version":"1.0","event_id":"sha256:6c83b05d558134a60dc724ef2505c2342f6e8fc5187566f42fa690170271922f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XT23PKZWGLHAOJBJPEHZCBI4OA/bundle.json","state_url":"https://pith.science/pith/XT23PKZWGLHAOJBJPEHZCBI4OA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XT23PKZWGLHAOJBJPEHZCBI4OA/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-28T03:00:04Z","links":{"resolver":"https://pith.science/pith/XT23PKZWGLHAOJBJPEHZCBI4OA","bundle":"https://pith.science/pith/XT23PKZWGLHAOJBJPEHZCBI4OA/bundle.json","state":"https://pith.science/pith/XT23PKZWGLHAOJBJPEHZCBI4OA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XT23PKZWGLHAOJBJPEHZCBI4OA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XT23PKZWGLHAOJBJPEHZCBI4OA","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":"8c6aa867f8214c6d3ce8c0789e48ada010bcf8a7330e3686cf7f14255cae704c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-11T01:28:45Z","title_canon_sha256":"244f37ef9259b4eddaf6f835dd458d9209f94c0d8ceaf6fcb3477a9c786ba93f"},"schema_version":"1.0","source":{"id":"1807.03918","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03918","created_at":"2026-05-17T23:54:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03918v1","created_at":"2026-05-17T23:54:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03918","created_at":"2026-05-17T23:54:43Z"},{"alias_kind":"pith_short_12","alias_value":"XT23PKZWGLHA","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XT23PKZWGLHAOJBJ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XT23PKZW","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:6c83b05d558134a60dc724ef2505c2342f6e8fc5187566f42fa690170271922f","target":"graph","created_at":"2026-05-17T23:54:43Z","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":"It is well known that every positive integer can be expressed as a sum of nonconsecutive Fibonacci numbers provided the Fibonacci numbers satisfy $F_n =F_{n-1}+F_{n-2}$ for $n\\geq 3$, $F_1 =1$ and $F_2 =2$. In this paper, for any $n,m\\in\\mathbb{N}$ we create a sequence called the $(n,m)$-bin sequence with which we can define a notion of a legal decomposition for every positive integer. These sequences are not always positive linear recurrences, which have been studied in the literature, yet we prove, that like positive linear recurrences, these decompositions exist and are unique. Moreover, ou","authors_text":"Cameron Voigt, Daniel Gotshall, Dawn Nelson, Maria D. Vega, Pamela E. Harris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-11T01:28:45Z","title":"Bin Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03918","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:605b921152fd27f1f0ffc7f44182b700eba2f36b0e280343fa77c83273f792ba","target":"record","created_at":"2026-05-17T23:54:43Z","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":"8c6aa867f8214c6d3ce8c0789e48ada010bcf8a7330e3686cf7f14255cae704c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-11T01:28:45Z","title_canon_sha256":"244f37ef9259b4eddaf6f835dd458d9209f94c0d8ceaf6fcb3477a9c786ba93f"},"schema_version":"1.0","source":{"id":"1807.03918","kind":"arxiv","version":1}},"canonical_sha256":"bcf5b7ab3632ce072429790f91051c700b72340912c429cce3f27c77a7967a56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcf5b7ab3632ce072429790f91051c700b72340912c429cce3f27c77a7967a56","first_computed_at":"2026-05-17T23:54:43.833922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:43.833922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pJsrCZU/4vTSZ+1VqsP4ZO+jzEdXXB3PYzAQnux4i3yTlkasSctgMx7K1U+0IJZS10fgSdu8njb3Ei9UCUs/BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:43.834533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03918","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:605b921152fd27f1f0ffc7f44182b700eba2f36b0e280343fa77c83273f792ba","sha256:6c83b05d558134a60dc724ef2505c2342f6e8fc5187566f42fa690170271922f"],"state_sha256":"350373b9e2bc371fabc5047ef4a15a2e89a3849cef41188e00715417e29844ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhdPY+CTrk+CVY/cfYSDZ0V3auwgEVvME20SYKvIBQ+Qv8FbAXIdGLxAKDN+t0m6LYhzcBfRZCNE52yjxpuQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:00:04.424102Z","bundle_sha256":"cfb3d99e94dfc78a34b69fdf014e1a2231a58edd220026ae6f3e95138094be19"}}