{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7BLKEBTBENJ43VADMOHN7WYSMM","short_pith_number":"pith:7BLKEBTB","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"},"canonical_sha256":"f856a206612353cdd403638edfdb12630145ebce67ad2ce8cec61d7537755cc3","source":{"kind":"arxiv","id":"1112.5855","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5855","created_at":"2026-05-18T02:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5855v2","created_at":"2026-05-18T02:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5855","created_at":"2026-05-18T02:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"7BLKEBTBENJ4","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7BLKEBTBENJ43VAD","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7BLKEBTB","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7BLKEBTBENJ43VADMOHN7WYSMM","target":"record","payload":{"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"},"canonical_sha256":"f856a206612353cdd403638edfdb12630145ebce67ad2ce8cec61d7537755cc3","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"},"source_kind":"arxiv","source_id":"1112.5855","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-18T02:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fjTymRd0edoGu/mDRTdFQINMXOwIFeh33NTL3st3tNExx9qmHcOSU0/dbY4vxOwUcz9WqLHjB0MA5HWGOor1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:01:12.809430Z"},"content_sha256":"cb065af785411123bc1d4e97d75435d7fd7acfa68b71ef87a2c2b0d476d05dc7","schema_version":"1.0","event_id":"sha256:cb065af785411123bc1d4e97d75435d7fd7acfa68b71ef87a2c2b0d476d05dc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7BLKEBTBENJ43VADMOHN7WYSMM","target":"graph","payload":{"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"},"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-18T02:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05DydJRLRutI51o/zAgWTsNCyjcXHEtW958ZMVyDKEvTaDNCkWJZ+DQuRwynH9xO5RI9CxwL0T6Jmwb31UO4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:01:12.810136Z"},"content_sha256":"f1a83841e2ecc8330d6a0ede638155f6386b11123b53602537bac1e650acf32b","schema_version":"1.0","event_id":"sha256:f1a83841e2ecc8330d6a0ede638155f6386b11123b53602537bac1e650acf32b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM/bundle.json","state_url":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BLKEBTBENJ43VADMOHN7WYSMM/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:01:12Z","links":{"resolver":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM","bundle":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM/bundle.json","state":"https://pith.science/pith/7BLKEBTBENJ43VADMOHN7WYSMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BLKEBTBENJ43VADMOHN7WYSMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7BLKEBTBENJ43VADMOHN7WYSMM","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":"c33321bbd0d30c7062af07851c508498c006aacdd94bb3e93af5a68ca5017043","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-26T13:29:23Z","title_canon_sha256":"dd62f30f1d14255b8d582c7cf99263d8a2ecede049db0c27ff17faf7acc97a31"},"schema_version":"1.0","source":{"id":"1112.5855","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5855","created_at":"2026-05-18T02:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5855v2","created_at":"2026-05-18T02:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5855","created_at":"2026-05-18T02:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"7BLKEBTBENJ4","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7BLKEBTBENJ43VAD","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7BLKEBTB","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:f1a83841e2ecc8330d6a0ede638155f6386b11123b53602537bac1e650acf32b","target":"graph","created_at":"2026-05-18T02:31:12Z","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":"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","authors_text":"Fr\\'ed\\'eric Magniez, Robin Kothari, Stacey Jeffery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-26T13:29:23Z","title":"Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5855","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:cb065af785411123bc1d4e97d75435d7fd7acfa68b71ef87a2c2b0d476d05dc7","target":"record","created_at":"2026-05-18T02:31:12Z","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":"c33321bbd0d30c7062af07851c508498c006aacdd94bb3e93af5a68ca5017043","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-26T13:29:23Z","title_canon_sha256":"dd62f30f1d14255b8d582c7cf99263d8a2ecede049db0c27ff17faf7acc97a31"},"schema_version":"1.0","source":{"id":"1112.5855","kind":"arxiv","version":2}},"canonical_sha256":"f856a206612353cdd403638edfdb12630145ebce67ad2ce8cec61d7537755cc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f856a206612353cdd403638edfdb12630145ebce67ad2ce8cec61d7537755cc3","first_computed_at":"2026-05-18T02:31:12.402748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:12.402748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x0bKsTs01fNfPvZH1f0tAB4Ky5PaSc4EYmp0Vcm/aES9UP6ojXkImiu8QAi3EIXnRjyLsoPjL2bzHVMbrgErBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:12.403427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5855","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb065af785411123bc1d4e97d75435d7fd7acfa68b71ef87a2c2b0d476d05dc7","sha256:f1a83841e2ecc8330d6a0ede638155f6386b11123b53602537bac1e650acf32b"],"state_sha256":"e843e66decda79bb5cb379479d67cede671576fc81c93765fa31ba5614e8f672"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEQgSXJxdqwyrx6g+iFh5z40PVRgbHRGDn8w/22VZlgqA+w1xRCM5BHiaqwCkpgbKLfF5KynUW59whNxp706Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:01:12.813808Z","bundle_sha256":"0d54a7366c816bddcc74b73c48ae6ed145e77be7c7514f7b3047ed1183227bd3"}}