{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:YNULHCL7UX6MQTJDPJBQ65GWC7","short_pith_number":"pith:YNULHCL7","schema_version":"1.0","canonical_sha256":"c368b3897fa5fcc84d237a430f74d617e1933cf60f9ff1f7470cac02f62e1d40","source":{"kind":"arxiv","id":"2004.05098","version":3},"attestation_state":"computed","paper":{"title":"Quantum advantages of communication complexity from Bell nonlocality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guang-Can Guo, Lu wei, Yu-Chun Wu, Zhih-Ahn Jia","submitted_at":"2020-04-10T16:32:14Z","abstract_excerpt":"Communication games are crucial tools for investigating the limitations of physical theories. The communication complexity (CC) problem is a typical example, for which several distributed parties attempt to jointly calculate a given function with limited classical communications. In this work, we present a method to construct CC problems from Bell tests in a graph-theoretic way. Starting from an experimental compatibility graph and the corresponding Bell test function, a target function which encodes the information of each edge can be constructed, then using this target function we could cons"},"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":"2004.05098","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-10T16:32:14Z","cross_cats_sorted":[],"title_canon_sha256":"939cdba952caf17cbcc98edbe4c60e0caf35480cd1c92c8a843edc2bf2a4f424","abstract_canon_sha256":"5df41af5ecb9e24921dcddaaab9df374dbf2693470187f88f7bbb219012a6ed9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:06.748809Z","signature_b64":"0y2jCHPpJNMuLhTSirjP5Qq3LUKyXs4TJvVowtNP0m6+9S/g2yP+yeqI5myVLAcZCSAiZI2EStXis6Vt99EzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c368b3897fa5fcc84d237a430f74d617e1933cf60f9ff1f7470cac02f62e1d40","last_reissued_at":"2026-07-05T02:51:06.748338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:06.748338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum advantages of communication complexity from Bell nonlocality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guang-Can Guo, Lu wei, Yu-Chun Wu, Zhih-Ahn Jia","submitted_at":"2020-04-10T16:32:14Z","abstract_excerpt":"Communication games are crucial tools for investigating the limitations of physical theories. The communication complexity (CC) problem is a typical example, for which several distributed parties attempt to jointly calculate a given function with limited classical communications. In this work, we present a method to construct CC problems from Bell tests in a graph-theoretic way. Starting from an experimental compatibility graph and the corresponding Bell test function, a target function which encodes the information of each edge can be constructed, then using this target function we could cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.05098","kind":"arxiv","version":3},"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/2004.05098/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":"2004.05098","created_at":"2026-07-05T02:51:06.748406+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.05098v3","created_at":"2026-07-05T02:51:06.748406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05098","created_at":"2026-07-05T02:51:06.748406+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNULHCL7UX6M","created_at":"2026-07-05T02:51:06.748406+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNULHCL7UX6MQTJD","created_at":"2026-07-05T02:51:06.748406+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNULHCL7","created_at":"2026-07-05T02:51:06.748406+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/YNULHCL7UX6MQTJDPJBQ65GWC7","json":"https://pith.science/pith/YNULHCL7UX6MQTJDPJBQ65GWC7.json","graph_json":"https://pith.science/api/pith-number/YNULHCL7UX6MQTJDPJBQ65GWC7/graph.json","events_json":"https://pith.science/api/pith-number/YNULHCL7UX6MQTJDPJBQ65GWC7/events.json","paper":"https://pith.science/paper/YNULHCL7"},"agent_actions":{"view_html":"https://pith.science/pith/YNULHCL7UX6MQTJDPJBQ65GWC7","download_json":"https://pith.science/pith/YNULHCL7UX6MQTJDPJBQ65GWC7.json","view_paper":"https://pith.science/paper/YNULHCL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.05098&json=true","fetch_graph":"https://pith.science/api/pith-number/YNULHCL7UX6MQTJDPJBQ65GWC7/graph.json","fetch_events":"https://pith.science/api/pith-number/YNULHCL7UX6MQTJDPJBQ65GWC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNULHCL7UX6MQTJDPJBQ65GWC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNULHCL7UX6MQTJDPJBQ65GWC7/action/storage_attestation","attest_author":"https://pith.science/pith/YNULHCL7UX6MQTJDPJBQ65GWC7/action/author_attestation","sign_citation":"https://pith.science/pith/YNULHCL7UX6MQTJDPJBQ65GWC7/action/citation_signature","submit_replication":"https://pith.science/pith/YNULHCL7UX6MQTJDPJBQ65GWC7/action/replication_record"}},"created_at":"2026-07-05T02:51:06.748406+00:00","updated_at":"2026-07-05T02:51:06.748406+00:00"}