{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HGLSCRBGEGFCPS5FH6J5ZYLB6J","short_pith_number":"pith:HGLSCRBG","canonical_record":{"source":{"id":"2402.02001","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-02-03T02:53:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"756ac6c53d42d0eaa4c588a9e05549fdc45faa317efc318c58211ac2ec976260","abstract_canon_sha256":"da58ee669bdacd043675000d9e9a6fd77068cb63b684e3704607dfa109a35d6b"},"schema_version":"1.0"},"canonical_sha256":"3997214426218a27cba53f93dce161f260ba9a22b6243eff97a99fab3c8e104d","source":{"kind":"arxiv","id":"2402.02001","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.02001","created_at":"2026-07-05T10:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"2402.02001v8","created_at":"2026-07-05T10:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.02001","created_at":"2026-07-05T10:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"HGLSCRBGEGFC","created_at":"2026-07-05T10:58:59Z"},{"alias_kind":"pith_short_16","alias_value":"HGLSCRBGEGFCPS5F","created_at":"2026-07-05T10:58:59Z"},{"alias_kind":"pith_short_8","alias_value":"HGLSCRBG","created_at":"2026-07-05T10:58:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HGLSCRBGEGFCPS5FH6J5ZYLB6J","target":"record","payload":{"canonical_record":{"source":{"id":"2402.02001","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-02-03T02:53:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"756ac6c53d42d0eaa4c588a9e05549fdc45faa317efc318c58211ac2ec976260","abstract_canon_sha256":"da58ee669bdacd043675000d9e9a6fd77068cb63b684e3704607dfa109a35d6b"},"schema_version":"1.0"},"canonical_sha256":"3997214426218a27cba53f93dce161f260ba9a22b6243eff97a99fab3c8e104d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:59.221746Z","signature_b64":"Sc9p+Z0/SGQNb55HKCFEl3zFeR6NetdTK03ZqZeQz/+xo9i93btQ9Cb8rleRAA/rAwqfZ5x9QAMqWaux5IQaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3997214426218a27cba53f93dce161f260ba9a22b6243eff97a99fab3c8e104d","last_reissued_at":"2026-07-05T10:58:59.221264Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:59.221264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.02001","source_version":8,"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:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZGmf9Ds3ALkD6cbFhLkWW2HSaOHKwiEUUAMwt3fkEHyRX0G7tuQsutnsryM6TRVovczlTvxtX3+/cJInkX74BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:44:55.170187Z"},"content_sha256":"de2ec196cf53dfaf2166315b18386b6a3ffebc2dfa4cf9e46589a2257da4cf79","schema_version":"1.0","event_id":"sha256:de2ec196cf53dfaf2166315b18386b6a3ffebc2dfa4cf9e46589a2257da4cf79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HGLSCRBGEGFCPS5FH6J5ZYLB6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PANDA: Query Evaluation in Submodular Width","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Hung Q. Ngo, Mahmoud Abo Khamis","submitted_at":"2024-02-03T02:53:22Z","abstract_excerpt":"In recent years, several information-theoretic upper bounds have been introduced on the output size and evaluation cost of database join queries. These bounds vary in their power depending on both the type of statistics on input relations and the query plans that they support. This motivated the search for algorithms that can compute the output of a join query in times that are bounded by the corresponding information-theoretic bounds. In this paper, we describe PANDA, an algorithm that takes a Shannon-inequality that underlies the bound, and translates each proof step into an algorithmic step"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.02001","kind":"arxiv","version":8},"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/2402.02001/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:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vgh7370xw2B+25iUDQnsvWpDNOift/PKFTkSdWx+hSdE39rOSfo/I5YxKFykVq6GiwI8idlCSG9h8603OVUvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:44:55.170675Z"},"content_sha256":"abd71afef7fb29f30b497718ca102e4941cf3ba5c4bf2372b0af1803df7ab575","schema_version":"1.0","event_id":"sha256:abd71afef7fb29f30b497718ca102e4941cf3ba5c4bf2372b0af1803df7ab575"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGLSCRBGEGFCPS5FH6J5ZYLB6J/bundle.json","state_url":"https://pith.science/pith/HGLSCRBGEGFCPS5FH6J5ZYLB6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGLSCRBGEGFCPS5FH6J5ZYLB6J/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-05T06:44:55Z","links":{"resolver":"https://pith.science/pith/HGLSCRBGEGFCPS5FH6J5ZYLB6J","bundle":"https://pith.science/pith/HGLSCRBGEGFCPS5FH6J5ZYLB6J/bundle.json","state":"https://pith.science/pith/HGLSCRBGEGFCPS5FH6J5ZYLB6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGLSCRBGEGFCPS5FH6J5ZYLB6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HGLSCRBGEGFCPS5FH6J5ZYLB6J","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":"da58ee669bdacd043675000d9e9a6fd77068cb63b684e3704607dfa109a35d6b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-02-03T02:53:22Z","title_canon_sha256":"756ac6c53d42d0eaa4c588a9e05549fdc45faa317efc318c58211ac2ec976260"},"schema_version":"1.0","source":{"id":"2402.02001","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.02001","created_at":"2026-07-05T10:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"2402.02001v8","created_at":"2026-07-05T10:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.02001","created_at":"2026-07-05T10:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"HGLSCRBGEGFC","created_at":"2026-07-05T10:58:59Z"},{"alias_kind":"pith_short_16","alias_value":"HGLSCRBGEGFCPS5F","created_at":"2026-07-05T10:58:59Z"},{"alias_kind":"pith_short_8","alias_value":"HGLSCRBG","created_at":"2026-07-05T10:58:59Z"}],"graph_snapshots":[{"event_id":"sha256:abd71afef7fb29f30b497718ca102e4941cf3ba5c4bf2372b0af1803df7ab575","target":"graph","created_at":"2026-07-05T10:58:59Z","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/2402.02001/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In recent years, several information-theoretic upper bounds have been introduced on the output size and evaluation cost of database join queries. These bounds vary in their power depending on both the type of statistics on input relations and the query plans that they support. This motivated the search for algorithms that can compute the output of a join query in times that are bounded by the corresponding information-theoretic bounds. In this paper, we describe PANDA, an algorithm that takes a Shannon-inequality that underlies the bound, and translates each proof step into an algorithmic step","authors_text":"Dan Suciu, Hung Q. Ngo, Mahmoud Abo Khamis","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-02-03T02:53:22Z","title":"PANDA: Query Evaluation in Submodular Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.02001","kind":"arxiv","version":8},"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:de2ec196cf53dfaf2166315b18386b6a3ffebc2dfa4cf9e46589a2257da4cf79","target":"record","created_at":"2026-07-05T10:58:59Z","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":"da58ee669bdacd043675000d9e9a6fd77068cb63b684e3704607dfa109a35d6b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-02-03T02:53:22Z","title_canon_sha256":"756ac6c53d42d0eaa4c588a9e05549fdc45faa317efc318c58211ac2ec976260"},"schema_version":"1.0","source":{"id":"2402.02001","kind":"arxiv","version":8}},"canonical_sha256":"3997214426218a27cba53f93dce161f260ba9a22b6243eff97a99fab3c8e104d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3997214426218a27cba53f93dce161f260ba9a22b6243eff97a99fab3c8e104d","first_computed_at":"2026-07-05T10:58:59.221264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:58:59.221264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sc9p+Z0/SGQNb55HKCFEl3zFeR6NetdTK03ZqZeQz/+xo9i93btQ9Cb8rleRAA/rAwqfZ5x9QAMqWaux5IQaCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:58:59.221746Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.02001","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de2ec196cf53dfaf2166315b18386b6a3ffebc2dfa4cf9e46589a2257da4cf79","sha256:abd71afef7fb29f30b497718ca102e4941cf3ba5c4bf2372b0af1803df7ab575"],"state_sha256":"4e5c7b6d56dca212f32009ea830d9d3806fff120fa535c5b5db15528601ebd1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+GoTC65mLwGfF6CPRRITtCuetEgc2bcXyUUEh+p45O3XrToSfdZeLvuWTcltfQkZN38q1ao7cc+sk854Z5xCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T06:44:55.173922Z","bundle_sha256":"d3ea9215e9ba7030b6b5225afbe411847c46db200d8feb95af13685965252762"}}