{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RLOBWGU4GRQZEKAGTWC3RMASXV","short_pith_number":"pith:RLOBWGU4","schema_version":"1.0","canonical_sha256":"8adc1b1a9c34619228069d85b8b012bd7e9512c96654c60fe24bc6f4178cc806","source":{"kind":"arxiv","id":"1907.06931","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.06931","created_at":"2026-05-17T23:40:28.643031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06931v1","created_at":"2026-05-17T23:40:28.643031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06931","created_at":"2026-05-17T23:40:28.643031+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLOBWGU4GRQZ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLOBWGU4GRQZEKAG","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLOBWGU4","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV","json":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV.json","graph_json":"https://pith.science/api/pith-number/RLOBWGU4GRQZEKAGTWC3RMASXV/graph.json","events_json":"https://pith.science/api/pith-number/RLOBWGU4GRQZEKAGTWC3RMASXV/events.json","paper":"https://pith.science/paper/RLOBWGU4"},"agent_actions":{"view_html":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV","download_json":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV.json","view_paper":"https://pith.science/paper/RLOBWGU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06931&json=true","fetch_graph":"https://pith.science/api/pith-number/RLOBWGU4GRQZEKAGTWC3RMASXV/graph.json","fetch_events":"https://pith.science/api/pith-number/RLOBWGU4GRQZEKAGTWC3RMASXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV/action/storage_attestation","attest_author":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV/action/author_attestation","sign_citation":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV/action/citation_signature","submit_replication":"https://pith.science/pith/RLOBWGU4GRQZEKAGTWC3RMASXV/action/replication_record"}},"created_at":"2026-05-17T23:40:28.643031+00:00","updated_at":"2026-05-17T23:40:28.643031+00:00"}