{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:GGMIGC6T7XZ4XKNTP2ZT36Q5XR","short_pith_number":"pith:GGMIGC6T","schema_version":"1.0","canonical_sha256":"3198830bd3fdf3cba9b37eb33dfa1dbc66298877d6fef6e811207b09881ca184","source":{"kind":"arxiv","id":"0906.4291","version":1},"attestation_state":"computed","paper":{"title":"The Pattern Matrix Method (Journal Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Alexander A. Sherstov","submitted_at":"2009-06-23T15:51:36Z","abstract_excerpt":"We develop a novel and powerful technique for communication lower bounds, the pattern matrix method. Specifically, fix an arbitrary function f:{0,1}^n->{0,1} and let A_f be the matrix whose columns are each an application of f to some subset of the variables x_1,x_2,...,x_{4n}. We prove that A_f has bounded-error communication complexity Omega(d), where d is the approximate degree of f. This result remains valid in the quantum model, regardless of prior entanglement. In particular, it gives a new and simple proof of Razborov's breakthrough quantum lower bounds for disjointness and other symmet"},"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":"0906.4291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-06-23T15:51:36Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"be512786561cda2e51df524c1dd8d5b752f2bfd711e2744f26716f4fc221bcc4","abstract_canon_sha256":"cdb1d5cc55f3afc308019c60fdc700c70989b0da22dd25a6ce0674a161b42f30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:44:59.545161Z","signature_b64":"uTAqTtPDawktXk44Dh2PQI3HDd4JbG3mY2MqzUy5XftfxTbgD1K3RtrEU8MUR90C0L1pm7Uwa8y/mdSRIVQhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3198830bd3fdf3cba9b37eb33dfa1dbc66298877d6fef6e811207b09881ca184","last_reissued_at":"2026-07-04T15:44:59.544775Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:44:59.544775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Pattern Matrix Method (Journal Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Alexander A. Sherstov","submitted_at":"2009-06-23T15:51:36Z","abstract_excerpt":"We develop a novel and powerful technique for communication lower bounds, the pattern matrix method. Specifically, fix an arbitrary function f:{0,1}^n->{0,1} and let A_f be the matrix whose columns are each an application of f to some subset of the variables x_1,x_2,...,x_{4n}. We prove that A_f has bounded-error communication complexity Omega(d), where d is the approximate degree of f. This result remains valid in the quantum model, regardless of prior entanglement. In particular, it gives a new and simple proof of Razborov's breakthrough quantum lower bounds for disjointness and other symmet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.4291","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/0906.4291/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":"0906.4291","created_at":"2026-07-04T15:44:59.544835+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.4291v1","created_at":"2026-07-04T15:44:59.544835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.4291","created_at":"2026-07-04T15:44:59.544835+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGMIGC6T7XZ4","created_at":"2026-07-04T15:44:59.544835+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGMIGC6T7XZ4XKNT","created_at":"2026-07-04T15:44:59.544835+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGMIGC6T","created_at":"2026-07-04T15:44:59.544835+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.03249","citing_title":"Quantum-Classical Equivalence for AND-Functions","ref_index":118,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GGMIGC6T7XZ4XKNTP2ZT36Q5XR","json":"https://pith.science/pith/GGMIGC6T7XZ4XKNTP2ZT36Q5XR.json","graph_json":"https://pith.science/api/pith-number/GGMIGC6T7XZ4XKNTP2ZT36Q5XR/graph.json","events_json":"https://pith.science/api/pith-number/GGMIGC6T7XZ4XKNTP2ZT36Q5XR/events.json","paper":"https://pith.science/paper/GGMIGC6T"},"agent_actions":{"view_html":"https://pith.science/pith/GGMIGC6T7XZ4XKNTP2ZT36Q5XR","download_json":"https://pith.science/pith/GGMIGC6T7XZ4XKNTP2ZT36Q5XR.json","view_paper":"https://pith.science/paper/GGMIGC6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.4291&json=true","fetch_graph":"https://pith.science/api/pith-number/GGMIGC6T7XZ4XKNTP2ZT36Q5XR/graph.json","fetch_events":"https://pith.science/api/pith-number/GGMIGC6T7XZ4XKNTP2ZT36Q5XR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGMIGC6T7XZ4XKNTP2ZT36Q5XR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGMIGC6T7XZ4XKNTP2ZT36Q5XR/action/storage_attestation","attest_author":"https://pith.science/pith/GGMIGC6T7XZ4XKNTP2ZT36Q5XR/action/author_attestation","sign_citation":"https://pith.science/pith/GGMIGC6T7XZ4XKNTP2ZT36Q5XR/action/citation_signature","submit_replication":"https://pith.science/pith/GGMIGC6T7XZ4XKNTP2ZT36Q5XR/action/replication_record"}},"created_at":"2026-07-04T15:44:59.544835+00:00","updated_at":"2026-07-04T15:44:59.544835+00:00"}