{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AFO2KBM3PVECTTGZ3GMMSMR3R4","short_pith_number":"pith:AFO2KBM3","canonical_record":{"source":{"id":"1602.01819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-04T20:32:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"570e3fdd4ee361206e7a0b984649648675e66f84392e72488370e1ce40f480b7","abstract_canon_sha256":"8b12676f57bf593814077bcbc6f0e5e7191026584ff4f0d3c02f5b3d1c227082"},"schema_version":"1.0"},"canonical_sha256":"015da5059b7d4829ccd9d998c9323b8f025417566c681ebb2b742ec55d90928f","source":{"kind":"arxiv","id":"1602.01819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01819","created_at":"2026-05-18T01:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01819v1","created_at":"2026-05-18T01:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01819","created_at":"2026-05-18T01:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"AFO2KBM3PVEC","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AFO2KBM3PVECTTGZ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AFO2KBM3","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AFO2KBM3PVECTTGZ3GMMSMR3R4","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-04T20:32:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"570e3fdd4ee361206e7a0b984649648675e66f84392e72488370e1ce40f480b7","abstract_canon_sha256":"8b12676f57bf593814077bcbc6f0e5e7191026584ff4f0d3c02f5b3d1c227082"},"schema_version":"1.0"},"canonical_sha256":"015da5059b7d4829ccd9d998c9323b8f025417566c681ebb2b742ec55d90928f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:16.665153Z","signature_b64":"MQtclau2YjNGU7nfLPb6ZaOoTHDNMUEUmmFVSVFiH28hP/UZZixkmN27ALOxOA2oAk7RdlaDNJdIzaJ1hignBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"015da5059b7d4829ccd9d998c9323b8f025417566c681ebb2b742ec55d90928f","last_reissued_at":"2026-05-18T01:21:16.664470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:16.664470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01819","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-18T01:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhEF5+xeJFetSt7HyBskz9W7TvxK4hC4PdkVGAHRJiNQg9gZgN3M4VBQn8Oy+j2fL2Vdss8utNdiaVumX8+qBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:28:11.059986Z"},"content_sha256":"8dcef6c3777afb569697de4ec9f3ad4169721df936afb118fc0675e59646a1ce","schema_version":"1.0","event_id":"sha256:8dcef6c3777afb569697de4ec9f3ad4169721df936afb118fc0675e59646a1ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AFO2KBM3PVECTTGZ3GMMSMR3R4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A short note on Merlin-Arthur protocols for subset sum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Jesper Nederlof","submitted_at":"2016-02-04T20:32:51Z","abstract_excerpt":"In the subset sum problem we are given n positive integers along with a target integer t. A solution is a subset of these integers summing to t. In this short note we show that for a given subset sum instance there is a proof of size $O^*(\\sqrt{t})$ of what the number of solutions is that can be constructed in $O^*(t)$ time and can be probabilistically verified in time $O^*(\\sqrt{t})$ with at most constant error probability. Here, the $O^*()$ notation omits factors polynomial in the input size $n\\log(t)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01819","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-18T01:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DIOUuCbD7e7ufC1QR4RAIxWGAlJfpbmxLSznIeQNscOdb/WuJ166zJZWBmS4PRktA4ILvp2Zv5RtyxpovX5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:28:11.060571Z"},"content_sha256":"7dd27e2af03e840874e411e551d1f7f18a5de993605285da72d2a8ace18638bb","schema_version":"1.0","event_id":"sha256:7dd27e2af03e840874e411e551d1f7f18a5de993605285da72d2a8ace18638bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFO2KBM3PVECTTGZ3GMMSMR3R4/bundle.json","state_url":"https://pith.science/pith/AFO2KBM3PVECTTGZ3GMMSMR3R4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFO2KBM3PVECTTGZ3GMMSMR3R4/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-05T21:28:11Z","links":{"resolver":"https://pith.science/pith/AFO2KBM3PVECTTGZ3GMMSMR3R4","bundle":"https://pith.science/pith/AFO2KBM3PVECTTGZ3GMMSMR3R4/bundle.json","state":"https://pith.science/pith/AFO2KBM3PVECTTGZ3GMMSMR3R4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFO2KBM3PVECTTGZ3GMMSMR3R4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AFO2KBM3PVECTTGZ3GMMSMR3R4","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":"8b12676f57bf593814077bcbc6f0e5e7191026584ff4f0d3c02f5b3d1c227082","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-04T20:32:51Z","title_canon_sha256":"570e3fdd4ee361206e7a0b984649648675e66f84392e72488370e1ce40f480b7"},"schema_version":"1.0","source":{"id":"1602.01819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01819","created_at":"2026-05-18T01:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01819v1","created_at":"2026-05-18T01:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01819","created_at":"2026-05-18T01:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"AFO2KBM3PVEC","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AFO2KBM3PVECTTGZ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AFO2KBM3","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:7dd27e2af03e840874e411e551d1f7f18a5de993605285da72d2a8ace18638bb","target":"graph","created_at":"2026-05-18T01:21:16Z","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 the subset sum problem we are given n positive integers along with a target integer t. A solution is a subset of these integers summing to t. In this short note we show that for a given subset sum instance there is a proof of size $O^*(\\sqrt{t})$ of what the number of solutions is that can be constructed in $O^*(t)$ time and can be probabilistically verified in time $O^*(\\sqrt{t})$ with at most constant error probability. Here, the $O^*()$ notation omits factors polynomial in the input size $n\\log(t)$.","authors_text":"Jesper Nederlof","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-04T20:32:51Z","title":"A short note on Merlin-Arthur protocols for subset sum"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01819","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:8dcef6c3777afb569697de4ec9f3ad4169721df936afb118fc0675e59646a1ce","target":"record","created_at":"2026-05-18T01:21:16Z","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":"8b12676f57bf593814077bcbc6f0e5e7191026584ff4f0d3c02f5b3d1c227082","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-04T20:32:51Z","title_canon_sha256":"570e3fdd4ee361206e7a0b984649648675e66f84392e72488370e1ce40f480b7"},"schema_version":"1.0","source":{"id":"1602.01819","kind":"arxiv","version":1}},"canonical_sha256":"015da5059b7d4829ccd9d998c9323b8f025417566c681ebb2b742ec55d90928f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"015da5059b7d4829ccd9d998c9323b8f025417566c681ebb2b742ec55d90928f","first_computed_at":"2026-05-18T01:21:16.664470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:16.664470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MQtclau2YjNGU7nfLPb6ZaOoTHDNMUEUmmFVSVFiH28hP/UZZixkmN27ALOxOA2oAk7RdlaDNJdIzaJ1hignBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:16.665153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dcef6c3777afb569697de4ec9f3ad4169721df936afb118fc0675e59646a1ce","sha256:7dd27e2af03e840874e411e551d1f7f18a5de993605285da72d2a8ace18638bb"],"state_sha256":"34a2aa8dbdf491beaef9ca000e61d333d326a336df0b81bc3e94ad9a0c2c959f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KpE4zRCQD54uQyD8Jar1h0BMmX4lCmGoU6vlI+dpa72Z2NtQs3I8XIz9R/CEbUZbvY9xV4JbvDYSjA5d9gi8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:28:11.065036Z","bundle_sha256":"c3dfc36bd781b86a87b8962afce960aefc774d3d479c661258d5c60eedec6c43"}}