{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RDQSXAJGA7BBPJS6O7BC2ICZX5","short_pith_number":"pith:RDQSXAJG","schema_version":"1.0","canonical_sha256":"88e12b812607c217a65e77c22d2059bf7881e6a2dd7fc6a37ae64cdb5cc20294","source":{"kind":"arxiv","id":"2012.03415","version":1},"attestation_state":"computed","paper":{"title":"On Query-to-Communication Lifting for Adversary Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Anurag Anshu, Shalev Ben-David, Srijita Kundu","submitted_at":"2020-12-07T02:10:37Z","abstract_excerpt":"We investigate query-to-communication lifting theorems for models related to the quantum adversary bounds. Our results are as follows:\n  1. We show that the classical adversary bound lifts to a lower bound on randomized communication complexity with a constant-sized gadget. We also show that the classical adversary bound is a strictly stronger lower bound technique than the previously-lifted measure known as critical block sensitivity, making our lifting theorem one of the strongest lifting theorems for randomized communication complexity using a constant-sized gadget.\n  2. Turning to quantum "},"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":"2012.03415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-12-07T02:10:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"981b17b7656d5826793cc3818b4154396b5d54d78027ad600e92a00494e643d6","abstract_canon_sha256":"fe5fe5d2d0238e2f86dcfa35c54435de015b0f3002e73319402f39d2831658a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:57:29.342896Z","signature_b64":"rECFqqTe8HU1rP/kIH6coj/X+CDd88TDwU1/n7w1owBn3a0CqyAA2LeJwvS6YcRwKiooDQnbt2AWA0ILiqDwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e12b812607c217a65e77c22d2059bf7881e6a2dd7fc6a37ae64cdb5cc20294","last_reissued_at":"2026-07-05T01:57:29.342420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:57:29.342420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Query-to-Communication Lifting for Adversary Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Anurag Anshu, Shalev Ben-David, Srijita Kundu","submitted_at":"2020-12-07T02:10:37Z","abstract_excerpt":"We investigate query-to-communication lifting theorems for models related to the quantum adversary bounds. Our results are as follows:\n  1. We show that the classical adversary bound lifts to a lower bound on randomized communication complexity with a constant-sized gadget. We also show that the classical adversary bound is a strictly stronger lower bound technique than the previously-lifted measure known as critical block sensitivity, making our lifting theorem one of the strongest lifting theorems for randomized communication complexity using a constant-sized gadget.\n  2. Turning to quantum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.03415","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/2012.03415/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":"2012.03415","created_at":"2026-07-05T01:57:29.342477+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.03415v1","created_at":"2026-07-05T01:57:29.342477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.03415","created_at":"2026-07-05T01:57:29.342477+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDQSXAJGA7BB","created_at":"2026-07-05T01:57:29.342477+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDQSXAJGA7BBPJS6","created_at":"2026-07-05T01:57:29.342477+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDQSXAJG","created_at":"2026-07-05T01:57:29.342477+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07639","citing_title":"Exponential quantum advantage in processing massive classical data","ref_index":91,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RDQSXAJGA7BBPJS6O7BC2ICZX5","json":"https://pith.science/pith/RDQSXAJGA7BBPJS6O7BC2ICZX5.json","graph_json":"https://pith.science/api/pith-number/RDQSXAJGA7BBPJS6O7BC2ICZX5/graph.json","events_json":"https://pith.science/api/pith-number/RDQSXAJGA7BBPJS6O7BC2ICZX5/events.json","paper":"https://pith.science/paper/RDQSXAJG"},"agent_actions":{"view_html":"https://pith.science/pith/RDQSXAJGA7BBPJS6O7BC2ICZX5","download_json":"https://pith.science/pith/RDQSXAJGA7BBPJS6O7BC2ICZX5.json","view_paper":"https://pith.science/paper/RDQSXAJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.03415&json=true","fetch_graph":"https://pith.science/api/pith-number/RDQSXAJGA7BBPJS6O7BC2ICZX5/graph.json","fetch_events":"https://pith.science/api/pith-number/RDQSXAJGA7BBPJS6O7BC2ICZX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDQSXAJGA7BBPJS6O7BC2ICZX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDQSXAJGA7BBPJS6O7BC2ICZX5/action/storage_attestation","attest_author":"https://pith.science/pith/RDQSXAJGA7BBPJS6O7BC2ICZX5/action/author_attestation","sign_citation":"https://pith.science/pith/RDQSXAJGA7BBPJS6O7BC2ICZX5/action/citation_signature","submit_replication":"https://pith.science/pith/RDQSXAJGA7BBPJS6O7BC2ICZX5/action/replication_record"}},"created_at":"2026-07-05T01:57:29.342477+00:00","updated_at":"2026-07-05T01:57:29.342477+00:00"}