{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7377X47NPRZBDDSXOA7MFWK3BM","short_pith_number":"pith:7377X47N","schema_version":"1.0","canonical_sha256":"fefffbf3ed7c72118e57703ec2d95b0b01906cf9c03b2942fbc87aed97abb115","source":{"kind":"arxiv","id":"2505.05253","version":2},"attestation_state":"computed","paper":{"title":"Gap-preserving reductions and RE-completeness of independent set games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OA"],"primary_cat":"quant-ph","authors_text":"Laura Man\\v{c}inska, Matthijs Vernooij, Pieter Spaas, Taro Spirig","submitted_at":"2025-05-08T13:58:52Z","abstract_excerpt":"In complexity theory, gap-preserving reductions play a crucial role in studying hardness of approximation and in analyzing the relative complexity of multiprover interactive proof systems. In the quantum setting, multiprover interactive proof systems with entangled provers correspond to gapped promise problems for nonlocal games, and the recent result MIP$^*$=RE \\cite{ji2020mipre} shows that these are in general undecidable. However, the relative complexity of problems within MIP$^*$ is still not well-understood, as establishing gap-preserving reductions in the quantum setting presents new cha"},"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":"2505.05253","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-08T13:58:52Z","cross_cats_sorted":["cs.CC","math.OA"],"title_canon_sha256":"edcc2986c3c877e9da49983e962372753dcf9e55d967cfa2d484bff555985355","abstract_canon_sha256":"7624ca2a57c947493b0c39a1a405a99206c91387eb83fbc7c54110fc06965ac3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:22.611577Z","signature_b64":"iK1dqRH/YLF75UhMli1Jn6kOxC0AG5CuglKzcs0ew1uFHSEd6f8KeUfLv0wS3+d1FSFkdtbCW4l43wQoiMkzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fefffbf3ed7c72118e57703ec2d95b0b01906cf9c03b2942fbc87aed97abb115","last_reissued_at":"2026-07-05T12:01:22.611047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:22.611047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gap-preserving reductions and RE-completeness of independent set games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OA"],"primary_cat":"quant-ph","authors_text":"Laura Man\\v{c}inska, Matthijs Vernooij, Pieter Spaas, Taro Spirig","submitted_at":"2025-05-08T13:58:52Z","abstract_excerpt":"In complexity theory, gap-preserving reductions play a crucial role in studying hardness of approximation and in analyzing the relative complexity of multiprover interactive proof systems. In the quantum setting, multiprover interactive proof systems with entangled provers correspond to gapped promise problems for nonlocal games, and the recent result MIP$^*$=RE \\cite{ji2020mipre} shows that these are in general undecidable. However, the relative complexity of problems within MIP$^*$ is still not well-understood, as establishing gap-preserving reductions in the quantum setting presents new cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05253","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/2505.05253/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":"2505.05253","created_at":"2026-07-05T12:01:22.611108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05253v2","created_at":"2026-07-05T12:01:22.611108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05253","created_at":"2026-07-05T12:01:22.611108+00:00"},{"alias_kind":"pith_short_12","alias_value":"7377X47NPRZB","created_at":"2026-07-05T12:01:22.611108+00:00"},{"alias_kind":"pith_short_16","alias_value":"7377X47NPRZBDDSX","created_at":"2026-07-05T12:01:22.611108+00:00"},{"alias_kind":"pith_short_8","alias_value":"7377X47N","created_at":"2026-07-05T12:01:22.611108+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07835","citing_title":"Existence and nonexistence of commutativity gadgets for entangled CSPs","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7377X47NPRZBDDSXOA7MFWK3BM","json":"https://pith.science/pith/7377X47NPRZBDDSXOA7MFWK3BM.json","graph_json":"https://pith.science/api/pith-number/7377X47NPRZBDDSXOA7MFWK3BM/graph.json","events_json":"https://pith.science/api/pith-number/7377X47NPRZBDDSXOA7MFWK3BM/events.json","paper":"https://pith.science/paper/7377X47N"},"agent_actions":{"view_html":"https://pith.science/pith/7377X47NPRZBDDSXOA7MFWK3BM","download_json":"https://pith.science/pith/7377X47NPRZBDDSXOA7MFWK3BM.json","view_paper":"https://pith.science/paper/7377X47N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05253&json=true","fetch_graph":"https://pith.science/api/pith-number/7377X47NPRZBDDSXOA7MFWK3BM/graph.json","fetch_events":"https://pith.science/api/pith-number/7377X47NPRZBDDSXOA7MFWK3BM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7377X47NPRZBDDSXOA7MFWK3BM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7377X47NPRZBDDSXOA7MFWK3BM/action/storage_attestation","attest_author":"https://pith.science/pith/7377X47NPRZBDDSXOA7MFWK3BM/action/author_attestation","sign_citation":"https://pith.science/pith/7377X47NPRZBDDSXOA7MFWK3BM/action/citation_signature","submit_replication":"https://pith.science/pith/7377X47NPRZBDDSXOA7MFWK3BM/action/replication_record"}},"created_at":"2026-07-05T12:01:22.611108+00:00","updated_at":"2026-07-05T12:01:22.611108+00:00"}