{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3JAFL45WSFDOOFWL3SWVFSCZ25","short_pith_number":"pith:3JAFL45W","schema_version":"1.0","canonical_sha256":"da4055f3b69146e716cbdcad52c859d74995f82cd70c1ed975a0b8c0c9c70e9c","source":{"kind":"arxiv","id":"1712.07400","version":1},"attestation_state":"computed","paper":{"title":"Shorter unentangled proofs for Ground State Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Nagaj, Libor Caha, Martin Schwarz","submitted_at":"2017-12-20T10:28:30Z","abstract_excerpt":"Can one considerably shorten a proof for a quantum problem by using a protocol with a constant number of unentangled provers? We consider a frustration-free variant of the QCMA-complete Ground State Connectivity (GSCON) problem for a system of size n with a proof of superlinear-size. We show that we can shorten this proof in QMA(2): there exists a two-copy, unentangled proof with length of order n, up to logarithmic factors, while the completeness-soundness gap of the new protocol becomes a small inverse polynomial in n."},"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":"1712.07400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-20T10:28:30Z","cross_cats_sorted":[],"title_canon_sha256":"83c5a43a32ec80ffb014d537ae146d49be6154b4c936a3b4cd6ff99dee798d77","abstract_canon_sha256":"af30977cf5bab1cdb443d39945a5df9f3fab5d4f7c42888e961879f577565f2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:02.391445Z","signature_b64":"tgBZoMcnCBDTHlYAqEO41Fg5xWQp9RQ3j91LS7jsx2ViizGQCBs0au43H0l2IC1WT3F7jliEmT4QnmFk3Rv4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da4055f3b69146e716cbdcad52c859d74995f82cd70c1ed975a0b8c0c9c70e9c","last_reissued_at":"2026-05-18T00:12:02.390749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:02.390749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shorter unentangled proofs for Ground State Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Nagaj, Libor Caha, Martin Schwarz","submitted_at":"2017-12-20T10:28:30Z","abstract_excerpt":"Can one considerably shorten a proof for a quantum problem by using a protocol with a constant number of unentangled provers? We consider a frustration-free variant of the QCMA-complete Ground State Connectivity (GSCON) problem for a system of size n with a proof of superlinear-size. We show that we can shorten this proof in QMA(2): there exists a two-copy, unentangled proof with length of order n, up to logarithmic factors, while the completeness-soundness gap of the new protocol becomes a small inverse polynomial in n."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07400","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":"1712.07400","created_at":"2026-05-18T00:12:02.390857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07400v1","created_at":"2026-05-18T00:12:02.390857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07400","created_at":"2026-05-18T00:12:02.390857+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JAFL45WSFDO","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JAFL45WSFDOOFWL","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JAFL45W","created_at":"2026-05-18T12:30:58.224056+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/3JAFL45WSFDOOFWL3SWVFSCZ25","json":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25.json","graph_json":"https://pith.science/api/pith-number/3JAFL45WSFDOOFWL3SWVFSCZ25/graph.json","events_json":"https://pith.science/api/pith-number/3JAFL45WSFDOOFWL3SWVFSCZ25/events.json","paper":"https://pith.science/paper/3JAFL45W"},"agent_actions":{"view_html":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25","download_json":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25.json","view_paper":"https://pith.science/paper/3JAFL45W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07400&json=true","fetch_graph":"https://pith.science/api/pith-number/3JAFL45WSFDOOFWL3SWVFSCZ25/graph.json","fetch_events":"https://pith.science/api/pith-number/3JAFL45WSFDOOFWL3SWVFSCZ25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25/action/storage_attestation","attest_author":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25/action/author_attestation","sign_citation":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25/action/citation_signature","submit_replication":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25/action/replication_record"}},"created_at":"2026-05-18T00:12:02.390857+00:00","updated_at":"2026-05-18T00:12:02.390857+00:00"}