{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7BLKEBTBENJ43VADMOHN7WYSMM","short_pith_number":"pith:7BLKEBTB","schema_version":"1.0","canonical_sha256":"f856a206612353cdd403638edfdb12630145ebce67ad2ce8cec61d7537755cc3","source":{"kind":"arxiv","id":"1112.5855","version":2},"attestation_state":"computed","paper":{"title":"Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fr\\'ed\\'eric Magniez, Robin Kothari, Stacey Jeffery","submitted_at":"2011-12-26T13:29:23Z","abstract_excerpt":"The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n, as well as the number of 1s in the output, \\ell. We prove an upper bound of O (n\\sqrt{\\ell}) for all values of \\ell. This is an improvement over previous algorithms for all values of \\ell. On the other hand, we show that for any \\eps < 1 and any \\ell <= \\eps n^2, there is an \\Omega(n\\sqrt{\\ell}) lower bound for this problem, showing that our algorithm is essentially tight.\n  We first reduce Boolean matrix multiplication to several instances of graph collision. We then pr"},"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":"1112.5855","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-26T13:29:23Z","cross_cats_sorted":[],"title_canon_sha256":"dd62f30f1d14255b8d582c7cf99263d8a2ecede049db0c27ff17faf7acc97a31","abstract_canon_sha256":"c33321bbd0d30c7062af07851c508498c006aacdd94bb3e93af5a68ca5017043"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:12.403427Z","signature_b64":"x0bKsTs01fNfPvZH1f0tAB4Ky5PaSc4EYmp0Vcm/aES9UP6ojXkImiu8QAi3EIXnRjyLsoPjL2bzHVMbrgErBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f856a206612353cdd403638edfdb12630145ebce67ad2ce8cec61d7537755cc3","last_reissued_at":"2026-05-18T02:31:12.402748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:12.402748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fr\\'ed\\'eric Magniez, Robin Kothari, Stacey Jeffery","submitted_at":"2011-12-26T13:29:23Z","abstract_excerpt":"The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n, as well as the number of 1s in the output, \\ell. We prove an upper bound of O (n\\sqrt{\\ell}) for all values of \\ell. This is an improvement over previous algorithms for all values of \\ell. On the other hand, we show that for any \\eps < 1 and any \\ell <= \\eps n^2, there is an \\Omega(n\\sqrt{\\ell}) lower bound for this problem, showing that our algorithm is essentially tight.\n  We first reduce Boolean matrix multiplication to several instances of graph collision. We then pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5855","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.5855","created_at":"2026-05-18T02:31:12.402864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5855v2","created_at":"2026-05-18T02:31:12.402864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5855","created_at":"2026-05-18T02:31:12.402864+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BLKEBTBENJ4","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BLKEBTBENJ43VAD","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BLKEBTB","created_at":"2026-05-18T12:26:22.705136+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/7BLKEBTBENJ43VADMOHN7WYSMM","json":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM.json","graph_json":"https://pith.science/api/pith-number/7BLKEBTBENJ43VADMOHN7WYSMM/graph.json","events_json":"https://pith.science/api/pith-number/7BLKEBTBENJ43VADMOHN7WYSMM/events.json","paper":"https://pith.science/paper/7BLKEBTB"},"agent_actions":{"view_html":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM","download_json":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM.json","view_paper":"https://pith.science/paper/7BLKEBTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5855&json=true","fetch_graph":"https://pith.science/api/pith-number/7BLKEBTBENJ43VADMOHN7WYSMM/graph.json","fetch_events":"https://pith.science/api/pith-number/7BLKEBTBENJ43VADMOHN7WYSMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM/action/storage_attestation","attest_author":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM/action/author_attestation","sign_citation":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM/action/citation_signature","submit_replication":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM/action/replication_record"}},"created_at":"2026-05-18T02:31:12.402864+00:00","updated_at":"2026-05-18T02:31:12.402864+00:00"}