{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G6DYFRHCJNEEYW3V77ODQ73RXO","short_pith_number":"pith:G6DYFRHC","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"},"canonical_sha256":"378782c4e24b484c5b75ffdc387f71bb843a00cdbc096615906b767ab455f6e5","source":{"kind":"arxiv","id":"1611.05754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05754","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05754v1","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05754","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"G6DYFRHCJNEE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G6DYFRHCJNEEYW3V","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G6DYFRHC","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G6DYFRHCJNEEYW3V77ODQ73RXO","target":"record","payload":{"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"},"canonical_sha256":"378782c4e24b484c5b75ffdc387f71bb843a00cdbc096615906b767ab455f6e5","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"},"source_kind":"arxiv","source_id":"1611.05754","source_version":1,"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-18T00:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOpFoPWUV20YYv13vvHp+nYFu4fVzyfNxPznZK5kCbgI8/DLa3fEQkgEWJrkKGp/Fk3W0IK0A8wQm5GVR7btDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:15:18.202429Z"},"content_sha256":"ea0f18c03893d82914c6b35cc8e88481b281e4bdaa4ea9ee7e2ce4a2dd201db8","schema_version":"1.0","event_id":"sha256:ea0f18c03893d82914c6b35cc8e88481b281e4bdaa4ea9ee7e2ce4a2dd201db8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G6DYFRHCJNEEYW3V77ODQ73RXO","target":"graph","payload":{"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"},"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-18T00:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRvXQaorJ8aotkPqcVcCsJrQu/G8u3uYLetg0X/4A2HerVnHt3nfo0Gr/k3EiV3txIMUOEA9Z7LCf9Xqvr9nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:15:18.202814Z"},"content_sha256":"4497185fd776ee516d373752874e242a0d0ecf9db5def99c4de943f2ae0e92e8","schema_version":"1.0","event_id":"sha256:4497185fd776ee516d373752874e242a0d0ecf9db5def99c4de943f2ae0e92e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO/bundle.json","state_url":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6DYFRHCJNEEYW3V77ODQ73RXO/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-27T02:15:18Z","links":{"resolver":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO","bundle":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO/bundle.json","state":"https://pith.science/pith/G6DYFRHCJNEEYW3V77ODQ73RXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6DYFRHCJNEEYW3V77ODQ73RXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G6DYFRHCJNEEYW3V77ODQ73RXO","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":"9d4a3f86c440d8f921785484cba6c32eb36512e7f460f4d0c16feee2d6c08828","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-11-17T16:05:02Z","title_canon_sha256":"f5f8a7517f7a19d56ec2ecaf15fc601c5278d05347fff63274a384656a3b155c"},"schema_version":"1.0","source":{"id":"1611.05754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05754","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05754v1","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05754","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"G6DYFRHCJNEE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G6DYFRHCJNEEYW3V","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G6DYFRHC","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:4497185fd776ee516d373752874e242a0d0ecf9db5def99c4de943f2ae0e92e8","target":"graph","created_at":"2026-05-18T00:34:35Z","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":"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","authors_text":"Ankit Garg, Anurag Anshu, Rahul Jain, Robin Kothari, Shalev Ben-David, Troy Lee","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-11-17T16:05:02Z","title":"Separating quantum communication and approximate rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05754","kind":"arxiv","version":1},"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:ea0f18c03893d82914c6b35cc8e88481b281e4bdaa4ea9ee7e2ce4a2dd201db8","target":"record","created_at":"2026-05-18T00:34:35Z","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":"9d4a3f86c440d8f921785484cba6c32eb36512e7f460f4d0c16feee2d6c08828","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-11-17T16:05:02Z","title_canon_sha256":"f5f8a7517f7a19d56ec2ecaf15fc601c5278d05347fff63274a384656a3b155c"},"schema_version":"1.0","source":{"id":"1611.05754","kind":"arxiv","version":1}},"canonical_sha256":"378782c4e24b484c5b75ffdc387f71bb843a00cdbc096615906b767ab455f6e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"378782c4e24b484c5b75ffdc387f71bb843a00cdbc096615906b767ab455f6e5","first_computed_at":"2026-05-18T00:34:35.238025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:35.238025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PIZL6s9VecWFMlfJel47QdBiOBt32esObrPo3prGUsNkABVi1lbE4nkdpCpBKq9GSIBhxWP/1k8z858iV/lzDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:35.238459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea0f18c03893d82914c6b35cc8e88481b281e4bdaa4ea9ee7e2ce4a2dd201db8","sha256:4497185fd776ee516d373752874e242a0d0ecf9db5def99c4de943f2ae0e92e8"],"state_sha256":"7bee1b8ba08ca9c0132a58c68be3eec2bafee17fc69edcf5f3a0340362ca365d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJWi2X2JomQ6GGCquXnOx/5In6iKxmbqELRIvWJoLF7+Fv6hA1W4TmHc4SNiFCc9PF0+PU9FQ2/O1VAMIAQKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:15:18.205214Z","bundle_sha256":"f0654bab9732118ee47d477ec0f0a31d7301e96afcb52f26ad57e69dd74bdc44"}}