{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YAGQAIN5IYCXHUZVNDEVHJ2FZM","short_pith_number":"pith:YAGQAIN5","canonical_record":{"source":{"id":"1312.2490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-09T16:13:26Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"b3f5c7bc9ddd71d28723819898e355368e62ebc867f1e89e6ab7b959b126f234","abstract_canon_sha256":"7c3ab4e3bf0d526bc46ca387c572ae2cdf478839bddadf8c8c53f3fd6a82593a"},"schema_version":"1.0"},"canonical_sha256":"c00d0021bd460573d33568c953a745cb3ec8efdb3d68716a87f44587e29897b8","source":{"kind":"arxiv","id":"1312.2490","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2490","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2490v2","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2490","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"YAGQAIN5IYCX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YAGQAIN5IYCXHUZV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YAGQAIN5","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YAGQAIN5IYCXHUZVNDEVHJ2FZM","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-09T16:13:26Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"b3f5c7bc9ddd71d28723819898e355368e62ebc867f1e89e6ab7b959b126f234","abstract_canon_sha256":"7c3ab4e3bf0d526bc46ca387c572ae2cdf478839bddadf8c8c53f3fd6a82593a"},"schema_version":"1.0"},"canonical_sha256":"c00d0021bd460573d33568c953a745cb3ec8efdb3d68716a87f44587e29897b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:48.093378Z","signature_b64":"C784dHT1kwjO10Vrzz/5NdghSgg5OPjAS9SMhEGZMeZ9Wb2oGjNVq05lG5AikblfBgUwqgvj/Sf5nM5A+lWCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c00d0021bd460573d33568c953a745cb3ec8efdb3d68716a87f44587e29897b8","last_reissued_at":"2026-05-18T02:55:48.092862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:48.092862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2490","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-05-18T02:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UrEQbpgysxXDd/20IZvUyZlHYQkVxnONobiZzYZvH10+hrj3mM3kv29sm5gRwgMvXveKjuEvyJ6dx51pi5gYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:39:23.088497Z"},"content_sha256":"b621105e06e6ee6137b8f5f339a0cce1cc597840074b6d8b198ca9835fa14e18","schema_version":"1.0","event_id":"sha256:b621105e06e6ee6137b8f5f339a0cce1cc597840074b6d8b198ca9835fa14e18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YAGQAIN5IYCXHUZVNDEVHJ2FZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New View on Worst-Case to Average-Case Reductions for NP Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.CC","authors_text":"Robin K\\\"unzler, Thomas Holenstein","submitted_at":"2013-12-09T16:13:26Z","abstract_excerpt":"We study the result by Bogdanov and Trevisan (FOCS, 2003), who show that under reasonable assumptions, there is no non-adaptive worst-case to average-case reduction that bases the average-case hardness of an NP-problem on the worst-case complexity of an NP-complete problem. We replace the hiding and the heavy samples protocol in [BT03] by employing the histogram verification protocol of Haitner, Mahmoody and Xiao (CCC, 2010), which proves to be very useful in this context. Once the histogram is verified, our hiding protocol is directly public-coin, whereas the intuition behind the original pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2490","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":""},"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-18T02:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1/GiB25vHoElO5yKQODq6Y5XJZQOAkWBk/lCp+rk6gto1J0xHrZ/GdlKmd4iKk0Ipr+qJJRR3F4th/iU5f4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:39:23.088847Z"},"content_sha256":"1f1c0dc0a8a7f1908228194e1c8097c37f65a9613c9f30e746ba9331fa606bfb","schema_version":"1.0","event_id":"sha256:1f1c0dc0a8a7f1908228194e1c8097c37f65a9613c9f30e746ba9331fa606bfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YAGQAIN5IYCXHUZVNDEVHJ2FZM/bundle.json","state_url":"https://pith.science/pith/YAGQAIN5IYCXHUZVNDEVHJ2FZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YAGQAIN5IYCXHUZVNDEVHJ2FZM/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-05T11:39:23Z","links":{"resolver":"https://pith.science/pith/YAGQAIN5IYCXHUZVNDEVHJ2FZM","bundle":"https://pith.science/pith/YAGQAIN5IYCXHUZVNDEVHJ2FZM/bundle.json","state":"https://pith.science/pith/YAGQAIN5IYCXHUZVNDEVHJ2FZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YAGQAIN5IYCXHUZVNDEVHJ2FZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YAGQAIN5IYCXHUZVNDEVHJ2FZM","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":"7c3ab4e3bf0d526bc46ca387c572ae2cdf478839bddadf8c8c53f3fd6a82593a","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-09T16:13:26Z","title_canon_sha256":"b3f5c7bc9ddd71d28723819898e355368e62ebc867f1e89e6ab7b959b126f234"},"schema_version":"1.0","source":{"id":"1312.2490","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2490","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2490v2","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2490","created_at":"2026-05-18T02:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"YAGQAIN5IYCX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YAGQAIN5IYCXHUZV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YAGQAIN5","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:1f1c0dc0a8a7f1908228194e1c8097c37f65a9613c9f30e746ba9331fa606bfb","target":"graph","created_at":"2026-05-18T02:55: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"},"paper":{"abstract_excerpt":"We study the result by Bogdanov and Trevisan (FOCS, 2003), who show that under reasonable assumptions, there is no non-adaptive worst-case to average-case reduction that bases the average-case hardness of an NP-problem on the worst-case complexity of an NP-complete problem. We replace the hiding and the heavy samples protocol in [BT03] by employing the histogram verification protocol of Haitner, Mahmoody and Xiao (CCC, 2010), which proves to be very useful in this context. Once the histogram is verified, our hiding protocol is directly public-coin, whereas the intuition behind the original pro","authors_text":"Robin K\\\"unzler, Thomas Holenstein","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-09T16:13:26Z","title":"A New View on Worst-Case to Average-Case Reductions for NP Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2490","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:b621105e06e6ee6137b8f5f339a0cce1cc597840074b6d8b198ca9835fa14e18","target":"record","created_at":"2026-05-18T02:55: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":"7c3ab4e3bf0d526bc46ca387c572ae2cdf478839bddadf8c8c53f3fd6a82593a","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-09T16:13:26Z","title_canon_sha256":"b3f5c7bc9ddd71d28723819898e355368e62ebc867f1e89e6ab7b959b126f234"},"schema_version":"1.0","source":{"id":"1312.2490","kind":"arxiv","version":2}},"canonical_sha256":"c00d0021bd460573d33568c953a745cb3ec8efdb3d68716a87f44587e29897b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c00d0021bd460573d33568c953a745cb3ec8efdb3d68716a87f44587e29897b8","first_computed_at":"2026-05-18T02:55:48.092862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:48.092862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C784dHT1kwjO10Vrzz/5NdghSgg5OPjAS9SMhEGZMeZ9Wb2oGjNVq05lG5AikblfBgUwqgvj/Sf5nM5A+lWCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:48.093378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2490","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b621105e06e6ee6137b8f5f339a0cce1cc597840074b6d8b198ca9835fa14e18","sha256:1f1c0dc0a8a7f1908228194e1c8097c37f65a9613c9f30e746ba9331fa606bfb"],"state_sha256":"39e4b0e60708d311eceebb6332ba1c9c4b88c56340e111301a399a50dc2b41da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJ8d1xDEXJemZfNBfkkK75AAKGxji+EEomU8Grkq7V2Q/oFu4DUQSo2inVFa4ioserqK5RCgnegtzf/OegOzAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:39:23.090929Z","bundle_sha256":"ebc475821a049bee95a4c1d07793eda14972c0d44822953dc61cc5aa152f50d5"}}