{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4LZGXEK76VOAZPT6W6LMK5OFSC","short_pith_number":"pith:4LZGXEK7","schema_version":"1.0","canonical_sha256":"e2f26b915ff55c0cbe7eb796c575c5908fabfe007af6c7bdde6840ee2ae417d6","source":{"kind":"arxiv","id":"2606.03249","version":1},"attestation_state":"computed","paper":{"title":"Quantum-Classical Equivalence for AND-Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Arkadev Chattopadhyay, Farzan Byramji, Shachar Lovett, Sreejata Kishor Bhattacharya, Yogesh Dahiya","submitted_at":"2026-06-02T07:10:16Z","abstract_excerpt":"A major open problem in quantum communication complexity is whether quantum protocols can be exponentially more efficient than classical protocols for computing total Boolean functions; the prevailing conjecture is that they cannot be so. In a seminal work, Razborov (2002) resolved this question for AND-functions of the form $$ F(x,y) = f(x_1 \\land y_1, \\ldots, x_n \\land y_n), $$ when the outer function $f$ is symmetric, by proving that their bounded-error quantum and classical communication complexities are polynomially related. Since then, extending this result to all AND-functions has remai"},"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":"2606.03249","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-02T07:10:16Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"ef18e0b82a4c0bcddce99ca8c85302f9d0615a51974b9180185416bc9383cce3","abstract_canon_sha256":"431785f98841e2d6473bdfbeea4c0a8f4430261c35cf5375feb21d335b0a22ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:36.240454Z","signature_b64":"a3xrBDsY0jzbNLYK5p7jyeqgcHAmIoTnkxMjjKqtfl8dHmzwA8YloWsHO8rt5GaJS6cQPRK40IQW7CRgXxu0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2f26b915ff55c0cbe7eb796c575c5908fabfe007af6c7bdde6840ee2ae417d6","last_reissued_at":"2026-06-03T01:05:36.240039Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:36.240039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-Classical Equivalence for AND-Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Arkadev Chattopadhyay, Farzan Byramji, Shachar Lovett, Sreejata Kishor Bhattacharya, Yogesh Dahiya","submitted_at":"2026-06-02T07:10:16Z","abstract_excerpt":"A major open problem in quantum communication complexity is whether quantum protocols can be exponentially more efficient than classical protocols for computing total Boolean functions; the prevailing conjecture is that they cannot be so. In a seminal work, Razborov (2002) resolved this question for AND-functions of the form $$ F(x,y) = f(x_1 \\land y_1, \\ldots, x_n \\land y_n), $$ when the outer function $f$ is symmetric, by proving that their bounded-error quantum and classical communication complexities are polynomially related. Since then, extending this result to all AND-functions has remai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03249","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/2606.03249/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":"2606.03249","created_at":"2026-06-03T01:05:36.240093+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.03249v1","created_at":"2026-06-03T01:05:36.240093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03249","created_at":"2026-06-03T01:05:36.240093+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LZGXEK76VOA","created_at":"2026-06-03T01:05:36.240093+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LZGXEK76VOAZPT6","created_at":"2026-06-03T01:05:36.240093+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LZGXEK7","created_at":"2026-06-03T01:05:36.240093+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/4LZGXEK76VOAZPT6W6LMK5OFSC","json":"https://pith.science/pith/4LZGXEK76VOAZPT6W6LMK5OFSC.json","graph_json":"https://pith.science/api/pith-number/4LZGXEK76VOAZPT6W6LMK5OFSC/graph.json","events_json":"https://pith.science/api/pith-number/4LZGXEK76VOAZPT6W6LMK5OFSC/events.json","paper":"https://pith.science/paper/4LZGXEK7"},"agent_actions":{"view_html":"https://pith.science/pith/4LZGXEK76VOAZPT6W6LMK5OFSC","download_json":"https://pith.science/pith/4LZGXEK76VOAZPT6W6LMK5OFSC.json","view_paper":"https://pith.science/paper/4LZGXEK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.03249&json=true","fetch_graph":"https://pith.science/api/pith-number/4LZGXEK76VOAZPT6W6LMK5OFSC/graph.json","fetch_events":"https://pith.science/api/pith-number/4LZGXEK76VOAZPT6W6LMK5OFSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LZGXEK76VOAZPT6W6LMK5OFSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LZGXEK76VOAZPT6W6LMK5OFSC/action/storage_attestation","attest_author":"https://pith.science/pith/4LZGXEK76VOAZPT6W6LMK5OFSC/action/author_attestation","sign_citation":"https://pith.science/pith/4LZGXEK76VOAZPT6W6LMK5OFSC/action/citation_signature","submit_replication":"https://pith.science/pith/4LZGXEK76VOAZPT6W6LMK5OFSC/action/replication_record"}},"created_at":"2026-06-03T01:05:36.240093+00:00","updated_at":"2026-06-03T01:05:36.240093+00:00"}