{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G6DYFRHCJNEEYW3V77ODQ73RXO","short_pith_number":"pith:G6DYFRHC","schema_version":"1.0","canonical_sha256":"378782c4e24b484c5b75ffdc387f71bb843a00cdbc096615906b767ab455f6e5","source":{"kind":"arxiv","id":"1611.05754","version":1},"attestation_state":"computed","paper":{"title":"Separating quantum communication and approximate rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Ankit Garg, Anurag Anshu, Rahul Jain, Robin Kothari, Shalev Ben-David, Troy Lee","submitted_at":"2016-11-17T16:05:02Z","abstract_excerpt":"One of the best lower bound methods for the quantum communication complexity of a function H (with or without shared entanglement) is the logarithm of the approximate rank of the communication matrix of H. This measure is essentially equivalent to the approximate gamma_2 norm and generalized discrepancy, and subsumes several other lower bounds. All known lower bounds on quantum communication complexity in the general unbounded-round model can be shown via the logarithm of approximate rank, and it was an open problem to give any separation at all between quantum communication complexity and the"},"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":"1611.05754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-11-17T16:05:02Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f5f8a7517f7a19d56ec2ecaf15fc601c5278d05347fff63274a384656a3b155c","abstract_canon_sha256":"9d4a3f86c440d8f921785484cba6c32eb36512e7f460f4d0c16feee2d6c08828"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:35.238459Z","signature_b64":"PIZL6s9VecWFMlfJel47QdBiOBt32esObrPo3prGUsNkABVi1lbE4nkdpCpBKq9GSIBhxWP/1k8z858iV/lzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"378782c4e24b484c5b75ffdc387f71bb843a00cdbc096615906b767ab455f6e5","last_reissued_at":"2026-05-18T00:34:35.238025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:35.238025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separating quantum communication and approximate rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Ankit Garg, Anurag Anshu, Rahul Jain, Robin Kothari, Shalev Ben-David, Troy Lee","submitted_at":"2016-11-17T16:05:02Z","abstract_excerpt":"One of the best lower bound methods for the quantum communication complexity of a function H (with or without shared entanglement) is the logarithm of the approximate rank of the communication matrix of H. This measure is essentially equivalent to the approximate gamma_2 norm and generalized discrepancy, and subsumes several other lower bounds. All known lower bounds on quantum communication complexity in the general unbounded-round model can be shown via the logarithm of approximate rank, and it was an open problem to give any separation at all between quantum communication complexity and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05754","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":"1611.05754","created_at":"2026-05-18T00:34:35.238088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05754v1","created_at":"2026-05-18T00:34:35.238088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05754","created_at":"2026-05-18T00:34:35.238088+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6DYFRHCJNEE","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6DYFRHCJNEEYW3V","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6DYFRHC","created_at":"2026-05-18T12:30:15.759754+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/G6DYFRHCJNEEYW3V77ODQ73RXO","json":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO.json","graph_json":"https://pith.science/api/pith-number/G6DYFRHCJNEEYW3V77ODQ73RXO/graph.json","events_json":"https://pith.science/api/pith-number/G6DYFRHCJNEEYW3V77ODQ73RXO/events.json","paper":"https://pith.science/paper/G6DYFRHC"},"agent_actions":{"view_html":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO","download_json":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO.json","view_paper":"https://pith.science/paper/G6DYFRHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05754&json=true","fetch_graph":"https://pith.science/api/pith-number/G6DYFRHCJNEEYW3V77ODQ73RXO/graph.json","fetch_events":"https://pith.science/api/pith-number/G6DYFRHCJNEEYW3V77ODQ73RXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO/action/storage_attestation","attest_author":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO/action/author_attestation","sign_citation":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO/action/citation_signature","submit_replication":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO/action/replication_record"}},"created_at":"2026-05-18T00:34:35.238088+00:00","updated_at":"2026-05-18T00:34:35.238088+00:00"}