{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VFLDPZPBC5EIVCHRPVL6WEI5VF","short_pith_number":"pith:VFLDPZPB","schema_version":"1.0","canonical_sha256":"a95637e5e117488a88f17d57eb111da97e8c1b873b28019e61ae3073eb2b5097","source":{"kind":"arxiv","id":"1907.08185","version":1},"attestation_state":"computed","paper":{"title":"Imperfect Gaps in Gap-ETH and PCPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mitali Bafna, Nikhil Vyas","submitted_at":"2019-07-18T17:48:19Z","abstract_excerpt":"We study the role of perfect completeness in probabilistically checkable proof systems (PCPs) and give a new way to transform a PCP with imperfect completeness to a PCP with perfect completeness when the initial gap is a constant. In particular, we show that $\\text{PCP}_{c,s}[r,q] \\subseteq \\text{PCP}_{1,1-\\Omega(1)}[r+O(1),q+O(r)]$, for $c-s=\\Omega(1)$. This implies that one can convert imperfect completeness to perfect in linear-sized PCPs for $NTIME[O(n)]$ with a $O(\\log n)$ additive loss in the query complexity $q$. We show our result by constructing a \"robust circuit\" using threshold gate"},"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":"1907.08185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-18T17:48:19Z","cross_cats_sorted":[],"title_canon_sha256":"8e86410501a186b5648e923673531e45fc7a16689cf1fba5c9488ccf38bf1099","abstract_canon_sha256":"5fba6b747acd5b51aefd561ab8b9b44d71f4e36f9636b28f34f973d50eed32b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:14.793826Z","signature_b64":"GddkUJucLIt8cJxeKklVNePVhQ+NRUpfhe3+1FU4mo8meEKmXVhNXm4y70zuNxlvOT0s0DH1MuMio230iqbMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a95637e5e117488a88f17d57eb111da97e8c1b873b28019e61ae3073eb2b5097","last_reissued_at":"2026-05-17T23:40:14.792952Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:14.792952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Imperfect Gaps in Gap-ETH and PCPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mitali Bafna, Nikhil Vyas","submitted_at":"2019-07-18T17:48:19Z","abstract_excerpt":"We study the role of perfect completeness in probabilistically checkable proof systems (PCPs) and give a new way to transform a PCP with imperfect completeness to a PCP with perfect completeness when the initial gap is a constant. In particular, we show that $\\text{PCP}_{c,s}[r,q] \\subseteq \\text{PCP}_{1,1-\\Omega(1)}[r+O(1),q+O(r)]$, for $c-s=\\Omega(1)$. This implies that one can convert imperfect completeness to perfect in linear-sized PCPs for $NTIME[O(n)]$ with a $O(\\log n)$ additive loss in the query complexity $q$. We show our result by constructing a \"robust circuit\" using threshold gate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08185","kind":"arxiv","version":1},"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":"1907.08185","created_at":"2026-05-17T23:40:14.793074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08185v1","created_at":"2026-05-17T23:40:14.793074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08185","created_at":"2026-05-17T23:40:14.793074+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFLDPZPBC5EI","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFLDPZPBC5EIVCHR","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFLDPZPB","created_at":"2026-05-18T12:33:30.264802+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/VFLDPZPBC5EIVCHRPVL6WEI5VF","json":"https://pith.science/pith/VFLDPZPBC5EIVCHRPVL6WEI5VF.json","graph_json":"https://pith.science/api/pith-number/VFLDPZPBC5EIVCHRPVL6WEI5VF/graph.json","events_json":"https://pith.science/api/pith-number/VFLDPZPBC5EIVCHRPVL6WEI5VF/events.json","paper":"https://pith.science/paper/VFLDPZPB"},"agent_actions":{"view_html":"https://pith.science/pith/VFLDPZPBC5EIVCHRPVL6WEI5VF","download_json":"https://pith.science/pith/VFLDPZPBC5EIVCHRPVL6WEI5VF.json","view_paper":"https://pith.science/paper/VFLDPZPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08185&json=true","fetch_graph":"https://pith.science/api/pith-number/VFLDPZPBC5EIVCHRPVL6WEI5VF/graph.json","fetch_events":"https://pith.science/api/pith-number/VFLDPZPBC5EIVCHRPVL6WEI5VF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFLDPZPBC5EIVCHRPVL6WEI5VF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFLDPZPBC5EIVCHRPVL6WEI5VF/action/storage_attestation","attest_author":"https://pith.science/pith/VFLDPZPBC5EIVCHRPVL6WEI5VF/action/author_attestation","sign_citation":"https://pith.science/pith/VFLDPZPBC5EIVCHRPVL6WEI5VF/action/citation_signature","submit_replication":"https://pith.science/pith/VFLDPZPBC5EIVCHRPVL6WEI5VF/action/replication_record"}},"created_at":"2026-05-17T23:40:14.793074+00:00","updated_at":"2026-05-17T23:40:14.793074+00:00"}