{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MOJQ2RMUMSXBLGCEMUYW4HX4A2","short_pith_number":"pith:MOJQ2RMU","schema_version":"1.0","canonical_sha256":"63930d459464ae15984465316e1efc06a623aa947485583630d6494d442604f3","source":{"kind":"arxiv","id":"2311.09095","version":2},"attestation_state":"computed","paper":{"title":"New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Nick Fischer, Raghu Meka, Shachar Lovett, Zander Kelley","submitted_at":"2023-11-15T16:42:18Z","abstract_excerpt":"We revisit the fundamental Boolean Matrix Multiplication (BMM) problem. With the invention of algebraic fast matrix multiplication over 50 years ago, it also became known that BMM can be solved in truly subcubic $O(n^\\omega)$ time, where $\\omega<3$; much work has gone into bringing $\\omega$ closer to $2$. Since then, a parallel line of work has sought comparably fast combinatorial algorithms but with limited success. The naive $O(n^3)$-time algorithm was initially improved by a $\\log^2{n}$ factor [Arlazarov et al.; RAS'70], then by $\\log^{2.25}{n}$ [Bansal and Williams; FOCS'09], then by $\\log"},"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":"2311.09095","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-15T16:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"55c340c7f6b57ff4cfcd8bfb0bf7d0f008c354d33cfa4bab26c0644d1b52f174","abstract_canon_sha256":"ecb33394a1c7c549668c08f84d4cc9be3d129e602dcd251a5a52d9e0c5681665"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:13.619251Z","signature_b64":"2zovyklfi4pbVToeDR1eKVfUuALHmWC48u6WgDaTboQ16++d0LZvQvRWnvsGStg/H4w+lC8nWyNOF+h6Lv8HBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63930d459464ae15984465316e1efc06a623aa947485583630d6494d442604f3","last_reissued_at":"2026-07-05T08:23:13.618816Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:13.618816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Nick Fischer, Raghu Meka, Shachar Lovett, Zander Kelley","submitted_at":"2023-11-15T16:42:18Z","abstract_excerpt":"We revisit the fundamental Boolean Matrix Multiplication (BMM) problem. With the invention of algebraic fast matrix multiplication over 50 years ago, it also became known that BMM can be solved in truly subcubic $O(n^\\omega)$ time, where $\\omega<3$; much work has gone into bringing $\\omega$ closer to $2$. Since then, a parallel line of work has sought comparably fast combinatorial algorithms but with limited success. The naive $O(n^3)$-time algorithm was initially improved by a $\\log^2{n}$ factor [Arlazarov et al.; RAS'70], then by $\\log^{2.25}{n}$ [Bansal and Williams; FOCS'09], then by $\\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.09095","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.09095/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":"2311.09095","created_at":"2026-07-05T08:23:13.618873+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.09095v2","created_at":"2026-07-05T08:23:13.618873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.09095","created_at":"2026-07-05T08:23:13.618873+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOJQ2RMUMSXB","created_at":"2026-07-05T08:23:13.618873+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOJQ2RMUMSXBLGCE","created_at":"2026-07-05T08:23:13.618873+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOJQ2RMU","created_at":"2026-07-05T08:23:13.618873+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/MOJQ2RMUMSXBLGCEMUYW4HX4A2","json":"https://pith.science/pith/MOJQ2RMUMSXBLGCEMUYW4HX4A2.json","graph_json":"https://pith.science/api/pith-number/MOJQ2RMUMSXBLGCEMUYW4HX4A2/graph.json","events_json":"https://pith.science/api/pith-number/MOJQ2RMUMSXBLGCEMUYW4HX4A2/events.json","paper":"https://pith.science/paper/MOJQ2RMU"},"agent_actions":{"view_html":"https://pith.science/pith/MOJQ2RMUMSXBLGCEMUYW4HX4A2","download_json":"https://pith.science/pith/MOJQ2RMUMSXBLGCEMUYW4HX4A2.json","view_paper":"https://pith.science/paper/MOJQ2RMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.09095&json=true","fetch_graph":"https://pith.science/api/pith-number/MOJQ2RMUMSXBLGCEMUYW4HX4A2/graph.json","fetch_events":"https://pith.science/api/pith-number/MOJQ2RMUMSXBLGCEMUYW4HX4A2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOJQ2RMUMSXBLGCEMUYW4HX4A2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOJQ2RMUMSXBLGCEMUYW4HX4A2/action/storage_attestation","attest_author":"https://pith.science/pith/MOJQ2RMUMSXBLGCEMUYW4HX4A2/action/author_attestation","sign_citation":"https://pith.science/pith/MOJQ2RMUMSXBLGCEMUYW4HX4A2/action/citation_signature","submit_replication":"https://pith.science/pith/MOJQ2RMUMSXBLGCEMUYW4HX4A2/action/replication_record"}},"created_at":"2026-07-05T08:23:13.618873+00:00","updated_at":"2026-07-05T08:23:13.618873+00:00"}