{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5SFFJQO6FSZYHCT2AIOOMRTJRB","short_pith_number":"pith:5SFFJQO6","schema_version":"1.0","canonical_sha256":"ec8a54c1de2cb3838a7a021ce646698854b7bdabeed3e108d227c96303d48db6","source":{"kind":"arxiv","id":"2311.10681","version":2},"attestation_state":"computed","paper":{"title":"An efficient quantum parallel repetition theorem and applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Henry Yuen, John Bostanci, Luowen Qian, Nicholas Spooner","submitted_at":"2023-11-17T18:06:36Z","abstract_excerpt":"We prove a tight parallel repetition theorem for $3$-message computationally-secure quantum interactive protocols between an efficient challenger and an efficient adversary. We also prove under plausible assumptions that the security of $4$-message computationally secure protocols does not generally decrease under parallel repetition. These mirror the classical results of Bellare, Impagliazzo, and Naor [BIN97]. Finally, we prove that all quantum argument systems can be generically compiled to an equivalent $3$-message argument system, mirroring the transformation for quantum proof systems [KW0"},"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":"2311.10681","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-17T18:06:36Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"d2bd553baf97171b66c21cd6c6cf53cfea305edcf25f70e403a204f9f038ff96","abstract_canon_sha256":"15a05daa675c878314c825975de4287920fa1219613105eacc7419231917d3db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:08:52.961169Z","signature_b64":"mmYI4O1MmICttoL7JWVTsh6h3ER8CZxvPSgktqL5Pfxu6ZMXukDNe0TXly0sQANaHXpTotgY5KkZNSQ+iZ+/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec8a54c1de2cb3838a7a021ce646698854b7bdabeed3e108d227c96303d48db6","last_reissued_at":"2026-07-05T08:08:52.960818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:08:52.960818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient quantum parallel repetition theorem and applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Henry Yuen, John Bostanci, Luowen Qian, Nicholas Spooner","submitted_at":"2023-11-17T18:06:36Z","abstract_excerpt":"We prove a tight parallel repetition theorem for $3$-message computationally-secure quantum interactive protocols between an efficient challenger and an efficient adversary. We also prove under plausible assumptions that the security of $4$-message computationally secure protocols does not generally decrease under parallel repetition. These mirror the classical results of Bellare, Impagliazzo, and Naor [BIN97]. Finally, we prove that all quantum argument systems can be generically compiled to an equivalent $3$-message argument system, mirroring the transformation for quantum proof systems [KW0"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10681","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.10681/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.10681","created_at":"2026-07-05T08:08:52.960868+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.10681v2","created_at":"2026-07-05T08:08:52.960868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10681","created_at":"2026-07-05T08:08:52.960868+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SFFJQO6FSZY","created_at":"2026-07-05T08:08:52.960868+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SFFJQO6FSZYHCT2","created_at":"2026-07-05T08:08:52.960868+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SFFJQO6","created_at":"2026-07-05T08:08:52.960868+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/5SFFJQO6FSZYHCT2AIOOMRTJRB","json":"https://pith.science/pith/5SFFJQO6FSZYHCT2AIOOMRTJRB.json","graph_json":"https://pith.science/api/pith-number/5SFFJQO6FSZYHCT2AIOOMRTJRB/graph.json","events_json":"https://pith.science/api/pith-number/5SFFJQO6FSZYHCT2AIOOMRTJRB/events.json","paper":"https://pith.science/paper/5SFFJQO6"},"agent_actions":{"view_html":"https://pith.science/pith/5SFFJQO6FSZYHCT2AIOOMRTJRB","download_json":"https://pith.science/pith/5SFFJQO6FSZYHCT2AIOOMRTJRB.json","view_paper":"https://pith.science/paper/5SFFJQO6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.10681&json=true","fetch_graph":"https://pith.science/api/pith-number/5SFFJQO6FSZYHCT2AIOOMRTJRB/graph.json","fetch_events":"https://pith.science/api/pith-number/5SFFJQO6FSZYHCT2AIOOMRTJRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SFFJQO6FSZYHCT2AIOOMRTJRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SFFJQO6FSZYHCT2AIOOMRTJRB/action/storage_attestation","attest_author":"https://pith.science/pith/5SFFJQO6FSZYHCT2AIOOMRTJRB/action/author_attestation","sign_citation":"https://pith.science/pith/5SFFJQO6FSZYHCT2AIOOMRTJRB/action/citation_signature","submit_replication":"https://pith.science/pith/5SFFJQO6FSZYHCT2AIOOMRTJRB/action/replication_record"}},"created_at":"2026-07-05T08:08:52.960868+00:00","updated_at":"2026-07-05T08:08:52.960868+00:00"}