{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:O5DRGMPRXUI7LLDRLLSCOHK5WO","short_pith_number":"pith:O5DRGMPR","schema_version":"1.0","canonical_sha256":"77471331f1bd11f5ac715ae4271d5db3ae652fa6e86d906f3c9141af151b3dac","source":{"kind":"arxiv","id":"1402.7254","version":3},"attestation_state":"computed","paper":{"title":"Generalizations of the distributed Deutsch-Jozsa promise problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","cs.FL"],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Jozef Gruska, Shenggen Zheng","submitted_at":"2014-02-28T14:21:06Z","abstract_excerpt":"In the {\\em distributed Deutsch-Jozsa promise problem}, two parties are to determine whether their respective strings $x,y\\in\\{0,1\\}^n$ are at the {\\em Hamming distance} $H(x,y)=0$ or $H(x,y)=\\frac{n}{2}$. Buhrman et al. (STOC' 98) proved that the exact {\\em quantum communication complexity} of this problem is ${\\bf O}(\\log {n})$ while the {\\em deterministic communication complexity} is ${\\bf \\Omega}(n)$. This was the first impressive (exponential) gap between quantum and classical communication complexity.\n  In this paper, we generalize the above distributed Deutsch-Jozsa promise problem to d"},"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":"1402.7254","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-28T14:21:06Z","cross_cats_sorted":["cs.CC","cs.DC","cs.FL"],"title_canon_sha256":"65c86eea68606975648caf2fa64317504a46f8e82a8fa5a3e3669c1464537a67","abstract_canon_sha256":"edac8eb170010b374593c3e62ce1613d0856b68cbf311111b423e58346db30c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:51.916019Z","signature_b64":"V18EKHr6l6jNTH/jijZ+KLyRLqjbgXfVaYgLelZ7UXQTRPoYiRXCbhyaewmm/8HBUJsd5A+4RrkKzTfsT8E2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77471331f1bd11f5ac715ae4271d5db3ae652fa6e86d906f3c9141af151b3dac","last_reissued_at":"2026-05-18T02:21:51.915363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:51.915363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalizations of the distributed Deutsch-Jozsa promise problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","cs.FL"],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Jozef Gruska, Shenggen Zheng","submitted_at":"2014-02-28T14:21:06Z","abstract_excerpt":"In the {\\em distributed Deutsch-Jozsa promise problem}, two parties are to determine whether their respective strings $x,y\\in\\{0,1\\}^n$ are at the {\\em Hamming distance} $H(x,y)=0$ or $H(x,y)=\\frac{n}{2}$. Buhrman et al. (STOC' 98) proved that the exact {\\em quantum communication complexity} of this problem is ${\\bf O}(\\log {n})$ while the {\\em deterministic communication complexity} is ${\\bf \\Omega}(n)$. This was the first impressive (exponential) gap between quantum and classical communication complexity.\n  In this paper, we generalize the above distributed Deutsch-Jozsa promise problem to d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7254","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":""},"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":"1402.7254","created_at":"2026-05-18T02:21:51.915473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7254v3","created_at":"2026-05-18T02:21:51.915473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7254","created_at":"2026-05-18T02:21:51.915473+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5DRGMPRXUI7","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5DRGMPRXUI7LLDR","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5DRGMPR","created_at":"2026-05-18T12:28:41.024544+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/O5DRGMPRXUI7LLDRLLSCOHK5WO","json":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO.json","graph_json":"https://pith.science/api/pith-number/O5DRGMPRXUI7LLDRLLSCOHK5WO/graph.json","events_json":"https://pith.science/api/pith-number/O5DRGMPRXUI7LLDRLLSCOHK5WO/events.json","paper":"https://pith.science/paper/O5DRGMPR"},"agent_actions":{"view_html":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO","download_json":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO.json","view_paper":"https://pith.science/paper/O5DRGMPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7254&json=true","fetch_graph":"https://pith.science/api/pith-number/O5DRGMPRXUI7LLDRLLSCOHK5WO/graph.json","fetch_events":"https://pith.science/api/pith-number/O5DRGMPRXUI7LLDRLLSCOHK5WO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO/action/storage_attestation","attest_author":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO/action/author_attestation","sign_citation":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO/action/citation_signature","submit_replication":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO/action/replication_record"}},"created_at":"2026-05-18T02:21:51.915473+00:00","updated_at":"2026-05-18T02:21:51.915473+00:00"}