{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UFON4IUHCJUIUMV2SKNQLCPHGP","short_pith_number":"pith:UFON4IUH","schema_version":"1.0","canonical_sha256":"a15cde228712688a32ba929b0589e733e0fa6ff41f28a2e03a68dfdda407d280","source":{"kind":"arxiv","id":"1309.7739","version":1},"attestation_state":"computed","paper":{"title":"Communication complexity of promise problems and their applications to finite automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","quant-ph"],"primary_cat":"cs.CC","authors_text":"Daowen Qiu, Jozef Gruska, Shenggen Zheng","submitted_at":"2013-09-30T07:10:49Z","abstract_excerpt":"Equality and disjointness are two of the most studied problems in communication complexity. They have been studied for both classical and also quantum communication and for various models and modes of communication. Buhrman et al. [Buh98] proved that the exact quantum communication complexity for a promise version of the equality problem is ${\\bf O}(\\log {n})$ while the classical deterministic communication complexity is $n+1$ for two-way communication, which was the first impressively large (exponential) gap between quantum and classical (deterministic and probabilistic) communication complex"},"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":"1309.7739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-30T07:10:49Z","cross_cats_sorted":["cs.FL","quant-ph"],"title_canon_sha256":"5b06a90a2682eacb89f0064f0c6e87072b60dd128427234778b8d93c323e7852","abstract_canon_sha256":"b050fb1472d053aba48fe51e62cc87ef43bc148c2a0aa37758d31cbff415dea8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:48.464386Z","signature_b64":"jbpb8LHesKP265laPy1qws9dYTziFlSyOYgAzyaz/MSnl21Rxxs90U6eYZc3Daw0qz+N5LIdebfSJt6/o34PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a15cde228712688a32ba929b0589e733e0fa6ff41f28a2e03a68dfdda407d280","last_reissued_at":"2026-05-18T03:11:48.463599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:48.463599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication complexity of promise problems and their applications to finite automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","quant-ph"],"primary_cat":"cs.CC","authors_text":"Daowen Qiu, Jozef Gruska, Shenggen Zheng","submitted_at":"2013-09-30T07:10:49Z","abstract_excerpt":"Equality and disjointness are two of the most studied problems in communication complexity. They have been studied for both classical and also quantum communication and for various models and modes of communication. Buhrman et al. [Buh98] proved that the exact quantum communication complexity for a promise version of the equality problem is ${\\bf O}(\\log {n})$ while the classical deterministic communication complexity is $n+1$ for two-way communication, which was the first impressively large (exponential) gap between quantum and classical (deterministic and probabilistic) communication complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7739","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":"1309.7739","created_at":"2026-05-18T03:11:48.463708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7739v1","created_at":"2026-05-18T03:11:48.463708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7739","created_at":"2026-05-18T03:11:48.463708+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFON4IUHCJUI","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFON4IUHCJUIUMV2","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFON4IUH","created_at":"2026-05-18T12:28:02.375192+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/UFON4IUHCJUIUMV2SKNQLCPHGP","json":"https://pith.science/pith/UFON4IUHCJUIUMV2SKNQLCPHGP.json","graph_json":"https://pith.science/api/pith-number/UFON4IUHCJUIUMV2SKNQLCPHGP/graph.json","events_json":"https://pith.science/api/pith-number/UFON4IUHCJUIUMV2SKNQLCPHGP/events.json","paper":"https://pith.science/paper/UFON4IUH"},"agent_actions":{"view_html":"https://pith.science/pith/UFON4IUHCJUIUMV2SKNQLCPHGP","download_json":"https://pith.science/pith/UFON4IUHCJUIUMV2SKNQLCPHGP.json","view_paper":"https://pith.science/paper/UFON4IUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7739&json=true","fetch_graph":"https://pith.science/api/pith-number/UFON4IUHCJUIUMV2SKNQLCPHGP/graph.json","fetch_events":"https://pith.science/api/pith-number/UFON4IUHCJUIUMV2SKNQLCPHGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFON4IUHCJUIUMV2SKNQLCPHGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFON4IUHCJUIUMV2SKNQLCPHGP/action/storage_attestation","attest_author":"https://pith.science/pith/UFON4IUHCJUIUMV2SKNQLCPHGP/action/author_attestation","sign_citation":"https://pith.science/pith/UFON4IUHCJUIUMV2SKNQLCPHGP/action/citation_signature","submit_replication":"https://pith.science/pith/UFON4IUHCJUIUMV2SKNQLCPHGP/action/replication_record"}},"created_at":"2026-05-18T03:11:48.463708+00:00","updated_at":"2026-05-18T03:11:48.463708+00:00"}