{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YY2C53SAP6FQG2MN5CRGDTMS4B","short_pith_number":"pith:YY2C53SA","schema_version":"1.0","canonical_sha256":"c6342eee407f8b03698de8a261cd92e04bd294fd29b004029c25ec664cada28f","source":{"kind":"arxiv","id":"2606.10408","version":1},"attestation_state":"computed","paper":{"title":"A Modular Approach to Succinct Arguments for QMA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Giulio Malavolta, James Bartusek, Jiahui Liu","submitted_at":"2026-06-03T21:38:23Z","abstract_excerpt":"Succinct argument systems are of central importance to modern crytpography, enabling the efficient verification of computational claims. In the classical setting, Kilian (STOC 92) established that any probabilistically checkable proof for NP can be transformed into a succinct argument system for NP using only collision-resistant hash functions. In the quantum setting, recent works have established the feasibility of (classically-verifiable) succinct arguments for QMA, capturing statements that require *quantum* proofs. However, known constructions all rely on the highly structured assumption o"},"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":"2606.10408","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-03T21:38:23Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"ca17b96f42d985e302e3beb004965f65f0278731ae5f8b8f2a7c5eb8df8aaab5","abstract_canon_sha256":"3e37b99cf2f31df9c016d3cf184db6362797ab3cfdc4464c831d066808e6fc4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:10:16.415251Z","signature_b64":"L2fCrfHp77r1UwCtkmaicln67gBjtQ+e/RHMLLImpRBTANCFcy19kCQvzHhW8Ib/nrA/C0xTwtiGR3sJ6sRhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6342eee407f8b03698de8a261cd92e04bd294fd29b004029c25ec664cada28f","last_reissued_at":"2026-06-10T01:10:16.414424Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:10:16.414424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Modular Approach to Succinct Arguments for QMA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Giulio Malavolta, James Bartusek, Jiahui Liu","submitted_at":"2026-06-03T21:38:23Z","abstract_excerpt":"Succinct argument systems are of central importance to modern crytpography, enabling the efficient verification of computational claims. In the classical setting, Kilian (STOC 92) established that any probabilistically checkable proof for NP can be transformed into a succinct argument system for NP using only collision-resistant hash functions. In the quantum setting, recent works have established the feasibility of (classically-verifiable) succinct arguments for QMA, capturing statements that require *quantum* proofs. However, known constructions all rely on the highly structured assumption o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10408","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.10408/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":"2606.10408","created_at":"2026-06-10T01:10:16.414566+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.10408v1","created_at":"2026-06-10T01:10:16.414566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10408","created_at":"2026-06-10T01:10:16.414566+00:00"},{"alias_kind":"pith_short_12","alias_value":"YY2C53SAP6FQ","created_at":"2026-06-10T01:10:16.414566+00:00"},{"alias_kind":"pith_short_16","alias_value":"YY2C53SAP6FQG2MN","created_at":"2026-06-10T01:10:16.414566+00:00"},{"alias_kind":"pith_short_8","alias_value":"YY2C53SA","created_at":"2026-06-10T01:10:16.414566+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/YY2C53SAP6FQG2MN5CRGDTMS4B","json":"https://pith.science/pith/YY2C53SAP6FQG2MN5CRGDTMS4B.json","graph_json":"https://pith.science/api/pith-number/YY2C53SAP6FQG2MN5CRGDTMS4B/graph.json","events_json":"https://pith.science/api/pith-number/YY2C53SAP6FQG2MN5CRGDTMS4B/events.json","paper":"https://pith.science/paper/YY2C53SA"},"agent_actions":{"view_html":"https://pith.science/pith/YY2C53SAP6FQG2MN5CRGDTMS4B","download_json":"https://pith.science/pith/YY2C53SAP6FQG2MN5CRGDTMS4B.json","view_paper":"https://pith.science/paper/YY2C53SA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.10408&json=true","fetch_graph":"https://pith.science/api/pith-number/YY2C53SAP6FQG2MN5CRGDTMS4B/graph.json","fetch_events":"https://pith.science/api/pith-number/YY2C53SAP6FQG2MN5CRGDTMS4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YY2C53SAP6FQG2MN5CRGDTMS4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YY2C53SAP6FQG2MN5CRGDTMS4B/action/storage_attestation","attest_author":"https://pith.science/pith/YY2C53SAP6FQG2MN5CRGDTMS4B/action/author_attestation","sign_citation":"https://pith.science/pith/YY2C53SAP6FQG2MN5CRGDTMS4B/action/citation_signature","submit_replication":"https://pith.science/pith/YY2C53SAP6FQG2MN5CRGDTMS4B/action/replication_record"}},"created_at":"2026-06-10T01:10:16.414566+00:00","updated_at":"2026-06-10T01:10:16.414566+00:00"}