{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RLOBWGU4GRQZEKAGTWC3RMASXV","short_pith_number":"pith:RLOBWGU4","canonical_record":{"source":{"id":"1907.06931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T10:35:34Z","cross_cats_sorted":[],"title_canon_sha256":"0d43c01a5bd6319dd68f6d88277efadd432844d9a5237737629aa159a1d72b50","abstract_canon_sha256":"3b28126c0e2ed10e8f4482e0f07380860803869c1a0c96e2bf410500ade9058c"},"schema_version":"1.0"},"canonical_sha256":"8adc1b1a9c34619228069d85b8b012bd7e9512c96654c60fe24bc6f4178cc806","source":{"kind":"arxiv","id":"1907.06931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06931","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06931v1","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06931","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"RLOBWGU4GRQZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RLOBWGU4GRQZEKAG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RLOBWGU4","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RLOBWGU4GRQZEKAGTWC3RMASXV","target":"record","payload":{"canonical_record":{"source":{"id":"1907.06931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T10:35:34Z","cross_cats_sorted":[],"title_canon_sha256":"0d43c01a5bd6319dd68f6d88277efadd432844d9a5237737629aa159a1d72b50","abstract_canon_sha256":"3b28126c0e2ed10e8f4482e0f07380860803869c1a0c96e2bf410500ade9058c"},"schema_version":"1.0"},"canonical_sha256":"8adc1b1a9c34619228069d85b8b012bd7e9512c96654c60fe24bc6f4178cc806","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:28.643599Z","signature_b64":"0nt3Vy/ZDDYiFo4AykkrqKuU7F4yrsylosoIljmAABIq91w4Renxogq6whZFX7FU6uBGeK5bNOZ1kPg593ToAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8adc1b1a9c34619228069d85b8b012bd7e9512c96654c60fe24bc6f4178cc806","last_reissued_at":"2026-05-17T23:40:28.642934Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:28.642934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.06931","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:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkXzgJ03/MkzLG5TESbOmrNQPQdFLBSTOC79AM+lGAZtwIOzK6Z4V7dze0ncdUDHOuEfD3pwWE1cEPdDxb4mBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T18:08:32.567795Z"},"content_sha256":"4696433a79eb9f363f6b87dff56490f9417657941c383be27c8c8f2ad7dd4c95","schema_version":"1.0","event_id":"sha256:4696433a79eb9f363f6b87dff56490f9417657941c383be27c8c8f2ad7dd4c95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RLOBWGU4GRQZEKAGTWC3RMASXV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A theorem about partitioning consecutive numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kai Michael Renken","submitted_at":"2019-07-16T10:35:34Z","abstract_excerpt":"In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an interesting statement about triangular numbers, those positive integers which can be partitioned into consecutive numbers beginning at 1. For every partition of a triangular number n into consecutive numbers we can partition the sequence of numbers beginning at 1, adding up to n again, such that every part of this partition adds up to exactly one number of the chose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06931","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:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/3HmI4KnlfLjt9t8Q1xGrxYafYO8G2hxmvnG3LeffmHS+dsPaGml++2oD3pOLxxJwVWgu5OUSpLSqTGNqPJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T18:08:32.568138Z"},"content_sha256":"5695e72ae138c1271e3dad6c40e7b3feff5ff8a1cd42aaf3d6d5232dadbe0ec7","schema_version":"1.0","event_id":"sha256:5695e72ae138c1271e3dad6c40e7b3feff5ff8a1cd42aaf3d6d5232dadbe0ec7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV/bundle.json","state_url":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLOBWGU4GRQZEKAGTWC3RMASXV/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-28T18:08:32Z","links":{"resolver":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV","bundle":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV/bundle.json","state":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLOBWGU4GRQZEKAGTWC3RMASXV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RLOBWGU4GRQZEKAGTWC3RMASXV","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":"3b28126c0e2ed10e8f4482e0f07380860803869c1a0c96e2bf410500ade9058c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T10:35:34Z","title_canon_sha256":"0d43c01a5bd6319dd68f6d88277efadd432844d9a5237737629aa159a1d72b50"},"schema_version":"1.0","source":{"id":"1907.06931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06931","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06931v1","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06931","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"RLOBWGU4GRQZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RLOBWGU4GRQZEKAG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RLOBWGU4","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:5695e72ae138c1271e3dad6c40e7b3feff5ff8a1cd42aaf3d6d5232dadbe0ec7","target":"graph","created_at":"2026-05-17T23:40:28Z","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":"In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an interesting statement about triangular numbers, those positive integers which can be partitioned into consecutive numbers beginning at 1. For every partition of a triangular number n into consecutive numbers we can partition the sequence of numbers beginning at 1, adding up to n again, such that every part of this partition adds up to exactly one number of the chose","authors_text":"Kai Michael Renken","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T10:35:34Z","title":"A theorem about partitioning consecutive numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06931","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:4696433a79eb9f363f6b87dff56490f9417657941c383be27c8c8f2ad7dd4c95","target":"record","created_at":"2026-05-17T23:40:28Z","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":"3b28126c0e2ed10e8f4482e0f07380860803869c1a0c96e2bf410500ade9058c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T10:35:34Z","title_canon_sha256":"0d43c01a5bd6319dd68f6d88277efadd432844d9a5237737629aa159a1d72b50"},"schema_version":"1.0","source":{"id":"1907.06931","kind":"arxiv","version":1}},"canonical_sha256":"8adc1b1a9c34619228069d85b8b012bd7e9512c96654c60fe24bc6f4178cc806","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8adc1b1a9c34619228069d85b8b012bd7e9512c96654c60fe24bc6f4178cc806","first_computed_at":"2026-05-17T23:40:28.642934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:28.642934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0nt3Vy/ZDDYiFo4AykkrqKuU7F4yrsylosoIljmAABIq91w4Renxogq6whZFX7FU6uBGeK5bNOZ1kPg593ToAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:28.643599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4696433a79eb9f363f6b87dff56490f9417657941c383be27c8c8f2ad7dd4c95","sha256:5695e72ae138c1271e3dad6c40e7b3feff5ff8a1cd42aaf3d6d5232dadbe0ec7"],"state_sha256":"3c98bea5499bc34707ff8168f7e72484b82fe98966e9ccf95ac4e44da801785a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QGCftchLl3bmGG85xQeNy664yQUQyxHR+aegLfNcriiWKkhoDN/YkHvk3SWCL0DI23AJx2YETXPYJUWOF31rCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T18:08:32.570123Z","bundle_sha256":"ef147c0e6a4949b5f62c692ab0695d15f44718b083eb422c66f6104b0a115676"}}