{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FDTGHETY5GWN2UHBLY7AVZ5ZAM","short_pith_number":"pith:FDTGHETY","canonical_record":{"source":{"id":"1903.10797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-26T11:07:50Z","cross_cats_sorted":[],"title_canon_sha256":"a724ef3d933fa962adfb7da667c615437eb7d270ef36f4d743e0cbf6d6319766","abstract_canon_sha256":"a9b3d180db1bc8919ca3b518e89d8f00bba3ffca26ffb2e956b779836a1d9477"},"schema_version":"1.0"},"canonical_sha256":"28e6639278e9acdd50e15e3e0ae7b90302887a0857a1b06c9bbb2b88c68072aa","source":{"kind":"arxiv","id":"1903.10797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10797","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10797v1","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10797","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"pith_short_12","alias_value":"FDTGHETY5GWN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FDTGHETY5GWN2UHB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FDTGHETY","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FDTGHETY5GWN2UHBLY7AVZ5ZAM","target":"record","payload":{"canonical_record":{"source":{"id":"1903.10797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-26T11:07:50Z","cross_cats_sorted":[],"title_canon_sha256":"a724ef3d933fa962adfb7da667c615437eb7d270ef36f4d743e0cbf6d6319766","abstract_canon_sha256":"a9b3d180db1bc8919ca3b518e89d8f00bba3ffca26ffb2e956b779836a1d9477"},"schema_version":"1.0"},"canonical_sha256":"28e6639278e9acdd50e15e3e0ae7b90302887a0857a1b06c9bbb2b88c68072aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:17.711607Z","signature_b64":"Hsad4RBLuzB+8oyvYwi+vY0Yi0CTUYFfZ4JMWCC3PjUa8UbqqJN0uHg6yMFxi44R38pPc5cciwdxb96ioCOMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28e6639278e9acdd50e15e3e0ae7b90302887a0857a1b06c9bbb2b88c68072aa","last_reissued_at":"2026-05-17T23:50:17.710854Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:17.710854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.10797","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:50:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+pm8h3SXwyBG7oNtY2Mi65XmqMzdXrdkXX/bZ3ReCfvi3ppq+5FDTx2COoeVLe5tTpMxkuGHxWLoB58rSHWzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:41:38.057906Z"},"content_sha256":"940932736ff6bcff992b51eaa2b6e7a9d8f31c7c0cdc40b146fc370fd4b877e5","schema_version":"1.0","event_id":"sha256:940932736ff6bcff992b51eaa2b6e7a9d8f31c7c0cdc40b146fc370fd4b877e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FDTGHETY5GWN2UHBLY7AVZ5ZAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast algorithm for generating ascending compositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mircea Merca","submitted_at":"2019-03-26T11:07:50Z","abstract_excerpt":"In this paper we give a fast algorithm to generate all partitions of a positive integer $n$. Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. It is known that the ascending composition generation algorithm is substantially more efficient than its descending composition counterpart. Using tree structures for storing the partitions of integers, we develop a new ascending composition generation algorithm which is substantially more efficient than the algorithms from the literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10797","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:50:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BE6GnyytqE2mvfsrwO4VSjwukhu5aQIrwR7LqStmR4h64Js4YDiwSlLbOSZbgUuCWwCwfpDuh6BtnrSRYyjtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:41:38.058533Z"},"content_sha256":"1479d08162518637f77e96052cc9ae02f55ad08a7661366ebb908cc21686e598","schema_version":"1.0","event_id":"sha256:1479d08162518637f77e96052cc9ae02f55ad08a7661366ebb908cc21686e598"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FDTGHETY5GWN2UHBLY7AVZ5ZAM/bundle.json","state_url":"https://pith.science/pith/FDTGHETY5GWN2UHBLY7AVZ5ZAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FDTGHETY5GWN2UHBLY7AVZ5ZAM/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-08T04:41:38Z","links":{"resolver":"https://pith.science/pith/FDTGHETY5GWN2UHBLY7AVZ5ZAM","bundle":"https://pith.science/pith/FDTGHETY5GWN2UHBLY7AVZ5ZAM/bundle.json","state":"https://pith.science/pith/FDTGHETY5GWN2UHBLY7AVZ5ZAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FDTGHETY5GWN2UHBLY7AVZ5ZAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FDTGHETY5GWN2UHBLY7AVZ5ZAM","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":"a9b3d180db1bc8919ca3b518e89d8f00bba3ffca26ffb2e956b779836a1d9477","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-26T11:07:50Z","title_canon_sha256":"a724ef3d933fa962adfb7da667c615437eb7d270ef36f4d743e0cbf6d6319766"},"schema_version":"1.0","source":{"id":"1903.10797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10797","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10797v1","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10797","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"pith_short_12","alias_value":"FDTGHETY5GWN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FDTGHETY5GWN2UHB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FDTGHETY","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:1479d08162518637f77e96052cc9ae02f55ad08a7661366ebb908cc21686e598","target":"graph","created_at":"2026-05-17T23:50:17Z","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 this paper we give a fast algorithm to generate all partitions of a positive integer $n$. Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. It is known that the ascending composition generation algorithm is substantially more efficient than its descending composition counterpart. Using tree structures for storing the partitions of integers, we develop a new ascending composition generation algorithm which is substantially more efficient than the algorithms from the literature.","authors_text":"Mircea Merca","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-26T11:07:50Z","title":"Fast algorithm for generating ascending compositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10797","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:940932736ff6bcff992b51eaa2b6e7a9d8f31c7c0cdc40b146fc370fd4b877e5","target":"record","created_at":"2026-05-17T23:50:17Z","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":"a9b3d180db1bc8919ca3b518e89d8f00bba3ffca26ffb2e956b779836a1d9477","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-26T11:07:50Z","title_canon_sha256":"a724ef3d933fa962adfb7da667c615437eb7d270ef36f4d743e0cbf6d6319766"},"schema_version":"1.0","source":{"id":"1903.10797","kind":"arxiv","version":1}},"canonical_sha256":"28e6639278e9acdd50e15e3e0ae7b90302887a0857a1b06c9bbb2b88c68072aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28e6639278e9acdd50e15e3e0ae7b90302887a0857a1b06c9bbb2b88c68072aa","first_computed_at":"2026-05-17T23:50:17.710854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:17.710854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hsad4RBLuzB+8oyvYwi+vY0Yi0CTUYFfZ4JMWCC3PjUa8UbqqJN0uHg6yMFxi44R38pPc5cciwdxb96ioCOMCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:17.711607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:940932736ff6bcff992b51eaa2b6e7a9d8f31c7c0cdc40b146fc370fd4b877e5","sha256:1479d08162518637f77e96052cc9ae02f55ad08a7661366ebb908cc21686e598"],"state_sha256":"3538a24ca4de927742e26f5bf69808a44d94b2a34c2a2e1aa6e59109536abbbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"14qZnDLM9OE0iTJNbLY9ja/rZM3qhr/obF1vLaxZUgCUM1iGFBT1aoN7uhpfi48Tu9Q+MOokHSgntvYRP0U3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:41:38.061891Z","bundle_sha256":"1422250e1c518e6e06e8978fb3c0243cbc1e3e1e9d2170721623169993d0c0b7"}}