{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WHFZ5HHPNB5B2SRMA5XJQIWCTM","short_pith_number":"pith:WHFZ5HHP","schema_version":"1.0","canonical_sha256":"b1cb9e9cef687a1d4a2c076e9822c29b2bf0998f31d91396be1f03bfb6ec660e","source":{"kind":"arxiv","id":"2411.03240","version":1},"attestation_state":"computed","paper":{"title":"Distributed Quantum Advantage for Local Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"cs.DC","authors_text":"Alkida Balliu, Augusto Modanese, Dennis Olivetti, Fran\\c{c}ois Le Gall, Francesco d'Amore, Henrik Lievonen, Isadora Veeren, Jukka Suomela, Lucas Tendick, Marc-Olivier Renou, Massimo Equi, Sebastian Brandt, Xavier Coiteux-Roy","submitted_at":"2024-11-05T16:38:49Z","abstract_excerpt":"We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prior work, such a separation was known only for an artificial graph problem with an inherently global definition [Le Gall et al. 2019]. We present a problem that we call iterated GHZ, which is defined using only local constraints. Formally, it is a family of locally checkable labeling problems [Naor and Stockmeyer 1995]; in particular, solutions can be verified with a constant-round distributed algorithm. We show that i"},"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":"2411.03240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-11-05T16:38:49Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"0790b471ca1d29e5c851b78d97d41c0445a1bb45ee64d879960d24e9efd5b7fa","abstract_canon_sha256":"11aae75514c8c98c0806f64b088dc43389d1378db012c6e6b59227a075d21ccb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:27.542062Z","signature_b64":"yabglkS8axpzlwr9307yMmBifLM3eKZeds6B5Njeul5HeOh0Y3GOoc19NJFNHbDl4iLpAYWvSe3Yu/BDPw8AAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1cb9e9cef687a1d4a2c076e9822c29b2bf0998f31d91396be1f03bfb6ec660e","last_reissued_at":"2026-07-05T09:31:27.541527Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:27.541527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Quantum Advantage for Local Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"cs.DC","authors_text":"Alkida Balliu, Augusto Modanese, Dennis Olivetti, Fran\\c{c}ois Le Gall, Francesco d'Amore, Henrik Lievonen, Isadora Veeren, Jukka Suomela, Lucas Tendick, Marc-Olivier Renou, Massimo Equi, Sebastian Brandt, Xavier Coiteux-Roy","submitted_at":"2024-11-05T16:38:49Z","abstract_excerpt":"We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prior work, such a separation was known only for an artificial graph problem with an inherently global definition [Le Gall et al. 2019]. We present a problem that we call iterated GHZ, which is defined using only local constraints. Formally, it is a family of locally checkable labeling problems [Naor and Stockmeyer 1995]; in particular, solutions can be verified with a constant-round distributed algorithm. We show that i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03240","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/2411.03240/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":"2411.03240","created_at":"2026-07-05T09:31:27.541580+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03240v1","created_at":"2026-07-05T09:31:27.541580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03240","created_at":"2026-07-05T09:31:27.541580+00:00"},{"alias_kind":"pith_short_12","alias_value":"WHFZ5HHPNB5B","created_at":"2026-07-05T09:31:27.541580+00:00"},{"alias_kind":"pith_short_16","alias_value":"WHFZ5HHPNB5B2SRM","created_at":"2026-07-05T09:31:27.541580+00:00"},{"alias_kind":"pith_short_8","alias_value":"WHFZ5HHP","created_at":"2026-07-05T09:31:27.541580+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07451","citing_title":"Operational criteria for quantum advantage in latency-constrained nonlocal games","ref_index":125,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WHFZ5HHPNB5B2SRMA5XJQIWCTM","json":"https://pith.science/pith/WHFZ5HHPNB5B2SRMA5XJQIWCTM.json","graph_json":"https://pith.science/api/pith-number/WHFZ5HHPNB5B2SRMA5XJQIWCTM/graph.json","events_json":"https://pith.science/api/pith-number/WHFZ5HHPNB5B2SRMA5XJQIWCTM/events.json","paper":"https://pith.science/paper/WHFZ5HHP"},"agent_actions":{"view_html":"https://pith.science/pith/WHFZ5HHPNB5B2SRMA5XJQIWCTM","download_json":"https://pith.science/pith/WHFZ5HHPNB5B2SRMA5XJQIWCTM.json","view_paper":"https://pith.science/paper/WHFZ5HHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03240&json=true","fetch_graph":"https://pith.science/api/pith-number/WHFZ5HHPNB5B2SRMA5XJQIWCTM/graph.json","fetch_events":"https://pith.science/api/pith-number/WHFZ5HHPNB5B2SRMA5XJQIWCTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WHFZ5HHPNB5B2SRMA5XJQIWCTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WHFZ5HHPNB5B2SRMA5XJQIWCTM/action/storage_attestation","attest_author":"https://pith.science/pith/WHFZ5HHPNB5B2SRMA5XJQIWCTM/action/author_attestation","sign_citation":"https://pith.science/pith/WHFZ5HHPNB5B2SRMA5XJQIWCTM/action/citation_signature","submit_replication":"https://pith.science/pith/WHFZ5HHPNB5B2SRMA5XJQIWCTM/action/replication_record"}},"created_at":"2026-07-05T09:31:27.541580+00:00","updated_at":"2026-07-05T09:31:27.541580+00:00"}