{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:O5DRGMPRXUI7LLDRLLSCOHK5WO","short_pith_number":"pith:O5DRGMPR","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"},"canonical_sha256":"77471331f1bd11f5ac715ae4271d5db3ae652fa6e86d906f3c9141af151b3dac","source":{"kind":"arxiv","id":"1402.7254","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7254","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7254v3","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7254","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"O5DRGMPRXUI7","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O5DRGMPRXUI7LLDR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O5DRGMPR","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:O5DRGMPRXUI7LLDRLLSCOHK5WO","target":"record","payload":{"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"},"canonical_sha256":"77471331f1bd11f5ac715ae4271d5db3ae652fa6e86d906f3c9141af151b3dac","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"},"source_kind":"arxiv","source_id":"1402.7254","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHSlVxjNcBGr9HXvAEStpx0jl8FrI1+o/KMWMQt+WniBi3jTK5AUExkPjvfxMm0JIOsWAwjZxUcv2mea3bOdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:21:24.938600Z"},"content_sha256":"31a441a4b39e9f7b6bce3bde9d284267efc96c32b7d23bc4c4ae35a76c0e51b6","schema_version":"1.0","event_id":"sha256:31a441a4b39e9f7b6bce3bde9d284267efc96c32b7d23bc4c4ae35a76c0e51b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:O5DRGMPRXUI7LLDRLLSCOHK5WO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BfwhJ+lwEq1Uf3ZK6rJUuvWnN81U5+VPx616oD7l17xN0v90t1ytkz7eiQbOFIJz56pe4J4EyZfjZ8OI8nL+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:21:24.939253Z"},"content_sha256":"439ff82132b81d879bf71af24d236acf9b74ad2ae68cb0682949222dbab7d20c","schema_version":"1.0","event_id":"sha256:439ff82132b81d879bf71af24d236acf9b74ad2ae68cb0682949222dbab7d20c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO/bundle.json","state_url":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T09:21:24Z","links":{"resolver":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO","bundle":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO/bundle.json","state":"https://pith.science/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5DRGMPRXUI7LLDRLLSCOHK5WO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:O5DRGMPRXUI7LLDRLLSCOHK5WO","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":"edac8eb170010b374593c3e62ce1613d0856b68cbf311111b423e58346db30c4","cross_cats_sorted":["cs.CC","cs.DC","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-28T14:21:06Z","title_canon_sha256":"65c86eea68606975648caf2fa64317504a46f8e82a8fa5a3e3669c1464537a67"},"schema_version":"1.0","source":{"id":"1402.7254","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7254","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7254v3","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7254","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"O5DRGMPRXUI7","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O5DRGMPRXUI7LLDR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O5DRGMPR","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:439ff82132b81d879bf71af24d236acf9b74ad2ae68cb0682949222dbab7d20c","target":"graph","created_at":"2026-05-18T02:21:51Z","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":"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","authors_text":"Daowen Qiu, Jozef Gruska, Shenggen Zheng","cross_cats":["cs.CC","cs.DC","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-28T14:21:06Z","title":"Generalizations of the distributed Deutsch-Jozsa promise problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7254","kind":"arxiv","version":3},"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:31a441a4b39e9f7b6bce3bde9d284267efc96c32b7d23bc4c4ae35a76c0e51b6","target":"record","created_at":"2026-05-18T02:21:51Z","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":"edac8eb170010b374593c3e62ce1613d0856b68cbf311111b423e58346db30c4","cross_cats_sorted":["cs.CC","cs.DC","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-28T14:21:06Z","title_canon_sha256":"65c86eea68606975648caf2fa64317504a46f8e82a8fa5a3e3669c1464537a67"},"schema_version":"1.0","source":{"id":"1402.7254","kind":"arxiv","version":3}},"canonical_sha256":"77471331f1bd11f5ac715ae4271d5db3ae652fa6e86d906f3c9141af151b3dac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77471331f1bd11f5ac715ae4271d5db3ae652fa6e86d906f3c9141af151b3dac","first_computed_at":"2026-05-18T02:21:51.915363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:51.915363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V18EKHr6l6jNTH/jijZ+KLyRLqjbgXfVaYgLelZ7UXQTRPoYiRXCbhyaewmm/8HBUJsd5A+4RrkKzTfsT8E2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:51.916019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.7254","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31a441a4b39e9f7b6bce3bde9d284267efc96c32b7d23bc4c4ae35a76c0e51b6","sha256:439ff82132b81d879bf71af24d236acf9b74ad2ae68cb0682949222dbab7d20c"],"state_sha256":"c5426df12efb443313f2834f43bafdee3179f42e04988e27a66e0291e673305b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgXYiAfqzhvKlAT9LAU6f/phz2TNztIcwOkqYTWRMQTkRL2BTciS+/iJxyNWgjtVq7zKDFX33PiU4MW82eb4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:21:24.942876Z","bundle_sha256":"e7eb8f6019192cf9e8c5deaa566c5c6071f04860a3ac2356cd2163c71162189d"}}