{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HMW2NS3PB574O27OMKNYCR3YXY","short_pith_number":"pith:HMW2NS3P","canonical_record":{"source":{"id":"1612.01693","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-06T08:02:57Z","cross_cats_sorted":[],"title_canon_sha256":"495fa2fc17fe309f0315dbf1aeb24db08a12ad0c20d5135323f1591a669a306a","abstract_canon_sha256":"3d36a788062c1d8c0cb2572cf9aa030483b91e74b24c6f204d058efb3f254bfb"},"schema_version":"1.0"},"canonical_sha256":"3b2da6cb6f0f7fc76bee629b814778be0b475a158b080bfa1607f104ed8e2a03","source":{"kind":"arxiv","id":"1612.01693","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01693","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01693v3","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01693","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"HMW2NS3PB574","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HMW2NS3PB574O27O","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HMW2NS3P","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HMW2NS3PB574O27OMKNYCR3YXY","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01693","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-06T08:02:57Z","cross_cats_sorted":[],"title_canon_sha256":"495fa2fc17fe309f0315dbf1aeb24db08a12ad0c20d5135323f1591a669a306a","abstract_canon_sha256":"3d36a788062c1d8c0cb2572cf9aa030483b91e74b24c6f204d058efb3f254bfb"},"schema_version":"1.0"},"canonical_sha256":"3b2da6cb6f0f7fc76bee629b814778be0b475a158b080bfa1607f104ed8e2a03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:20.138939Z","signature_b64":"Qf171XlLh2qrNW1xFPJ9eaPWwj0Hbu9MogYg6Us6CbyiXqt4cGEuKaZ5hNOThn4RSijdnidqgHUDauN1UOl+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b2da6cb6f0f7fc76bee629b814778be0b475a158b080bfa1607f104ed8e2a03","last_reissued_at":"2026-05-18T00:55:20.138188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:20.138188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01693","source_version":3,"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-18T00:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1fo7+c6cpW1uUvIt/dGvNhJ8eVWeAQTMt7b712rkNQ23i773+p5kY4QzMXRD2JSE04IiLOXK5CEJhxc9cLhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:37:58.643912Z"},"content_sha256":"e69acec0ddbf28ab0fb7672ec845d4f4086a4b6ab9f75ff546e1fbdfe9eab675","schema_version":"1.0","event_id":"sha256:e69acec0ddbf28ab0fb7672ec845d4f4086a4b6ab9f75ff546e1fbdfe9eab675"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HMW2NS3PB574O27OMKNYCR3YXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design and Evaluation of Alternate Enumeration Techniques for Subset Sum Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Avni Verma, Kamalakar Karlapalem","submitted_at":"2016-12-06T08:02:57Z","abstract_excerpt":"The subset sum problem, also referred as SSP, is a NP-Hard computational problem. SSP has its applications in broad domains like cryptography, number theory, operation research and complexity theory. The most famous algorithm for solving SSP is Backtracking Algorithm which has exponential time complexity. Therefore, our goal is to design and develop better alternate enumeration techniques for faster generation of SSP solutions. Given the set of first n natural numbers which is denoted by Xn and a target sum S, we propose various alternate enumeration techniques which find all the subsets of Xn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01693","kind":"arxiv","version":3},"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-18T00:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHSvYlS4hUvBZ9qkTyPXpVl0vi/gxPr4okN3nLdqvgCH0wiknw8G6KV0lql14QU7vhe0eOUv7xQMh9lqsrlGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:37:58.644596Z"},"content_sha256":"30131221de5f89b875c6a9e9d46fb09c65f0925d23e38a01cc1c6e207c06424b","schema_version":"1.0","event_id":"sha256:30131221de5f89b875c6a9e9d46fb09c65f0925d23e38a01cc1c6e207c06424b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMW2NS3PB574O27OMKNYCR3YXY/bundle.json","state_url":"https://pith.science/pith/HMW2NS3PB574O27OMKNYCR3YXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMW2NS3PB574O27OMKNYCR3YXY/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-05T23:37:58Z","links":{"resolver":"https://pith.science/pith/HMW2NS3PB574O27OMKNYCR3YXY","bundle":"https://pith.science/pith/HMW2NS3PB574O27OMKNYCR3YXY/bundle.json","state":"https://pith.science/pith/HMW2NS3PB574O27OMKNYCR3YXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMW2NS3PB574O27OMKNYCR3YXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HMW2NS3PB574O27OMKNYCR3YXY","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":"3d36a788062c1d8c0cb2572cf9aa030483b91e74b24c6f204d058efb3f254bfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-06T08:02:57Z","title_canon_sha256":"495fa2fc17fe309f0315dbf1aeb24db08a12ad0c20d5135323f1591a669a306a"},"schema_version":"1.0","source":{"id":"1612.01693","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01693","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01693v3","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01693","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"HMW2NS3PB574","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HMW2NS3PB574O27O","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HMW2NS3P","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:30131221de5f89b875c6a9e9d46fb09c65f0925d23e38a01cc1c6e207c06424b","target":"graph","created_at":"2026-05-18T00:55:20Z","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":"The subset sum problem, also referred as SSP, is a NP-Hard computational problem. SSP has its applications in broad domains like cryptography, number theory, operation research and complexity theory. The most famous algorithm for solving SSP is Backtracking Algorithm which has exponential time complexity. Therefore, our goal is to design and develop better alternate enumeration techniques for faster generation of SSP solutions. Given the set of first n natural numbers which is denoted by Xn and a target sum S, we propose various alternate enumeration techniques which find all the subsets of Xn","authors_text":"Avni Verma, Kamalakar Karlapalem","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-06T08:02:57Z","title":"Design and Evaluation of Alternate Enumeration Techniques for Subset Sum Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01693","kind":"arxiv","version":3},"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:e69acec0ddbf28ab0fb7672ec845d4f4086a4b6ab9f75ff546e1fbdfe9eab675","target":"record","created_at":"2026-05-18T00:55:20Z","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":"3d36a788062c1d8c0cb2572cf9aa030483b91e74b24c6f204d058efb3f254bfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-06T08:02:57Z","title_canon_sha256":"495fa2fc17fe309f0315dbf1aeb24db08a12ad0c20d5135323f1591a669a306a"},"schema_version":"1.0","source":{"id":"1612.01693","kind":"arxiv","version":3}},"canonical_sha256":"3b2da6cb6f0f7fc76bee629b814778be0b475a158b080bfa1607f104ed8e2a03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b2da6cb6f0f7fc76bee629b814778be0b475a158b080bfa1607f104ed8e2a03","first_computed_at":"2026-05-18T00:55:20.138188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:20.138188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qf171XlLh2qrNW1xFPJ9eaPWwj0Hbu9MogYg6Us6CbyiXqt4cGEuKaZ5hNOThn4RSijdnidqgHUDauN1UOl+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:20.138939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01693","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e69acec0ddbf28ab0fb7672ec845d4f4086a4b6ab9f75ff546e1fbdfe9eab675","sha256:30131221de5f89b875c6a9e9d46fb09c65f0925d23e38a01cc1c6e207c06424b"],"state_sha256":"4b0c21eb8c2cc53aa487f7a1e290876f9a368a2837c45776303bb9b4abb47bde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EbzaT2k2P09fcFRWMkOocxltn52wEAE+EVitfBkhuthH+V/vMJ58+VCUXPw9XmsSktaKo9hjkycTNkhalq+KBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:37:58.648117Z","bundle_sha256":"73f46378bfc3df36b943430c4ac528c42924497cbcafabcf8206fdef9bb1b9ec"}}