{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TAR533AJGMBYZUGGSIXEPC6QWA","short_pith_number":"pith:TAR533AJ","canonical_record":{"source":{"id":"1002.3534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-02-18T14:50:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4619c99e4a713523c8ddfe6cfb878a33919011b3a173c46e46aeb0b957a97bda","abstract_canon_sha256":"49c393a502a75696802b7e1bbcd0a6e91ceea4911b11c4d0a66383b69f73a44f"},"schema_version":"1.0"},"canonical_sha256":"9823ddec0933038cd0c6922e478bd0b023d198bda44e278f5c126f8a1b13c196","source":{"kind":"arxiv","id":"1002.3534","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.3534","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"arxiv_version","alias_value":"1002.3534v2","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3534","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"pith_short_12","alias_value":"TAR533AJGMBY","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TAR533AJGMBYZUGG","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TAR533AJ","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TAR533AJGMBYZUGGSIXEPC6QWA","target":"record","payload":{"canonical_record":{"source":{"id":"1002.3534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-02-18T14:50:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4619c99e4a713523c8ddfe6cfb878a33919011b3a173c46e46aeb0b957a97bda","abstract_canon_sha256":"49c393a502a75696802b7e1bbcd0a6e91ceea4911b11c4d0a66383b69f73a44f"},"schema_version":"1.0"},"canonical_sha256":"9823ddec0933038cd0c6922e478bd0b023d198bda44e278f5c126f8a1b13c196","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:22.043994Z","signature_b64":"moNRI+P0OkG/p92GT7LDI4SUxnrwR6zJ7g1SKlqT9JSBZoTEeiJO2q86oqP5s09FifRU48PUsLJzoLUZN2xODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9823ddec0933038cd0c6922e478bd0b023d198bda44e278f5c126f8a1b13c196","last_reissued_at":"2026-05-18T04:32:22.043171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:22.043171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.3534","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-18T04:32:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sMNbjq5DU3+nsqMUHWBD89pg1Hw62g2rt7j57rOcblUxK204+lJIxcQwJJPYm2vN4i8msJP3WHo0b4uaAFogDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:01:08.902288Z"},"content_sha256":"7aa090b0458e06c370634592dd99e9baa178dda5f50238683ce18b007bafdd49","schema_version":"1.0","event_id":"sha256:7aa090b0458e06c370634592dd99e9baa178dda5f50238683ce18b007bafdd49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TAR533AJGMBYZUGGSIXEPC6QWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General Hardness Amplification of Predicates and Puzzles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CR","authors_text":"Grant Schoenebeck, Thomas Holenstein","submitted_at":"2010-02-18T14:50:53Z","abstract_excerpt":"We give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which generalize to new settings. More concretely, in the first part of the paper, we give a new proof of Yao's XOR-Lemma that additionally applies to related theorems in the cryptographic setting. Our proof seems simpler than previous ones, yet immediately generalizes to statements similar in spirit such as the extraction lemma used to obtain pseudo-random generators from one-way functions [Hastad, Impagliazzo, Levin, Luby, SIAM J. on Comp. 1999].\n  In the second part of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3534","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-18T04:32:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IYkOlMjGDZ3FJ9zCqk/8rZ2c/TaQLR9Y29FjIGrBNZloMVFTKsGp2JdiNPE++Zz0JdlQQ8xF4xjbOLqVVdwrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:01:08.902665Z"},"content_sha256":"acfbd301c42d495f039a9b7fac0796e6cb3378dddf7b8cfdf96564fd85b9e228","schema_version":"1.0","event_id":"sha256:acfbd301c42d495f039a9b7fac0796e6cb3378dddf7b8cfdf96564fd85b9e228"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAR533AJGMBYZUGGSIXEPC6QWA/bundle.json","state_url":"https://pith.science/pith/TAR533AJGMBYZUGGSIXEPC6QWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAR533AJGMBYZUGGSIXEPC6QWA/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-23T18:01:08Z","links":{"resolver":"https://pith.science/pith/TAR533AJGMBYZUGGSIXEPC6QWA","bundle":"https://pith.science/pith/TAR533AJGMBYZUGGSIXEPC6QWA/bundle.json","state":"https://pith.science/pith/TAR533AJGMBYZUGGSIXEPC6QWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAR533AJGMBYZUGGSIXEPC6QWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TAR533AJGMBYZUGGSIXEPC6QWA","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":"49c393a502a75696802b7e1bbcd0a6e91ceea4911b11c4d0a66383b69f73a44f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-02-18T14:50:53Z","title_canon_sha256":"4619c99e4a713523c8ddfe6cfb878a33919011b3a173c46e46aeb0b957a97bda"},"schema_version":"1.0","source":{"id":"1002.3534","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.3534","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"arxiv_version","alias_value":"1002.3534v2","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3534","created_at":"2026-05-18T04:32:22Z"},{"alias_kind":"pith_short_12","alias_value":"TAR533AJGMBY","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TAR533AJGMBYZUGG","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TAR533AJ","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:acfbd301c42d495f039a9b7fac0796e6cb3378dddf7b8cfdf96564fd85b9e228","target":"graph","created_at":"2026-05-18T04:32:22Z","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 give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which generalize to new settings. More concretely, in the first part of the paper, we give a new proof of Yao's XOR-Lemma that additionally applies to related theorems in the cryptographic setting. Our proof seems simpler than previous ones, yet immediately generalizes to statements similar in spirit such as the extraction lemma used to obtain pseudo-random generators from one-way functions [Hastad, Impagliazzo, Levin, Luby, SIAM J. on Comp. 1999].\n  In the second part of the ","authors_text":"Grant Schoenebeck, Thomas Holenstein","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-02-18T14:50:53Z","title":"General Hardness Amplification of Predicates and Puzzles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3534","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:7aa090b0458e06c370634592dd99e9baa178dda5f50238683ce18b007bafdd49","target":"record","created_at":"2026-05-18T04:32:22Z","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":"49c393a502a75696802b7e1bbcd0a6e91ceea4911b11c4d0a66383b69f73a44f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-02-18T14:50:53Z","title_canon_sha256":"4619c99e4a713523c8ddfe6cfb878a33919011b3a173c46e46aeb0b957a97bda"},"schema_version":"1.0","source":{"id":"1002.3534","kind":"arxiv","version":2}},"canonical_sha256":"9823ddec0933038cd0c6922e478bd0b023d198bda44e278f5c126f8a1b13c196","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9823ddec0933038cd0c6922e478bd0b023d198bda44e278f5c126f8a1b13c196","first_computed_at":"2026-05-18T04:32:22.043171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:22.043171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"moNRI+P0OkG/p92GT7LDI4SUxnrwR6zJ7g1SKlqT9JSBZoTEeiJO2q86oqP5s09FifRU48PUsLJzoLUZN2xODA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:22.043994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.3534","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7aa090b0458e06c370634592dd99e9baa178dda5f50238683ce18b007bafdd49","sha256:acfbd301c42d495f039a9b7fac0796e6cb3378dddf7b8cfdf96564fd85b9e228"],"state_sha256":"03dcc53869d86e84d04942428cf7a623dae5c4e3d4c8bf3e3829e7b8b114e2de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZo7TpX7Yi+RIBGizJP9w53yf43cv3ByuCCAwfxYgmIu/kcJYTpqNFUkEjlWnDOZb+3LYgpcjNgfVR0zJjafDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:01:08.904607Z","bundle_sha256":"3b3fee1117683bdaf7ff3d46bec7aeb784cf4cf96e7110901a10fc3b55fe8ff7"}}