{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OMVPFX22DMBCYJEPWYPFAZLUU7","short_pith_number":"pith:OMVPFX22","canonical_record":{"source":{"id":"1002.1606","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-02-08T13:59:28Z","cross_cats_sorted":[],"title_canon_sha256":"e2b66d2c8bda5454da3cce949c50f6a94ab70ba5a6946862e4824f11b5bf7708","abstract_canon_sha256":"693afa9f15e42a137156a866459d5539e05117ad293c3925009cc6ae57990389"},"schema_version":"1.0"},"canonical_sha256":"732af2df5a1b022c248fb61e506574a7e1170faaee0d45778de32d62cc43093e","source":{"kind":"arxiv","id":"1002.1606","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.1606","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1002.1606v4","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1606","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"OMVPFX22DMBC","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OMVPFX22DMBCYJEP","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OMVPFX22","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OMVPFX22DMBCYJEPWYPFAZLUU7","target":"record","payload":{"canonical_record":{"source":{"id":"1002.1606","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-02-08T13:59:28Z","cross_cats_sorted":[],"title_canon_sha256":"e2b66d2c8bda5454da3cce949c50f6a94ab70ba5a6946862e4824f11b5bf7708","abstract_canon_sha256":"693afa9f15e42a137156a866459d5539e05117ad293c3925009cc6ae57990389"},"schema_version":"1.0"},"canonical_sha256":"732af2df5a1b022c248fb61e506574a7e1170faaee0d45778de32d62cc43093e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:11.933839Z","signature_b64":"VXv39Njd7OHlrsJein9f4RU/VQEncwYmLlGSB9Nw3h5HwA6F3TgWfYMJZlFbPOYYdF0y3MGlA2ovi4gHakzABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"732af2df5a1b022c248fb61e506574a7e1170faaee0d45778de32d62cc43093e","last_reissued_at":"2026-05-18T02:56:11.933444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:11.933444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.1606","source_version":4,"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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j8msiWrNI7lmifAtFE2sHi+aVDtZCO7S1AoX7n103DS9YvBvvabT1YVreD2JC8cVSME34S3Fum8+KOy5ruNnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:46:03.262373Z"},"content_sha256":"d8707f941a446ba5ab0582ee57f33f9beee99a819e25ff76c29b7bf3851d45b2","schema_version":"1.0","event_id":"sha256:d8707f941a446ba5ab0582ee57f33f9beee99a819e25ff76c29b7bf3851d45b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OMVPFX22DMBCYJEPWYPFAZLUU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Derandomized Parallel Repetition via Structured PCPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Irit Dinur, Or Meir","submitted_at":"2010-02-08T13:59:28Z","abstract_excerpt":"A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return is allowed to err with some bounded probability. The probability that the verifier accepts a false proof is called the soundness error, and is an important parameter of a PCP system that one seeks to minimize. Constructing PCPs with sub-constant soundness error and, at the same time, a minimal number of queries into the proof (namely two) is especially important due to applications for inapproximability.\n  In this wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1606","kind":"arxiv","version":4},"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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zge4o9auBnolKf3SIlTL5Ct7aycR9WZ+J/CjMNOtEEO/KS+Mlz3rdgYPrh01Noea3vVbrrrqPkCZEsg+baVMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:46:03.262732Z"},"content_sha256":"7b7768ca7818471ac04866aad52f018ff44702cde9f1567ac4a7c4c101f1c68e","schema_version":"1.0","event_id":"sha256:7b7768ca7818471ac04866aad52f018ff44702cde9f1567ac4a7c4c101f1c68e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7/bundle.json","state_url":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMVPFX22DMBCYJEPWYPFAZLUU7/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-25T22:46:03Z","links":{"resolver":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7","bundle":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7/bundle.json","state":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMVPFX22DMBCYJEPWYPFAZLUU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OMVPFX22DMBCYJEPWYPFAZLUU7","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":"693afa9f15e42a137156a866459d5539e05117ad293c3925009cc6ae57990389","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-02-08T13:59:28Z","title_canon_sha256":"e2b66d2c8bda5454da3cce949c50f6a94ab70ba5a6946862e4824f11b5bf7708"},"schema_version":"1.0","source":{"id":"1002.1606","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.1606","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1002.1606v4","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1606","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"OMVPFX22DMBC","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OMVPFX22DMBCYJEP","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OMVPFX22","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:7b7768ca7818471ac04866aad52f018ff44702cde9f1567ac4a7c4c101f1c68e","target":"graph","created_at":"2026-05-18T02:56:11Z","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":"A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return is allowed to err with some bounded probability. The probability that the verifier accepts a false proof is called the soundness error, and is an important parameter of a PCP system that one seeks to minimize. Constructing PCPs with sub-constant soundness error and, at the same time, a minimal number of queries into the proof (namely two) is especially important due to applications for inapproximability.\n  In this wo","authors_text":"Irit Dinur, Or Meir","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-02-08T13:59:28Z","title":"Derandomized Parallel Repetition via Structured PCPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1606","kind":"arxiv","version":4},"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:d8707f941a446ba5ab0582ee57f33f9beee99a819e25ff76c29b7bf3851d45b2","target":"record","created_at":"2026-05-18T02:56:11Z","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":"693afa9f15e42a137156a866459d5539e05117ad293c3925009cc6ae57990389","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-02-08T13:59:28Z","title_canon_sha256":"e2b66d2c8bda5454da3cce949c50f6a94ab70ba5a6946862e4824f11b5bf7708"},"schema_version":"1.0","source":{"id":"1002.1606","kind":"arxiv","version":4}},"canonical_sha256":"732af2df5a1b022c248fb61e506574a7e1170faaee0d45778de32d62cc43093e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"732af2df5a1b022c248fb61e506574a7e1170faaee0d45778de32d62cc43093e","first_computed_at":"2026-05-18T02:56:11.933444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:11.933444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VXv39Njd7OHlrsJein9f4RU/VQEncwYmLlGSB9Nw3h5HwA6F3TgWfYMJZlFbPOYYdF0y3MGlA2ovi4gHakzABg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:11.933839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.1606","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8707f941a446ba5ab0582ee57f33f9beee99a819e25ff76c29b7bf3851d45b2","sha256:7b7768ca7818471ac04866aad52f018ff44702cde9f1567ac4a7c4c101f1c68e"],"state_sha256":"986309e5e2c33124547987ddbe6b0c3697453afde950d122cc7c74cb8536fd54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9MKZlhddaAkMn19lLjfmDOcxoCrYNimRCvMGRUx1GVjtpRtd+65zzTz1by3f26FmBm9nH2FweacmS1R+i0HDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:46:03.264748Z","bundle_sha256":"f1bad3bacddd7abd9a874c2491bed7444035a5ab12ec4b3439896621bf249791"}}