{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:V5ENIPXEP2VOLBRAYLOHYO4OOI","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":"ac72e4efa73837da62ba7bbf81892fc52b3b5c59462c867d49f40bf9dadea4a7","cross_cats_sorted":["cs.DB","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-23T19:45:38Z","title_canon_sha256":"f27805c2ec7c1ac5d5ea1902800a2a1ce8f68813b304495a1f9346b44cf54226"},"schema_version":"1.0","source":{"id":"1608.06617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06617","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06617v1","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06617","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"V5ENIPXEP2VO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V5ENIPXEP2VOLBRA","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V5ENIPXE","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:198843d1b855250aa8c7c2646fa7e7fa67be69b8799e3131501eaeb506dd6668","target":"graph","created_at":"2026-05-18T01:08:13Z","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":"Computing set joins of two inputs is a common task in database theory. Recently, Van Gucht, Williams, Woodruff and Zhang [PODS 2015] considered the complexity of such problems in the natural model of (classical) two-party communication complexity and obtained tight bounds for the complexity of several important distributed set joins.\n  In this paper we initiate the study of the *quantum* communication complexity of distributed set joins. We design a quantum protocol for distributed Boolean matrix multiplication, which corresponds to computing the composition join of two databases, showing that","authors_text":"Fran\\c{c}ois Le Gall, Stacey Jeffery","cross_cats":["cs.DB","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-23T19:45:38Z","title":"Quantum Communication Complexity of Distributed Set Joins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06617","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:88eb3507409a5cc817d375820f2e89abe6cbb50afcbb38c890b5b23bce413151","target":"record","created_at":"2026-05-18T01:08:13Z","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":"ac72e4efa73837da62ba7bbf81892fc52b3b5c59462c867d49f40bf9dadea4a7","cross_cats_sorted":["cs.DB","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-23T19:45:38Z","title_canon_sha256":"f27805c2ec7c1ac5d5ea1902800a2a1ce8f68813b304495a1f9346b44cf54226"},"schema_version":"1.0","source":{"id":"1608.06617","kind":"arxiv","version":1}},"canonical_sha256":"af48d43ee47eaae58620c2dc7c3b8e721d3851fabdec2d5f14f111d97ee3c6ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af48d43ee47eaae58620c2dc7c3b8e721d3851fabdec2d5f14f111d97ee3c6ab","first_computed_at":"2026-05-18T01:08:13.641768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:13.641768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mJoqK8uX/ZQZD1CHnwnuJrK38M+G7EVU8CobD69LDhMT4qfjmCGLrsygM5iAr0n5a4mqAeXR3rEC7xCdnyT8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:13.642419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88eb3507409a5cc817d375820f2e89abe6cbb50afcbb38c890b5b23bce413151","sha256:198843d1b855250aa8c7c2646fa7e7fa67be69b8799e3131501eaeb506dd6668"],"state_sha256":"d565b961de75f9cf653d6fec5036d7f4a07d778013899328feaf173703faf4d5"}