{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:OMVPFX22DMBCYJEPWYPFAZLUU7","short_pith_number":"pith:OMVPFX22","schema_version":"1.0","canonical_sha256":"732af2df5a1b022c248fb61e506574a7e1170faaee0d45778de32d62cc43093e","source":{"kind":"arxiv","id":"1002.1606","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1002.1606","created_at":"2026-05-18T02:56:11.933506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.1606v4","created_at":"2026-05-18T02:56:11.933506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1606","created_at":"2026-05-18T02:56:11.933506+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMVPFX22DMBC","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMVPFX22DMBCYJEP","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMVPFX22","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7","json":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7.json","graph_json":"https://pith.science/api/pith-number/OMVPFX22DMBCYJEPWYPFAZLUU7/graph.json","events_json":"https://pith.science/api/pith-number/OMVPFX22DMBCYJEPWYPFAZLUU7/events.json","paper":"https://pith.science/paper/OMVPFX22"},"agent_actions":{"view_html":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7","download_json":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7.json","view_paper":"https://pith.science/paper/OMVPFX22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.1606&json=true","fetch_graph":"https://pith.science/api/pith-number/OMVPFX22DMBCYJEPWYPFAZLUU7/graph.json","fetch_events":"https://pith.science/api/pith-number/OMVPFX22DMBCYJEPWYPFAZLUU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7/action/storage_attestation","attest_author":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7/action/author_attestation","sign_citation":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7/action/citation_signature","submit_replication":"https://pith.science/pith/OMVPFX22DMBCYJEPWYPFAZLUU7/action/replication_record"}},"created_at":"2026-05-18T02:56:11.933506+00:00","updated_at":"2026-05-18T02:56:11.933506+00:00"}