{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NQNDPAV6VWV47NEUKRV2HG4YVX","short_pith_number":"pith:NQNDPAV6","schema_version":"1.0","canonical_sha256":"6c1a3782beadabcfb494546ba39b98adddcb64d533c71a2b4ddcd57dde592b00","source":{"kind":"arxiv","id":"1812.09290","version":1},"attestation_state":"computed","paper":{"title":"Round elimination in exact communication complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Debbie Leung, Florian Speelman, Harry Buhrman, Jop Bri\\\"et, Teresa Piovesan","submitted_at":"2018-12-21T18:02:13Z","abstract_excerpt":"We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of classical and quantum exact communication complexity. In particular, we consider two types of communication problems that we call promise equality and list problems. For both of these, it was already known that the one-round classical and one-round quantum complexities are characterized by the chromatic number and orthogonal rank of a certain graph, respectively.\n  In a promise equality problem, Alice and Bob must decide if their inputs are equal or not. We prove that classical protocols for su"},"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":"1812.09290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-12-21T18:02:13Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f85d00220c73799612f503a6310a18d37da993ea981b49bb43bff3a829b3af52","abstract_canon_sha256":"eb526ab3d364268fb733c33d64ce653dde838c2a2c566aef20c17fc379401fea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:44.872791Z","signature_b64":"tL8fIvac1167VVKtblC44iCf7NcyV9NkMujVBTlZSS7mNfe1ZELmToMi/84YgEM1cLzn5uzoJ1ccNZwREGuGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c1a3782beadabcfb494546ba39b98adddcb64d533c71a2b4ddcd57dde592b00","last_reissued_at":"2026-05-17T23:57:44.872197Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:44.872197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Round elimination in exact communication complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Debbie Leung, Florian Speelman, Harry Buhrman, Jop Bri\\\"et, Teresa Piovesan","submitted_at":"2018-12-21T18:02:13Z","abstract_excerpt":"We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of classical and quantum exact communication complexity. In particular, we consider two types of communication problems that we call promise equality and list problems. For both of these, it was already known that the one-round classical and one-round quantum complexities are characterized by the chromatic number and orthogonal rank of a certain graph, respectively.\n  In a promise equality problem, Alice and Bob must decide if their inputs are equal or not. We prove that classical protocols for su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09290","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":"1812.09290","created_at":"2026-05-17T23:57:44.872283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.09290v1","created_at":"2026-05-17T23:57:44.872283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09290","created_at":"2026-05-17T23:57:44.872283+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQNDPAV6VWV4","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQNDPAV6VWV47NEU","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQNDPAV6","created_at":"2026-05-18T12:32:40.477152+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/NQNDPAV6VWV47NEUKRV2HG4YVX","json":"https://pith.science/pith/NQNDPAV6VWV47NEUKRV2HG4YVX.json","graph_json":"https://pith.science/api/pith-number/NQNDPAV6VWV47NEUKRV2HG4YVX/graph.json","events_json":"https://pith.science/api/pith-number/NQNDPAV6VWV47NEUKRV2HG4YVX/events.json","paper":"https://pith.science/paper/NQNDPAV6"},"agent_actions":{"view_html":"https://pith.science/pith/NQNDPAV6VWV47NEUKRV2HG4YVX","download_json":"https://pith.science/pith/NQNDPAV6VWV47NEUKRV2HG4YVX.json","view_paper":"https://pith.science/paper/NQNDPAV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.09290&json=true","fetch_graph":"https://pith.science/api/pith-number/NQNDPAV6VWV47NEUKRV2HG4YVX/graph.json","fetch_events":"https://pith.science/api/pith-number/NQNDPAV6VWV47NEUKRV2HG4YVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQNDPAV6VWV47NEUKRV2HG4YVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQNDPAV6VWV47NEUKRV2HG4YVX/action/storage_attestation","attest_author":"https://pith.science/pith/NQNDPAV6VWV47NEUKRV2HG4YVX/action/author_attestation","sign_citation":"https://pith.science/pith/NQNDPAV6VWV47NEUKRV2HG4YVX/action/citation_signature","submit_replication":"https://pith.science/pith/NQNDPAV6VWV47NEUKRV2HG4YVX/action/replication_record"}},"created_at":"2026-05-17T23:57:44.872283+00:00","updated_at":"2026-05-17T23:57:44.872283+00:00"}