{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MCZNTF63TFUU4RYJ4R2HTJTBPS","short_pith_number":"pith:MCZNTF63","canonical_record":{"source":{"id":"1605.01142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-04T04:42:08Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"56de1e0c3ae36e68bc7f93512ea5e26753deb11c96fb20b0ea85af1d6c747d45","abstract_canon_sha256":"29ffc92d1a8b88b98f65595669754c98a3c2de7b127911b6c9362acc17f41dc7"},"schema_version":"1.0"},"canonical_sha256":"60b2d997db99694e4709e47479a6617c96dfaf2b245b263af146317c6fccdd4e","source":{"kind":"arxiv","id":"1605.01142","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01142","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01142v2","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01142","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"MCZNTF63TFUU","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MCZNTF63TFUU4RYJ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MCZNTF63","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MCZNTF63TFUU4RYJ4R2HTJTBPS","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-04T04:42:08Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"56de1e0c3ae36e68bc7f93512ea5e26753deb11c96fb20b0ea85af1d6c747d45","abstract_canon_sha256":"29ffc92d1a8b88b98f65595669754c98a3c2de7b127911b6c9362acc17f41dc7"},"schema_version":"1.0"},"canonical_sha256":"60b2d997db99694e4709e47479a6617c96dfaf2b245b263af146317c6fccdd4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:35.412171Z","signature_b64":"HCLAh5LcVNMsWIyp4xNSF9g1ziig4BEaJmd/gBqCmPODVc2BQj00K8ogYhQwGXHo1/8jl8kAF8t8UXVdwrAOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60b2d997db99694e4709e47479a6617c96dfaf2b245b263af146317c6fccdd4e","last_reissued_at":"2026-05-18T00:34:35.411660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:35.411660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01142","source_version":2,"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":"0iTB5mFVE6O4mzP6Jj45oSpm4bR1QKEJQleUZ+OZwETABHrXV7UGV9AvfNW2Li37/4gmZM87of+oZTd2comyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:07.977549Z"},"content_sha256":"7fa9dc0367428fe3af1addd77ebc3315ac00eb64cb841391206635eb98c97a8c","schema_version":"1.0","event_id":"sha256:7fa9dc0367428fe3af1addd77ebc3315ac00eb64cb841391206635eb98c97a8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MCZNTF63TFUU4RYJ4R2HTJTBPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Separations in communication complexity using cheat sheets and information complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Anurag Anshu, Mika G\\\"o\\\"os, Miklos Santha, Rahul Jain, Robin Kothari, Shalev Ben-David, Troy Lee","submitted_at":"2016-05-04T04:42:08Z","abstract_excerpt":"While exponential separations are known between quantum and randomized communication complexity for partial functions (Raz, STOC 1999), the best known separation between these measures for a total function is quadratic, witnessed by the disjointness function. We give the first super-quadratic separation between quantum and randomized communication complexity for a total function, giving an example exhibiting a power 2.5 gap. We further present a 1.5 power separation between exact quantum and randomized communication complexity, improving on the previous ~1.15 separation by Ambainis (STOC 2013)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01142","kind":"arxiv","version":2},"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":"2NMb3dr/Umooc/Lyt4PGb5NWnMmb08S1PL+L7PkPmxibK2UMPyQlnONMd1GeWtXxtsz0MEG+iqjZavMphneTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:07.977968Z"},"content_sha256":"45caa9794d4956206e14fe0ea323d6bf640fcaebed913b264351d01b7e797282","schema_version":"1.0","event_id":"sha256:45caa9794d4956206e14fe0ea323d6bf640fcaebed913b264351d01b7e797282"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCZNTF63TFUU4RYJ4R2HTJTBPS/bundle.json","state_url":"https://pith.science/pith/MCZNTF63TFUU4RYJ4R2HTJTBPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCZNTF63TFUU4RYJ4R2HTJTBPS/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-27T23:20:07Z","links":{"resolver":"https://pith.science/pith/MCZNTF63TFUU4RYJ4R2HTJTBPS","bundle":"https://pith.science/pith/MCZNTF63TFUU4RYJ4R2HTJTBPS/bundle.json","state":"https://pith.science/pith/MCZNTF63TFUU4RYJ4R2HTJTBPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCZNTF63TFUU4RYJ4R2HTJTBPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MCZNTF63TFUU4RYJ4R2HTJTBPS","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":"29ffc92d1a8b88b98f65595669754c98a3c2de7b127911b6c9362acc17f41dc7","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-04T04:42:08Z","title_canon_sha256":"56de1e0c3ae36e68bc7f93512ea5e26753deb11c96fb20b0ea85af1d6c747d45"},"schema_version":"1.0","source":{"id":"1605.01142","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01142","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01142v2","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01142","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"MCZNTF63TFUU","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MCZNTF63TFUU4RYJ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MCZNTF63","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:45caa9794d4956206e14fe0ea323d6bf640fcaebed913b264351d01b7e797282","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":"While exponential separations are known between quantum and randomized communication complexity for partial functions (Raz, STOC 1999), the best known separation between these measures for a total function is quadratic, witnessed by the disjointness function. We give the first super-quadratic separation between quantum and randomized communication complexity for a total function, giving an example exhibiting a power 2.5 gap. We further present a 1.5 power separation between exact quantum and randomized communication complexity, improving on the previous ~1.15 separation by Ambainis (STOC 2013)","authors_text":"Aleksandrs Belovs, Anurag Anshu, Mika G\\\"o\\\"os, Miklos Santha, 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-05-04T04:42:08Z","title":"Separations in communication complexity using cheat sheets and information complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01142","kind":"arxiv","version":2},"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:7fa9dc0367428fe3af1addd77ebc3315ac00eb64cb841391206635eb98c97a8c","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":"29ffc92d1a8b88b98f65595669754c98a3c2de7b127911b6c9362acc17f41dc7","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-04T04:42:08Z","title_canon_sha256":"56de1e0c3ae36e68bc7f93512ea5e26753deb11c96fb20b0ea85af1d6c747d45"},"schema_version":"1.0","source":{"id":"1605.01142","kind":"arxiv","version":2}},"canonical_sha256":"60b2d997db99694e4709e47479a6617c96dfaf2b245b263af146317c6fccdd4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60b2d997db99694e4709e47479a6617c96dfaf2b245b263af146317c6fccdd4e","first_computed_at":"2026-05-18T00:34:35.411660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:35.411660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HCLAh5LcVNMsWIyp4xNSF9g1ziig4BEaJmd/gBqCmPODVc2BQj00K8ogYhQwGXHo1/8jl8kAF8t8UXVdwrAOAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:35.412171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01142","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fa9dc0367428fe3af1addd77ebc3315ac00eb64cb841391206635eb98c97a8c","sha256:45caa9794d4956206e14fe0ea323d6bf640fcaebed913b264351d01b7e797282"],"state_sha256":"e7df08f48cd487c36606f33d05774b236f1a9136f8bf9fb875243c2e68985428"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9RfzygROZTNn9yV6OdpdVLWqe3iFvo3vTMwucxqMu8KA4Vw/aBQAlSCGZPuI8N0av8bKJf2oE2L+OBDsUuCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:20:07.981139Z","bundle_sha256":"d287b68f31c1e9fd08eda3124875e96af6e8d35353dfaec41f4e3d45c2c56544"}}