{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JZDI3VI7SU3N5VK2BIQOJTOAN3","short_pith_number":"pith:JZDI3VI7","canonical_record":{"source":{"id":"1807.08248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-22T06:38:50Z","cross_cats_sorted":[],"title_canon_sha256":"3ea3ab07eae6c3f9f763b1f7282d4e27cbcb70407b36990a41701440ee37b622","abstract_canon_sha256":"ee511874656a4e66c35c57923167c3335b4902b48c9948adddb5ac88a96034de"},"schema_version":"1.0"},"canonical_sha256":"4e468dd51f9536ded55a0a20e4cdc06edd024d50941dd81f33982dbabd3daf99","source":{"kind":"arxiv","id":"1807.08248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08248","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08248v1","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08248","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"JZDI3VI7SU3N","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JZDI3VI7SU3N5VK2","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JZDI3VI7","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JZDI3VI7SU3N5VK2BIQOJTOAN3","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-22T06:38:50Z","cross_cats_sorted":[],"title_canon_sha256":"3ea3ab07eae6c3f9f763b1f7282d4e27cbcb70407b36990a41701440ee37b622","abstract_canon_sha256":"ee511874656a4e66c35c57923167c3335b4902b48c9948adddb5ac88a96034de"},"schema_version":"1.0"},"canonical_sha256":"4e468dd51f9536ded55a0a20e4cdc06edd024d50941dd81f33982dbabd3daf99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:08.757829Z","signature_b64":"8uxe5Rr//uUtzlSvNfzlUL1dJ/C/zxxwLfcBXNodK9DY+9XT+6kiR+RaMgjq3auvKuf8cEQv4gB8Cfo9+WeODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e468dd51f9536ded55a0a20e4cdc06edd024d50941dd81f33982dbabd3daf99","last_reissued_at":"2026-05-18T00:10:08.757293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:08.757293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08248","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-18T00:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ux8DL26b9ois0ae57zRW53SzZdK42gDka1o7/rlJA4vuuG7KojzFEKwlnpqx+eW5IliBYWCtEkd2BqRniM6ACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:22:35.635306Z"},"content_sha256":"6bc98c6becff1dcf1b1908dae6584b0e57daaa33e5e90d9a36bcd6f8bfdec766","schema_version":"1.0","event_id":"sha256:6bc98c6becff1dcf1b1908dae6584b0e57daaa33e5e90d9a36bcd6f8bfdec766"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JZDI3VI7SU3N5VK2BIQOJTOAN3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subset Sum Made Simple","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chao Xu, Konstantinos Koiliaris","submitted_at":"2018-07-22T06:38:50Z","abstract_excerpt":"Subset Sum is a classical optimization problem taught to undergraduates as an example of an NP-hard problem, which is amenable to dynamic programming, yielding polynomial running time if the input numbers are relatively small. Formally, given a set $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$. Dynamic programming yields an algorithm with running time $O(nt)$. Recently, the authors [SODA '17] improved the running time to $\\tilde{O}\\bigl(\\sqrt{n}t\\bigr)$, and it was further improved to $\\tilde{O}\\bigl(n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08248","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-18T00:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmWrq72agmT0s2cmvJASJh2Calhn8E0UNg0weoPt/ed0mM9+TSlpM2/f8LHZ3AL6S0hYlnFJFR3zzoUEyEmuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:22:35.635672Z"},"content_sha256":"22c817633d1a2ab40489ee0053eb7b6ca9b40c0cec1194c799a6a5c5924750ae","schema_version":"1.0","event_id":"sha256:22c817633d1a2ab40489ee0053eb7b6ca9b40c0cec1194c799a6a5c5924750ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZDI3VI7SU3N5VK2BIQOJTOAN3/bundle.json","state_url":"https://pith.science/pith/JZDI3VI7SU3N5VK2BIQOJTOAN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZDI3VI7SU3N5VK2BIQOJTOAN3/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:22:35Z","links":{"resolver":"https://pith.science/pith/JZDI3VI7SU3N5VK2BIQOJTOAN3","bundle":"https://pith.science/pith/JZDI3VI7SU3N5VK2BIQOJTOAN3/bundle.json","state":"https://pith.science/pith/JZDI3VI7SU3N5VK2BIQOJTOAN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZDI3VI7SU3N5VK2BIQOJTOAN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JZDI3VI7SU3N5VK2BIQOJTOAN3","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":"ee511874656a4e66c35c57923167c3335b4902b48c9948adddb5ac88a96034de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-22T06:38:50Z","title_canon_sha256":"3ea3ab07eae6c3f9f763b1f7282d4e27cbcb70407b36990a41701440ee37b622"},"schema_version":"1.0","source":{"id":"1807.08248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08248","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08248v1","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08248","created_at":"2026-05-18T00:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"JZDI3VI7SU3N","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JZDI3VI7SU3N5VK2","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JZDI3VI7","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:22c817633d1a2ab40489ee0053eb7b6ca9b40c0cec1194c799a6a5c5924750ae","target":"graph","created_at":"2026-05-18T00:10: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":"Subset Sum is a classical optimization problem taught to undergraduates as an example of an NP-hard problem, which is amenable to dynamic programming, yielding polynomial running time if the input numbers are relatively small. Formally, given a set $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$. Dynamic programming yields an algorithm with running time $O(nt)$. Recently, the authors [SODA '17] improved the running time to $\\tilde{O}\\bigl(\\sqrt{n}t\\bigr)$, and it was further improved to $\\tilde{O}\\bigl(n","authors_text":"Chao Xu, Konstantinos Koiliaris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-22T06:38:50Z","title":"Subset Sum Made Simple"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08248","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:6bc98c6becff1dcf1b1908dae6584b0e57daaa33e5e90d9a36bcd6f8bfdec766","target":"record","created_at":"2026-05-18T00:10: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":"ee511874656a4e66c35c57923167c3335b4902b48c9948adddb5ac88a96034de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-22T06:38:50Z","title_canon_sha256":"3ea3ab07eae6c3f9f763b1f7282d4e27cbcb70407b36990a41701440ee37b622"},"schema_version":"1.0","source":{"id":"1807.08248","kind":"arxiv","version":1}},"canonical_sha256":"4e468dd51f9536ded55a0a20e4cdc06edd024d50941dd81f33982dbabd3daf99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e468dd51f9536ded55a0a20e4cdc06edd024d50941dd81f33982dbabd3daf99","first_computed_at":"2026-05-18T00:10:08.757293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:08.757293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8uxe5Rr//uUtzlSvNfzlUL1dJ/C/zxxwLfcBXNodK9DY+9XT+6kiR+RaMgjq3auvKuf8cEQv4gB8Cfo9+WeODA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:08.757829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bc98c6becff1dcf1b1908dae6584b0e57daaa33e5e90d9a36bcd6f8bfdec766","sha256:22c817633d1a2ab40489ee0053eb7b6ca9b40c0cec1194c799a6a5c5924750ae"],"state_sha256":"fad882d551601dbd662d9474438a48789d67e6c4cbfc3ceeee35132d01636771"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYG0FQ9WRrLO7dVJSgrwBZkAbtkNJbcMOUews9nEcqdeYwXvm2KRai8c3V6LlmVmcZB844jOH78rfOmC7v87DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:22:35.637628Z","bundle_sha256":"b3059d563dd3e38ef724eb2001c182240d8cc118c2c257d1338be1a0946a047c"}}