{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:R6LD2VWXWJG4DAT36JJJ2ZMZLO","short_pith_number":"pith:R6LD2VWX","canonical_record":{"source":{"id":"1009.4214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-21T20:59:51Z","cross_cats_sorted":[],"title_canon_sha256":"7706677737db9a9262740be0a97ed3ea29f2f926671212d9e5393aa8ae53c545","abstract_canon_sha256":"ed989bb1b2365d0a0db9f6653cfd6a55c1a6ccdec887e9d634ea1ecb3b3109ae"},"schema_version":"1.0"},"canonical_sha256":"8f963d56d7b24dc1827bf2529d65995baeb76bbc737de38ab37e34c7e6989c88","source":{"kind":"arxiv","id":"1009.4214","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4214","created_at":"2026-05-18T04:40:08Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4214v2","created_at":"2026-05-18T04:40:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4214","created_at":"2026-05-18T04:40:08Z"},{"alias_kind":"pith_short_12","alias_value":"R6LD2VWXWJG4","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R6LD2VWXWJG4DAT3","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R6LD2VWX","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:R6LD2VWXWJG4DAT36JJJ2ZMZLO","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-21T20:59:51Z","cross_cats_sorted":[],"title_canon_sha256":"7706677737db9a9262740be0a97ed3ea29f2f926671212d9e5393aa8ae53c545","abstract_canon_sha256":"ed989bb1b2365d0a0db9f6653cfd6a55c1a6ccdec887e9d634ea1ecb3b3109ae"},"schema_version":"1.0"},"canonical_sha256":"8f963d56d7b24dc1827bf2529d65995baeb76bbc737de38ab37e34c7e6989c88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:08.044681Z","signature_b64":"/zjXC3BKRKKV3jWmyXochAAxa9bKxd0oKivmYS4HjlOEAGTx8gMM1dwpIUU5UaWTZFSi13yzTALRTf+S3pACCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f963d56d7b24dc1827bf2529d65995baeb76bbc737de38ab37e34c7e6989c88","last_reissued_at":"2026-05-18T04:40:08.044003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:08.044003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4214","source_version":2,"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-18T04:40:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Y64k9nL5e4ZK0cw3gfxfHj4J62jy69hIIO6LSMWCmnJesPQ7KA56fhMGdx2PTkOiFErnLma3elw17LjETU2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:05:18.097784Z"},"content_sha256":"a371de79e366f870fd67f5bc125785aad321009a4a756f6262975252946eb943","schema_version":"1.0","event_id":"sha256:a371de79e366f870fd67f5bc125785aad321009a4a756f6262975252946eb943"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:R6LD2VWXWJG4DAT36JJJ2ZMZLO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Versatile Algorithm to Generate Various Combinatorial Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pramod Ganapathi, Rama B","submitted_at":"2010-09-21T20:59:51Z","abstract_excerpt":"Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which possibly contains repetitions, taking some or all of the elements at a time, in any imposed order. The algorithm uses an auxiliary array that maintains the number of occurrences of each unique element in the input list. We provide a proof of correctness of the algorithm. We then show how one can efficiently generate other combinatorial structures like combinat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4214","kind":"arxiv","version":2},"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-18T04:40:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGwDw/3HAa1/av/rabPuOLvCBrWHa42Iv75ymcDjHWuffyZKC0bWKiqlbAJWUPu+iDZGK7alkQ3UTrS8FPKzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:05:18.098671Z"},"content_sha256":"de87cfd608a7996517b34c822b7f5be5c2faf543d6e7a8c70b415e8ad5063447","schema_version":"1.0","event_id":"sha256:de87cfd608a7996517b34c822b7f5be5c2faf543d6e7a8c70b415e8ad5063447"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6LD2VWXWJG4DAT36JJJ2ZMZLO/bundle.json","state_url":"https://pith.science/pith/R6LD2VWXWJG4DAT36JJJ2ZMZLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6LD2VWXWJG4DAT36JJJ2ZMZLO/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-08-22T08:05:18Z","links":{"resolver":"https://pith.science/pith/R6LD2VWXWJG4DAT36JJJ2ZMZLO","bundle":"https://pith.science/pith/R6LD2VWXWJG4DAT36JJJ2ZMZLO/bundle.json","state":"https://pith.science/pith/R6LD2VWXWJG4DAT36JJJ2ZMZLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6LD2VWXWJG4DAT36JJJ2ZMZLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:R6LD2VWXWJG4DAT36JJJ2ZMZLO","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":"ed989bb1b2365d0a0db9f6653cfd6a55c1a6ccdec887e9d634ea1ecb3b3109ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-21T20:59:51Z","title_canon_sha256":"7706677737db9a9262740be0a97ed3ea29f2f926671212d9e5393aa8ae53c545"},"schema_version":"1.0","source":{"id":"1009.4214","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4214","created_at":"2026-05-18T04:40:08Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4214v2","created_at":"2026-05-18T04:40:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4214","created_at":"2026-05-18T04:40:08Z"},{"alias_kind":"pith_short_12","alias_value":"R6LD2VWXWJG4","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R6LD2VWXWJG4DAT3","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R6LD2VWX","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:de87cfd608a7996517b34c822b7f5be5c2faf543d6e7a8c70b415e8ad5063447","target":"graph","created_at":"2026-05-18T04:40:08Z","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":"Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which possibly contains repetitions, taking some or all of the elements at a time, in any imposed order. The algorithm uses an auxiliary array that maintains the number of occurrences of each unique element in the input list. We provide a proof of correctness of the algorithm. We then show how one can efficiently generate other combinatorial structures like combinat","authors_text":"Pramod Ganapathi, Rama B","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-21T20:59:51Z","title":"A Versatile Algorithm to Generate Various Combinatorial Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4214","kind":"arxiv","version":2},"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:a371de79e366f870fd67f5bc125785aad321009a4a756f6262975252946eb943","target":"record","created_at":"2026-05-18T04:40:08Z","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":"ed989bb1b2365d0a0db9f6653cfd6a55c1a6ccdec887e9d634ea1ecb3b3109ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-21T20:59:51Z","title_canon_sha256":"7706677737db9a9262740be0a97ed3ea29f2f926671212d9e5393aa8ae53c545"},"schema_version":"1.0","source":{"id":"1009.4214","kind":"arxiv","version":2}},"canonical_sha256":"8f963d56d7b24dc1827bf2529d65995baeb76bbc737de38ab37e34c7e6989c88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f963d56d7b24dc1827bf2529d65995baeb76bbc737de38ab37e34c7e6989c88","first_computed_at":"2026-05-18T04:40:08.044003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:08.044003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/zjXC3BKRKKV3jWmyXochAAxa9bKxd0oKivmYS4HjlOEAGTx8gMM1dwpIUU5UaWTZFSi13yzTALRTf+S3pACCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:08.044681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4214","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a371de79e366f870fd67f5bc125785aad321009a4a756f6262975252946eb943","sha256:de87cfd608a7996517b34c822b7f5be5c2faf543d6e7a8c70b415e8ad5063447"],"state_sha256":"eab3151a81e03563c20be1968ef78155259c1369795c4ab86a18d7f560256957"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cYcl9xol+F9CENnil9zN+hJbEzNYwAILx5t7RKWfIkUCpKjvq/qmewickD1bxdJxrAdes2HRLhcaq0L9+3tDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T08:05:18.105191Z","bundle_sha256":"b91fd92aa5095127335a011a954c5a893e354fdcc6ca84eaea21a81aeba56940"}}