{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:QHAKUTBIM6XIFJ6I3MG4QTZBVQ","short_pith_number":"pith:QHAKUTBI","schema_version":"1.0","canonical_sha256":"81c0aa4c2867ae82a7c8db0dc84f21ac3d9933be1c5c47ab9ed72cf815b83d8e","source":{"kind":"arxiv","id":"quant-ph/0101005","version":1},"attestation_state":"computed","paper":{"title":"Quantum Communication Complexity (A Survey)","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gilles Brassard","submitted_at":"2001-01-01T07:12:35Z","abstract_excerpt":"Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits --- unless the two parties are entangled, in which case twice as many classical bits can be communicated but no more. In apparent contradiction, there are distributed computational tasks for which quantum communication cannot be simulated efficiently by classical means. In extreme cases, the effect of transmitting quantum bits cannot be achieved classically short of transmitting an"},"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":"quant-ph/0101005","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-01-01T07:12:35Z","cross_cats_sorted":[],"title_canon_sha256":"f7ffcea6683d09f397564d61d4dcaf50acd1857e58b65c4aa7676da7463f8854","abstract_canon_sha256":"84ca08ffc91be67e70dbcc625bf51efac3e33de4c45f28fd724f8d4a7c35ea1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:34.567054Z","signature_b64":"eyJVlzndTdN2AO8vxpDAb5a6FFT3jKWYYGaEoAxEL6xwrUkZIpEP25CBIXlLQqiyi7M+LU/FJD/admKa6yKcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81c0aa4c2867ae82a7c8db0dc84f21ac3d9933be1c5c47ab9ed72cf815b83d8e","last_reissued_at":"2026-07-04T14:45:34.566722Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:34.566722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Communication Complexity (A Survey)","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gilles Brassard","submitted_at":"2001-01-01T07:12:35Z","abstract_excerpt":"Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits --- unless the two parties are entangled, in which case twice as many classical bits can be communicated but no more. In apparent contradiction, there are distributed computational tasks for which quantum communication cannot be simulated efficiently by classical means. In extreme cases, the effect of transmitting quantum bits cannot be achieved classically short of transmitting an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0101005","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0101005/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":"quant-ph/0101005","created_at":"2026-07-04T14:45:34.566775+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0101005v1","created_at":"2026-07-04T14:45:34.566775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0101005","created_at":"2026-07-04T14:45:34.566775+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHAKUTBIM6XI","created_at":"2026-07-04T14:45:34.566775+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHAKUTBIM6XIFJ6I","created_at":"2026-07-04T14:45:34.566775+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHAKUTBI","created_at":"2026-07-04T14:45:34.566775+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2403.02988","citing_title":"An Operational Framework for Nonclassicality in Quantum Communication Networks","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHAKUTBIM6XIFJ6I3MG4QTZBVQ","json":"https://pith.science/pith/QHAKUTBIM6XIFJ6I3MG4QTZBVQ.json","graph_json":"https://pith.science/api/pith-number/QHAKUTBIM6XIFJ6I3MG4QTZBVQ/graph.json","events_json":"https://pith.science/api/pith-number/QHAKUTBIM6XIFJ6I3MG4QTZBVQ/events.json","paper":"https://pith.science/paper/QHAKUTBI"},"agent_actions":{"view_html":"https://pith.science/pith/QHAKUTBIM6XIFJ6I3MG4QTZBVQ","download_json":"https://pith.science/pith/QHAKUTBIM6XIFJ6I3MG4QTZBVQ.json","view_paper":"https://pith.science/paper/QHAKUTBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0101005&json=true","fetch_graph":"https://pith.science/api/pith-number/QHAKUTBIM6XIFJ6I3MG4QTZBVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/QHAKUTBIM6XIFJ6I3MG4QTZBVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHAKUTBIM6XIFJ6I3MG4QTZBVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHAKUTBIM6XIFJ6I3MG4QTZBVQ/action/storage_attestation","attest_author":"https://pith.science/pith/QHAKUTBIM6XIFJ6I3MG4QTZBVQ/action/author_attestation","sign_citation":"https://pith.science/pith/QHAKUTBIM6XIFJ6I3MG4QTZBVQ/action/citation_signature","submit_replication":"https://pith.science/pith/QHAKUTBIM6XIFJ6I3MG4QTZBVQ/action/replication_record"}},"created_at":"2026-07-04T14:45:34.566775+00:00","updated_at":"2026-07-04T14:45:34.566775+00:00"}