{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:2Z3PZJELDN5OU4BWST63I2O4HE","short_pith_number":"pith:2Z3PZJEL","canonical_record":{"source":{"id":"2010.08821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-10-17T16:39:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e64ddc73bef8d2937fa7c923ce0552e5dd4230e47167e1669a58d0202996cbf5","abstract_canon_sha256":"fe9a336accddee11947f87c5db6a9b7087f0360336d1f3c2bd3d6c7b0ca95f34"},"schema_version":"1.0"},"canonical_sha256":"d676fca48b1b7aea703694fdb469dc39352ed6cafc6e6e5606dcb47ff9bf3d20","source":{"kind":"arxiv","id":"2010.08821","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.08821","created_at":"2026-07-05T01:50:48Z"},{"alias_kind":"arxiv_version","alias_value":"2010.08821v2","created_at":"2026-07-05T01:50:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.08821","created_at":"2026-07-05T01:50:48Z"},{"alias_kind":"pith_short_12","alias_value":"2Z3PZJELDN5O","created_at":"2026-07-05T01:50:48Z"},{"alias_kind":"pith_short_16","alias_value":"2Z3PZJELDN5OU4BW","created_at":"2026-07-05T01:50:48Z"},{"alias_kind":"pith_short_8","alias_value":"2Z3PZJEL","created_at":"2026-07-05T01:50:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:2Z3PZJELDN5OU4BWST63I2O4HE","target":"record","payload":{"canonical_record":{"source":{"id":"2010.08821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-10-17T16:39:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e64ddc73bef8d2937fa7c923ce0552e5dd4230e47167e1669a58d0202996cbf5","abstract_canon_sha256":"fe9a336accddee11947f87c5db6a9b7087f0360336d1f3c2bd3d6c7b0ca95f34"},"schema_version":"1.0"},"canonical_sha256":"d676fca48b1b7aea703694fdb469dc39352ed6cafc6e6e5606dcb47ff9bf3d20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:50:48.458375Z","signature_b64":"UjROonCs5QcBUxcLooxh3E6Ob9Srw3W6xOWmU0Un/ivYCasc4OMamOb8bpPiF7JilT+ZHK/7R0vf5JcsXHuWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d676fca48b1b7aea703694fdb469dc39352ed6cafc6e6e5606dcb47ff9bf3d20","last_reissued_at":"2026-07-05T01:50:48.457952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:50:48.457952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.08821","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-07-05T01:50:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f45g7ToTMFHeXviH92pK3FdBKa60YaFNnb7Z2ZiLxVxrbXW8rgfK2DJJ9sTLLFEGDqucFxy8PcvcIXb8Z65EAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:27:19.461623Z"},"content_sha256":"874b686c5571323b5ff65fa7b1ebfaa1585d48fd4f9181058615a408fcffbdf8","schema_version":"1.0","event_id":"sha256:874b686c5571323b5ff65fa7b1ebfaa1585d48fd4f9181058615a408fcffbdf8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:2Z3PZJELDN5OU4BWST63I2O4HE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Hardness of Average-case k-SUM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Noah Stephens-Davidowitz, Vinod Vaikuntanathan, Zvika Brakerski","submitted_at":"2020-10-17T16:39:41Z","abstract_excerpt":"In this work, we show the first worst-case to average-case reduction for the classical $k$-SUM problem. A $k$-SUM instance is a collection of $m$ integers, and the goal of the $k$-SUM problem is to find a subset of $k$ elements that sums to $0$. In the average-case version, the $m$ elements are chosen uniformly at random from some interval $[-u,u]$.\n  We consider the total setting where $m$ is sufficiently large (with respect to $u$ and $k$), so that we are guaranteed (with high probability) that solutions must exist. Much of the appeal of $k$-SUM, in particular connections to problems in comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.08821","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.08821/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:50:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/sv7zbOC3m7uyHJDuVxEF1OfAE4UuJh7GJ6VdWS1Q+HxkkliXC5TvOfICHIvvb4c9afXaPXXmvRwYadMpVvXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:27:19.461998Z"},"content_sha256":"249eecfb88734668acc218f4a958c8a1404faaeeb512f3c73cb5b1860608b717","schema_version":"1.0","event_id":"sha256:249eecfb88734668acc218f4a958c8a1404faaeeb512f3c73cb5b1860608b717"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2Z3PZJELDN5OU4BWST63I2O4HE/bundle.json","state_url":"https://pith.science/pith/2Z3PZJELDN5OU4BWST63I2O4HE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2Z3PZJELDN5OU4BWST63I2O4HE/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-04T21:27:19Z","links":{"resolver":"https://pith.science/pith/2Z3PZJELDN5OU4BWST63I2O4HE","bundle":"https://pith.science/pith/2Z3PZJELDN5OU4BWST63I2O4HE/bundle.json","state":"https://pith.science/pith/2Z3PZJELDN5OU4BWST63I2O4HE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2Z3PZJELDN5OU4BWST63I2O4HE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2Z3PZJELDN5OU4BWST63I2O4HE","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":"fe9a336accddee11947f87c5db6a9b7087f0360336d1f3c2bd3d6c7b0ca95f34","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-10-17T16:39:41Z","title_canon_sha256":"e64ddc73bef8d2937fa7c923ce0552e5dd4230e47167e1669a58d0202996cbf5"},"schema_version":"1.0","source":{"id":"2010.08821","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.08821","created_at":"2026-07-05T01:50:48Z"},{"alias_kind":"arxiv_version","alias_value":"2010.08821v2","created_at":"2026-07-05T01:50:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.08821","created_at":"2026-07-05T01:50:48Z"},{"alias_kind":"pith_short_12","alias_value":"2Z3PZJELDN5O","created_at":"2026-07-05T01:50:48Z"},{"alias_kind":"pith_short_16","alias_value":"2Z3PZJELDN5OU4BW","created_at":"2026-07-05T01:50:48Z"},{"alias_kind":"pith_short_8","alias_value":"2Z3PZJEL","created_at":"2026-07-05T01:50:48Z"}],"graph_snapshots":[{"event_id":"sha256:249eecfb88734668acc218f4a958c8a1404faaeeb512f3c73cb5b1860608b717","target":"graph","created_at":"2026-07-05T01:50:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.08821/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we show the first worst-case to average-case reduction for the classical $k$-SUM problem. A $k$-SUM instance is a collection of $m$ integers, and the goal of the $k$-SUM problem is to find a subset of $k$ elements that sums to $0$. In the average-case version, the $m$ elements are chosen uniformly at random from some interval $[-u,u]$.\n  We consider the total setting where $m$ is sufficiently large (with respect to $u$ and $k$), so that we are guaranteed (with high probability) that solutions must exist. Much of the appeal of $k$-SUM, in particular connections to problems in comp","authors_text":"Noah Stephens-Davidowitz, Vinod Vaikuntanathan, Zvika Brakerski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-10-17T16:39:41Z","title":"On the Hardness of Average-case k-SUM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.08821","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:874b686c5571323b5ff65fa7b1ebfaa1585d48fd4f9181058615a408fcffbdf8","target":"record","created_at":"2026-07-05T01:50:48Z","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":"fe9a336accddee11947f87c5db6a9b7087f0360336d1f3c2bd3d6c7b0ca95f34","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-10-17T16:39:41Z","title_canon_sha256":"e64ddc73bef8d2937fa7c923ce0552e5dd4230e47167e1669a58d0202996cbf5"},"schema_version":"1.0","source":{"id":"2010.08821","kind":"arxiv","version":2}},"canonical_sha256":"d676fca48b1b7aea703694fdb469dc39352ed6cafc6e6e5606dcb47ff9bf3d20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d676fca48b1b7aea703694fdb469dc39352ed6cafc6e6e5606dcb47ff9bf3d20","first_computed_at":"2026-07-05T01:50:48.457952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:50:48.457952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UjROonCs5QcBUxcLooxh3E6Ob9Srw3W6xOWmU0Un/ivYCasc4OMamOb8bpPiF7JilT+ZHK/7R0vf5JcsXHuWAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:50:48.458375Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.08821","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:874b686c5571323b5ff65fa7b1ebfaa1585d48fd4f9181058615a408fcffbdf8","sha256:249eecfb88734668acc218f4a958c8a1404faaeeb512f3c73cb5b1860608b717"],"state_sha256":"de31dfc72c81d21e7d3b15be7d9646ac6b1ab1d81e54018bc9fd6c487d1415e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BHgHCP83mIW+cdh2sMFg2FaKk+javZn/nWUOqtzne/cmLlmR0ut1ALdbcKYV+wVm+L8muTlVtLUkIH3yVESDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:27:19.464273Z","bundle_sha256":"d5b7d61f0a4beefe8c34a6cdf6416a50a1939a414d1f26b62bbb9b8734141b34"}}