{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3JAFL45WSFDOOFWL3SWVFSCZ25","short_pith_number":"pith:3JAFL45W","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"},"canonical_sha256":"da4055f3b69146e716cbdcad52c859d74995f82cd70c1ed975a0b8c0c9c70e9c","source":{"kind":"arxiv","id":"1712.07400","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07400","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07400v1","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07400","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"pith_short_12","alias_value":"3JAFL45WSFDO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3JAFL45WSFDOOFWL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3JAFL45W","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3JAFL45WSFDOOFWL3SWVFSCZ25","target":"record","payload":{"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"},"canonical_sha256":"da4055f3b69146e716cbdcad52c859d74995f82cd70c1ed975a0b8c0c9c70e9c","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"},"source_kind":"arxiv","source_id":"1712.07400","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:12:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7xb8QEX3zynSlGT5rEwvgLYpk3cQNxadcOhIijIpD55E5/4CureYORiMXOJm6AvDhRN38P6vWhVZKUTgUH+jCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:47:31.521264Z"},"content_sha256":"c576aa53c231d29ba100fccda0945ebd044be3650d638d7618d6c8a3b64e024c","schema_version":"1.0","event_id":"sha256:c576aa53c231d29ba100fccda0945ebd044be3650d638d7618d6c8a3b64e024c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3JAFL45WSFDOOFWL3SWVFSCZ25","target":"graph","payload":{"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"},"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:12:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+F0FtgmeOfqX1ZaleTcc3nRuDgP5YsD6Yvif7FKgKu1DKbrF9yZWsWOaqciVn0qVNkzdAiDSMP2d0PTo9pLuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:47:31.521628Z"},"content_sha256":"b27029f4b4c7afcef2d0400c4d82a8f20f0d62a6e989d3e129088f9574e8d12c","schema_version":"1.0","event_id":"sha256:b27029f4b4c7afcef2d0400c4d82a8f20f0d62a6e989d3e129088f9574e8d12c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25/bundle.json","state_url":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JAFL45WSFDOOFWL3SWVFSCZ25/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-06-09T10:47:31Z","links":{"resolver":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25","bundle":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25/bundle.json","state":"https://pith.science/pith/3JAFL45WSFDOOFWL3SWVFSCZ25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JAFL45WSFDOOFWL3SWVFSCZ25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3JAFL45WSFDOOFWL3SWVFSCZ25","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":"af30977cf5bab1cdb443d39945a5df9f3fab5d4f7c42888e961879f577565f2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-20T10:28:30Z","title_canon_sha256":"83c5a43a32ec80ffb014d537ae146d49be6154b4c936a3b4cd6ff99dee798d77"},"schema_version":"1.0","source":{"id":"1712.07400","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07400","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07400v1","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07400","created_at":"2026-05-18T00:12:02Z"},{"alias_kind":"pith_short_12","alias_value":"3JAFL45WSFDO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3JAFL45WSFDOOFWL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3JAFL45W","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:b27029f4b4c7afcef2d0400c4d82a8f20f0d62a6e989d3e129088f9574e8d12c","target":"graph","created_at":"2026-05-18T00:12:02Z","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":"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.","authors_text":"Daniel Nagaj, Libor Caha, Martin Schwarz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-20T10:28:30Z","title":"Shorter unentangled proofs for Ground State Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07400","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:c576aa53c231d29ba100fccda0945ebd044be3650d638d7618d6c8a3b64e024c","target":"record","created_at":"2026-05-18T00:12:02Z","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":"af30977cf5bab1cdb443d39945a5df9f3fab5d4f7c42888e961879f577565f2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-20T10:28:30Z","title_canon_sha256":"83c5a43a32ec80ffb014d537ae146d49be6154b4c936a3b4cd6ff99dee798d77"},"schema_version":"1.0","source":{"id":"1712.07400","kind":"arxiv","version":1}},"canonical_sha256":"da4055f3b69146e716cbdcad52c859d74995f82cd70c1ed975a0b8c0c9c70e9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da4055f3b69146e716cbdcad52c859d74995f82cd70c1ed975a0b8c0c9c70e9c","first_computed_at":"2026-05-18T00:12:02.390749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:02.390749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tgBZoMcnCBDTHlYAqEO41Fg5xWQp9RQ3j91LS7jsx2ViizGQCBs0au43H0l2IC1WT3F7jliEmT4QnmFk3Rv4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:02.391445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07400","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c576aa53c231d29ba100fccda0945ebd044be3650d638d7618d6c8a3b64e024c","sha256:b27029f4b4c7afcef2d0400c4d82a8f20f0d62a6e989d3e129088f9574e8d12c"],"state_sha256":"c43226a154a77914d70a19991c6bf38c090b815cadf5e943e1f2ded12e0c29c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lspYJx4Tpr2T1Csx0MeyD0mkTrvM0cPQ+mWpoq63sKOGsACzsUt+/BlhyeBSFv6dvwgT5oeLg9jG93B7lI52DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:47:31.524100Z","bundle_sha256":"cd173f44b23b66ee055124352fe5a8ceab99d13371df2bba248a5ae73468a8be"}}