{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CUBS4T5BGFA4ERP7FDQFWFRW6T","short_pith_number":"pith:CUBS4T5B","canonical_record":{"source":{"id":"1505.06362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-23T18:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"9759177cb6d8922de7c686a6f4f3ffabfd94d169f2fccd5a6dbd3b968d557779","abstract_canon_sha256":"ed4b51cd3726d3982ca732f632749aa995727660af385584c00673f3dbcef7dc"},"schema_version":"1.0"},"canonical_sha256":"15032e4fa13141c245ff28e05b1636f4ee0d0462f59380fcfa4bee6be64c33cc","source":{"kind":"arxiv","id":"1505.06362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06362","created_at":"2026-05-18T00:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06362v1","created_at":"2026-05-18T00:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06362","created_at":"2026-05-18T00:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"CUBS4T5BGFA4","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CUBS4T5BGFA4ERP7","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CUBS4T5B","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CUBS4T5BGFA4ERP7FDQFWFRW6T","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-23T18:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"9759177cb6d8922de7c686a6f4f3ffabfd94d169f2fccd5a6dbd3b968d557779","abstract_canon_sha256":"ed4b51cd3726d3982ca732f632749aa995727660af385584c00673f3dbcef7dc"},"schema_version":"1.0"},"canonical_sha256":"15032e4fa13141c245ff28e05b1636f4ee0d0462f59380fcfa4bee6be64c33cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:59.533343Z","signature_b64":"sMZAmvNhuUmCaEAIcZBAfZtu9GnKRJ8wJVY7UGKDz0c6Ghch8IROdR1qc0tJe5If24UQbpt7odxW+SF44uMYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15032e4fa13141c245ff28e05b1636f4ee0d0462f59380fcfa4bee6be64c33cc","last_reissued_at":"2026-05-18T00:03:59.532648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:59.532648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06362","source_version":1,"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-18T00:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKoH9snBrhK1EkPDXWkYI3cs0iGNM3XttFRQEn3QPPHd4CMn15Zt4yx+jJz8Tbzu4gEfQlacJw0Vr3Mt0VHDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:19:25.413049Z"},"content_sha256":"80626a5e0cb2862f9df69e86df38f1df064bbbd28d49cce369881513c90f5036","schema_version":"1.0","event_id":"sha256:80626a5e0cb2862f9df69e86df38f1df064bbbd28d49cce369881513c90f5036"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CUBS4T5BGFA4ERP7FDQFWFRW6T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Guy Kindler, Irit Dinur, Prahladh Harsha","submitted_at":"2015-05-23T18:56:33Z","abstract_excerpt":"We show that every language in NP has a PCP verifier that tosses $O(\\log n)$ random coins, has perfect completeness, and a soundness error of at most $1/\\text{poly}(n)$, while making at most $O(\\text{poly}\\log\\log n)$ queries into a proof over an alphabet of size at most $n^{1/\\text{poly}\\log\\log n}$. Previous constructions that obtain $1/\\text{poly}(n)$ soundness error used either $\\text{poly}\\log n $ queries or an exponential sized alphabet, i.e. of size $2^{n^c}$ for some $c>0$. Our result is an exponential improvement in both parameters simultaneously.\n  Our result can be phrased as a poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06362","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"},"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-18T00:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozJBhj73b+C2rCxZklbIh+sZcx8xRx8tlxhyw9bxVhhXqAsH8SMlATzVuEDOLmqHjOtWGcEkXDH8SRihvSHwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:19:25.413404Z"},"content_sha256":"4869c6ae15bcb0a51cbe0ff40521f2e3a2b01458431559f4351e9347a80053e9","schema_version":"1.0","event_id":"sha256:4869c6ae15bcb0a51cbe0ff40521f2e3a2b01458431559f4351e9347a80053e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUBS4T5BGFA4ERP7FDQFWFRW6T/bundle.json","state_url":"https://pith.science/pith/CUBS4T5BGFA4ERP7FDQFWFRW6T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUBS4T5BGFA4ERP7FDQFWFRW6T/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-05-30T13:19:25Z","links":{"resolver":"https://pith.science/pith/CUBS4T5BGFA4ERP7FDQFWFRW6T","bundle":"https://pith.science/pith/CUBS4T5BGFA4ERP7FDQFWFRW6T/bundle.json","state":"https://pith.science/pith/CUBS4T5BGFA4ERP7FDQFWFRW6T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUBS4T5BGFA4ERP7FDQFWFRW6T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CUBS4T5BGFA4ERP7FDQFWFRW6T","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":"ed4b51cd3726d3982ca732f632749aa995727660af385584c00673f3dbcef7dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-23T18:56:33Z","title_canon_sha256":"9759177cb6d8922de7c686a6f4f3ffabfd94d169f2fccd5a6dbd3b968d557779"},"schema_version":"1.0","source":{"id":"1505.06362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06362","created_at":"2026-05-18T00:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06362v1","created_at":"2026-05-18T00:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06362","created_at":"2026-05-18T00:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"CUBS4T5BGFA4","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CUBS4T5BGFA4ERP7","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CUBS4T5B","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:4869c6ae15bcb0a51cbe0ff40521f2e3a2b01458431559f4351e9347a80053e9","target":"graph","created_at":"2026-05-18T00:03:59Z","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 show that every language in NP has a PCP verifier that tosses $O(\\log n)$ random coins, has perfect completeness, and a soundness error of at most $1/\\text{poly}(n)$, while making at most $O(\\text{poly}\\log\\log n)$ queries into a proof over an alphabet of size at most $n^{1/\\text{poly}\\log\\log n}$. Previous constructions that obtain $1/\\text{poly}(n)$ soundness error used either $\\text{poly}\\log n $ queries or an exponential sized alphabet, i.e. of size $2^{n^c}$ for some $c>0$. Our result is an exponential improvement in both parameters simultaneously.\n  Our result can be phrased as a poly","authors_text":"Guy Kindler, Irit Dinur, Prahladh Harsha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-23T18:56:33Z","title":"Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06362","kind":"arxiv","version":1},"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:80626a5e0cb2862f9df69e86df38f1df064bbbd28d49cce369881513c90f5036","target":"record","created_at":"2026-05-18T00:03:59Z","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":"ed4b51cd3726d3982ca732f632749aa995727660af385584c00673f3dbcef7dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-23T18:56:33Z","title_canon_sha256":"9759177cb6d8922de7c686a6f4f3ffabfd94d169f2fccd5a6dbd3b968d557779"},"schema_version":"1.0","source":{"id":"1505.06362","kind":"arxiv","version":1}},"canonical_sha256":"15032e4fa13141c245ff28e05b1636f4ee0d0462f59380fcfa4bee6be64c33cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15032e4fa13141c245ff28e05b1636f4ee0d0462f59380fcfa4bee6be64c33cc","first_computed_at":"2026-05-18T00:03:59.532648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:59.532648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sMZAmvNhuUmCaEAIcZBAfZtu9GnKRJ8wJVY7UGKDz0c6Ghch8IROdR1qc0tJe5If24UQbpt7odxW+SF44uMYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:59.533343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80626a5e0cb2862f9df69e86df38f1df064bbbd28d49cce369881513c90f5036","sha256:4869c6ae15bcb0a51cbe0ff40521f2e3a2b01458431559f4351e9347a80053e9"],"state_sha256":"165f583d27df482612a0e823e3251b81dd0cef875b342e67a72dd17f88956ba6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgPOQyOwuQyVU+FlQfUYlYs3byvy3V3trX5fPL8BHc5CMw5uQYIshJTg1eSWksepZtxkpN1C8i2GmxzZBdV1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:19:25.415403Z","bundle_sha256":"2d7a0fc8b7b519cc4549ec0158fa7361a5e5e8fdb0d369f21e19dad1b69df484"}}