{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:CYHHGYHJBBTZDQCCTK45ZRT2UH","short_pith_number":"pith:CYHHGYHJ","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"},"canonical_sha256":"160e7360e9086791c0429ab9dcc67aa1d298caf685bf88c8912a9d9f61569a1e","source":{"kind":"arxiv","id":"2412.06189","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.06189","created_at":"2026-07-05T10:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"2412.06189v4","created_at":"2026-07-05T10:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06189","created_at":"2026-07-05T10:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"CYHHGYHJBBTZ","created_at":"2026-07-05T10:39:24Z"},{"alias_kind":"pith_short_16","alias_value":"CYHHGYHJBBTZDQCC","created_at":"2026-07-05T10:39:24Z"},{"alias_kind":"pith_short_8","alias_value":"CYHHGYHJ","created_at":"2026-07-05T10:39:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:CYHHGYHJBBTZDQCCTK45ZRT2UH","target":"record","payload":{"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"},"canonical_sha256":"160e7360e9086791c0429ab9dcc67aa1d298caf685bf88c8912a9d9f61569a1e","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"},"source_kind":"arxiv","source_id":"2412.06189","source_version":4,"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-07-05T10:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"he1z0BSN3An6ACr7UaFd02iVGMpXtwZNNg63f1Nr/9802dc2v9b4hKt5JxAUFW+nHFYs2dPYoTT3+VspZilDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:15:31.631835Z"},"content_sha256":"360f957506ac090163664b57328001100ce39288245e420be37da4a0013f98d0","schema_version":"1.0","event_id":"sha256:360f957506ac090163664b57328001100ce39288245e420be37da4a0013f98d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:CYHHGYHJBBTZDQCCTK45ZRT2UH","target":"graph","payload":{"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"},"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-07-05T10:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Et2Vwp5W6BDDZq2Yjb2aX4plhj3H7ocwlEXbe9XC/jK03/DJ6t9q4MAQr6UYwFvtEVBY3LDJ5r8/C3z6nF1ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:15:31.632314Z"},"content_sha256":"2994abb255efc3f71f3b23277b51004e695f80a7cde261bbdb52c4bf2d27a544","schema_version":"1.0","event_id":"sha256:2994abb255efc3f71f3b23277b51004e695f80a7cde261bbdb52c4bf2d27a544"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH/bundle.json","state_url":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH/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-08-05T09:15:31Z","links":{"resolver":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH","bundle":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH/bundle.json","state":"https://pith.science/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYHHGYHJBBTZDQCCTK45ZRT2UH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CYHHGYHJBBTZDQCCTK45ZRT2UH","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":"9ec9cf1f87171eec46ba1ca909d70abfb66d806004475a8bfc96aaa52624284d","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-09T03:57:03Z","title_canon_sha256":"dc8c8543650d06233816e0fe3914d56abce3bcd673085126eef00e4ac7ac5a10"},"schema_version":"1.0","source":{"id":"2412.06189","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.06189","created_at":"2026-07-05T10:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"2412.06189v4","created_at":"2026-07-05T10:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06189","created_at":"2026-07-05T10:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"CYHHGYHJBBTZ","created_at":"2026-07-05T10:39:24Z"},{"alias_kind":"pith_short_16","alias_value":"CYHHGYHJBBTZDQCC","created_at":"2026-07-05T10:39:24Z"},{"alias_kind":"pith_short_8","alias_value":"CYHHGYHJ","created_at":"2026-07-05T10:39:24Z"}],"graph_snapshots":[{"event_id":"sha256:2994abb255efc3f71f3b23277b51004e695f80a7cde261bbdb52c4bf2d27a544","target":"graph","created_at":"2026-07-05T10:39:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.06189/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dan Suciu, Mahmoud Abo-Khamis, Xiao Hu","cross_cats":["cs.CC","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-09T03:57:03Z","title":"Fast Matrix Multiplication meets the Submodular Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06189","kind":"arxiv","version":4},"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:360f957506ac090163664b57328001100ce39288245e420be37da4a0013f98d0","target":"record","created_at":"2026-07-05T10:39:24Z","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":"9ec9cf1f87171eec46ba1ca909d70abfb66d806004475a8bfc96aaa52624284d","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-09T03:57:03Z","title_canon_sha256":"dc8c8543650d06233816e0fe3914d56abce3bcd673085126eef00e4ac7ac5a10"},"schema_version":"1.0","source":{"id":"2412.06189","kind":"arxiv","version":4}},"canonical_sha256":"160e7360e9086791c0429ab9dcc67aa1d298caf685bf88c8912a9d9f61569a1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"160e7360e9086791c0429ab9dcc67aa1d298caf685bf88c8912a9d9f61569a1e","first_computed_at":"2026-07-05T10:39:24.246855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:39:24.246855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GOCJESXMr3/57JbS/8+KLgoeTlB+uu39SLKViS9D9BKFXsH/+sz78VAPFXQhvWtA8vsAERkZA8g9SpxirialBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:39:24.247389Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.06189","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:360f957506ac090163664b57328001100ce39288245e420be37da4a0013f98d0","sha256:2994abb255efc3f71f3b23277b51004e695f80a7cde261bbdb52c4bf2d27a544"],"state_sha256":"8d065948752b18ef9f323a966b56ac4090129ddcbc1345a277b1e3f1edcdfc07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VB53OsnM41gE2Sy47NrpWfhuQVDDHaqOgvuRk3FYC4mWMV5Y4HApqhs5hERFvPYmMGkSClgt8k+CI3Wc52ZNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:15:31.637167Z","bundle_sha256":"cfca6912b227c1ca21861fbd0067a97e8dd595cd7020d9e1a58c8af8442df278"}}