{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QKQQHJINMJ6GOTDYTVPSFFJ7LO","short_pith_number":"pith:QKQQHJIN","canonical_record":{"source":{"id":"1507.02318","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T21:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"27f633e74883a0e10d66596b43788ae4e7638f4e99481f67574c0c15d96bfe6c","abstract_canon_sha256":"30ce6d463f7652dabc618cd15a573cdeb1c07cc56f2ba60a01fd22d2927244b2"},"schema_version":"1.0"},"canonical_sha256":"82a103a50d627c674c789d5f22953f5ba22fb709ea2c6870720f8963ad37f4ab","source":{"kind":"arxiv","id":"1507.02318","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02318","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02318v3","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02318","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"QKQQHJINMJ6G","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QKQQHJINMJ6GOTDY","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QKQQHJIN","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QKQQHJINMJ6GOTDYTVPSFFJ7LO","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02318","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T21:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"27f633e74883a0e10d66596b43788ae4e7638f4e99481f67574c0c15d96bfe6c","abstract_canon_sha256":"30ce6d463f7652dabc618cd15a573cdeb1c07cc56f2ba60a01fd22d2927244b2"},"schema_version":"1.0"},"canonical_sha256":"82a103a50d627c674c789d5f22953f5ba22fb709ea2c6870720f8963ad37f4ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:25.723845Z","signature_b64":"Nc44OVCdwRUG23vccUCVN1KulNkwmk9nfnHOKbkQJIhHaLYLnFAiasEbCLsG5M1gF9sZ9yYHlRt2h80k3rkLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a103a50d627c674c789d5f22953f5ba22fb709ea2c6870720f8963ad37f4ab","last_reissued_at":"2026-05-18T00:55:25.723245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:25.723245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02318","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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6njmf8UrABwqhoYZmRG9pV0niK0PUtJdWjdZiMZWDXlfUKzlP5anwY7nDD4CcF1JE9Sc1JHcDTbre5bzu7nkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:55:40.669978Z"},"content_sha256":"d172cdb2fd033da73fc70923b37fb2211451fc9697eb3399c184b1e4f2e8130e","schema_version":"1.0","event_id":"sha256:d172cdb2fd033da73fc70923b37fb2211451fc9697eb3399c184b1e4f2e8130e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QKQQHJINMJ6GOTDYTVPSFFJ7LO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Faster Pseudopolynomial Time Algorithm for Subset Sum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chao Xu, Konstantinos Koiliaris","submitted_at":"2015-07-08T21:38:20Z","abstract_excerpt":"Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $t$. We present a new divide-and-conquer algorithm that computes all the realizable subset sums up to an integer $u$ in $\\widetilde{O}\\!\\left(\\min\\{\\sqrt{n}u,u^{4/3},\\sigma\\}\\right)$, where $\\sigma$ is the sum of all elements in $S$ and $\\widetilde{O}$ hides polylogarithmic factors. This result improves upon the standard dynamic programming algorithm that runs in $O(nu)$ time. To the best of our knowledge, the new algorithm is the fastest gener"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02318","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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xg7VXKn4Bp7tHhgqozbJ6YYHct3k0FUBei8O62o0SUs7Jep3i/w//CN/2trye5CYybbOUEi91OFRNUHuEfhnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:55:40.670332Z"},"content_sha256":"5e7b148d337669781668cc1967d11089eeba3bd60a9d2a421deea8438aef7e21","schema_version":"1.0","event_id":"sha256:5e7b148d337669781668cc1967d11089eeba3bd60a9d2a421deea8438aef7e21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO/bundle.json","state_url":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO/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-03T05:55:40Z","links":{"resolver":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO","bundle":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO/bundle.json","state":"https://pith.science/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKQQHJINMJ6GOTDYTVPSFFJ7LO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QKQQHJINMJ6GOTDYTVPSFFJ7LO","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":"30ce6d463f7652dabc618cd15a573cdeb1c07cc56f2ba60a01fd22d2927244b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T21:38:20Z","title_canon_sha256":"27f633e74883a0e10d66596b43788ae4e7638f4e99481f67574c0c15d96bfe6c"},"schema_version":"1.0","source":{"id":"1507.02318","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02318","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02318v3","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02318","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"QKQQHJINMJ6G","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QKQQHJINMJ6GOTDY","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QKQQHJIN","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:5e7b148d337669781668cc1967d11089eeba3bd60a9d2a421deea8438aef7e21","target":"graph","created_at":"2026-05-18T00:55:25Z","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":"Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $t$. We present a new divide-and-conquer algorithm that computes all the realizable subset sums up to an integer $u$ in $\\widetilde{O}\\!\\left(\\min\\{\\sqrt{n}u,u^{4/3},\\sigma\\}\\right)$, where $\\sigma$ is the sum of all elements in $S$ and $\\widetilde{O}$ hides polylogarithmic factors. This result improves upon the standard dynamic programming algorithm that runs in $O(nu)$ time. To the best of our knowledge, the new algorithm is the fastest gener","authors_text":"Chao Xu, Konstantinos Koiliaris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T21:38:20Z","title":"A Faster Pseudopolynomial Time Algorithm for Subset Sum"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02318","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:d172cdb2fd033da73fc70923b37fb2211451fc9697eb3399c184b1e4f2e8130e","target":"record","created_at":"2026-05-18T00:55:25Z","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":"30ce6d463f7652dabc618cd15a573cdeb1c07cc56f2ba60a01fd22d2927244b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T21:38:20Z","title_canon_sha256":"27f633e74883a0e10d66596b43788ae4e7638f4e99481f67574c0c15d96bfe6c"},"schema_version":"1.0","source":{"id":"1507.02318","kind":"arxiv","version":3}},"canonical_sha256":"82a103a50d627c674c789d5f22953f5ba22fb709ea2c6870720f8963ad37f4ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82a103a50d627c674c789d5f22953f5ba22fb709ea2c6870720f8963ad37f4ab","first_computed_at":"2026-05-18T00:55:25.723245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:25.723245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nc44OVCdwRUG23vccUCVN1KulNkwmk9nfnHOKbkQJIhHaLYLnFAiasEbCLsG5M1gF9sZ9yYHlRt2h80k3rkLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:25.723845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02318","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d172cdb2fd033da73fc70923b37fb2211451fc9697eb3399c184b1e4f2e8130e","sha256:5e7b148d337669781668cc1967d11089eeba3bd60a9d2a421deea8438aef7e21"],"state_sha256":"fc309ab2b0beddcb9eed3c5b988533b383878ca3e9fc7ad72eb430e2584d8c41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNki3TgkbEI6T7CnaV8fEHh9qI/bWQK45DaALOX1UPXvu1CQgpRZngMgzzYavmXwZnHlYQjqk2jLaXIYH5PdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:55:40.672259Z","bundle_sha256":"17a1387805c2dc0597ff2eb75b828625f832527806b969b0f6c6342bbdf57808"}}