{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CYHHGYHJBBTZDQCCTK45ZRT2UH","short_pith_number":"pith:CYHHGYHJ","schema_version":"1.0","canonical_sha256":"160e7360e9086791c0429ab9dcc67aa1d298caf685bf88c8912a9d9f61569a1e","source":{"kind":"arxiv","id":"2412.06189","version":4},"attestation_state":"computed","paper":{"title":"Fast Matrix Multiplication meets the Submodular Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Mahmoud Abo-Khamis, Xiao Hu","submitted_at":"2024-12-09T03:57:03Z","abstract_excerpt":"One fundamental question in database theory is the following: Given a Boolean conjunctive query Q, what is the best complexity for computing the answer to Q in terms of the input database size N? When restricted to the class of combinatorial algorithms, it is known that the best known complexity for any query Q is captured by the submodular width of Q. However, beyond combinatorial algorithms, certain queries are known to admit faster algorithms that often involve a clever combination of fast matrix multiplication and data partitioning. Nevertheless, there is no systematic way to derive and an"},"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":"2412.06189","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-09T03:57:03Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"dc8c8543650d06233816e0fe3914d56abce3bcd673085126eef00e4ac7ac5a10","abstract_canon_sha256":"9ec9cf1f87171eec46ba1ca909d70abfb66d806004475a8bfc96aaa52624284d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:39:24.247389Z","signature_b64":"GOCJESXMr3/57JbS/8+KLgoeTlB+uu39SLKViS9D9BKFXsH/+sz78VAPFXQhvWtA8vsAERkZA8g9SpxirialBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"160e7360e9086791c0429ab9dcc67aa1d298caf685bf88c8912a9d9f61569a1e","last_reissued_at":"2026-07-05T10:39:24.246855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:39:24.246855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Matrix Multiplication meets the Submodular Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Mahmoud Abo-Khamis, Xiao Hu","submitted_at":"2024-12-09T03:57:03Z","abstract_excerpt":"One fundamental question in database theory is the following: Given a Boolean conjunctive query Q, what is the best complexity for computing the answer to Q in terms of the input database size N? When restricted to the class of combinatorial algorithms, it is known that the best known complexity for any query Q is captured by the submodular width of Q. However, beyond combinatorial algorithms, certain queries are known to admit faster algorithms that often involve a clever combination of fast matrix multiplication and data partitioning. Nevertheless, there is no systematic way to derive and an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06189","kind":"arxiv","version":4},"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/2412.06189/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":"2412.06189","created_at":"2026-07-05T10:39:24.246925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.06189v4","created_at":"2026-07-05T10:39:24.246925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06189","created_at":"2026-07-05T10:39:24.246925+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYHHGYHJBBTZ","created_at":"2026-07-05T10:39:24.246925+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYHHGYHJBBTZDQCC","created_at":"2026-07-05T10:39:24.246925+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYHHGYHJ","created_at":"2026-07-05T10:39:24.246925+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/CYHHGYHJBBTZDQCCTK45ZRT2UH","json":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH.json","graph_json":"https://pith.science/api/pith-number/CYHHGYHJBBTZDQCCTK45ZRT2UH/graph.json","events_json":"https://pith.science/api/pith-number/CYHHGYHJBBTZDQCCTK45ZRT2UH/events.json","paper":"https://pith.science/paper/CYHHGYHJ"},"agent_actions":{"view_html":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH","download_json":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH.json","view_paper":"https://pith.science/paper/CYHHGYHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.06189&json=true","fetch_graph":"https://pith.science/api/pith-number/CYHHGYHJBBTZDQCCTK45ZRT2UH/graph.json","fetch_events":"https://pith.science/api/pith-number/CYHHGYHJBBTZDQCCTK45ZRT2UH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH/action/storage_attestation","attest_author":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH/action/author_attestation","sign_citation":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH/action/citation_signature","submit_replication":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH/action/replication_record"}},"created_at":"2026-07-05T10:39:24.246925+00:00","updated_at":"2026-07-05T10:39:24.246925+00:00"}