{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2A4UM5R2YJ4YIKQW4RSIMWIKWN","short_pith_number":"pith:2A4UM5R2","schema_version":"1.0","canonical_sha256":"d03946763ac279842a16e46486590ab370a7b0190c166d426c1e6ddeaf504bc2","source":{"kind":"arxiv","id":"2502.05912","version":1},"attestation_state":"computed","paper":{"title":"LpBound: Pessimistic Cardinality Estimation using $\\ell_p$-Norms of Degree Sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Christoph Mayer, Dan Olteanu, Dan Suciu, Haozhe Zhang, Mahmoud Abo Khamis","submitted_at":"2025-02-09T14:13:51Z","abstract_excerpt":"Cardinality estimation is the problem of estimating the size of the output of a query, without actually evaluating the query. The cardinality estimator is a critical piece of a query optimizer, and is often the main culprit when the optimizer chooses a poor plan.\n  This paper introduces LpBound, a pessimistic cardinality estimator for multijoin queries (acyclic or cyclic) with selection predicates and group-by clauses. LpBound computes a guaranteed upper bound on the size of the query output using simple statistics on the input relations, consisting of $\\ell_p$-norms of degree sequences. The b"},"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":"2502.05912","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-02-09T14:13:51Z","cross_cats_sorted":[],"title_canon_sha256":"3bf73437e74c99cb0ad67cf2287b0ae65d2387def5c1f90264559b954c4f35d5","abstract_canon_sha256":"d0d6cb26602cc848ca121e8227627c5ce76230a1202dc878b58f6ec3f1ac6c44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:45.159964Z","signature_b64":"gseGrHAo9Ivv/HRzFeDHDMwXLHL1tmdImGqZ/rA1USYN43/LyZQS7dwhFp+eyVOUinnVlz3dlG8+qJswxo7BDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d03946763ac279842a16e46486590ab370a7b0190c166d426c1e6ddeaf504bc2","last_reissued_at":"2026-07-05T10:11:45.159485Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:45.159485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LpBound: Pessimistic Cardinality Estimation using $\\ell_p$-Norms of Degree Sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Christoph Mayer, Dan Olteanu, Dan Suciu, Haozhe Zhang, Mahmoud Abo Khamis","submitted_at":"2025-02-09T14:13:51Z","abstract_excerpt":"Cardinality estimation is the problem of estimating the size of the output of a query, without actually evaluating the query. The cardinality estimator is a critical piece of a query optimizer, and is often the main culprit when the optimizer chooses a poor plan.\n  This paper introduces LpBound, a pessimistic cardinality estimator for multijoin queries (acyclic or cyclic) with selection predicates and group-by clauses. LpBound computes a guaranteed upper bound on the size of the query output using simple statistics on the input relations, consisting of $\\ell_p$-norms of degree sequences. The b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05912","kind":"arxiv","version":1},"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/2502.05912/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":"2502.05912","created_at":"2026-07-05T10:11:45.159537+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.05912v1","created_at":"2026-07-05T10:11:45.159537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05912","created_at":"2026-07-05T10:11:45.159537+00:00"},{"alias_kind":"pith_short_12","alias_value":"2A4UM5R2YJ4Y","created_at":"2026-07-05T10:11:45.159537+00:00"},{"alias_kind":"pith_short_16","alias_value":"2A4UM5R2YJ4YIKQW","created_at":"2026-07-05T10:11:45.159537+00:00"},{"alias_kind":"pith_short_8","alias_value":"2A4UM5R2","created_at":"2026-07-05T10:11:45.159537+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07552","citing_title":"Quantum Information-Theoretical Size Bounds for Conjunctive Queries with Functional Dependencies","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2A4UM5R2YJ4YIKQW4RSIMWIKWN","json":"https://pith.science/pith/2A4UM5R2YJ4YIKQW4RSIMWIKWN.json","graph_json":"https://pith.science/api/pith-number/2A4UM5R2YJ4YIKQW4RSIMWIKWN/graph.json","events_json":"https://pith.science/api/pith-number/2A4UM5R2YJ4YIKQW4RSIMWIKWN/events.json","paper":"https://pith.science/paper/2A4UM5R2"},"agent_actions":{"view_html":"https://pith.science/pith/2A4UM5R2YJ4YIKQW4RSIMWIKWN","download_json":"https://pith.science/pith/2A4UM5R2YJ4YIKQW4RSIMWIKWN.json","view_paper":"https://pith.science/paper/2A4UM5R2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.05912&json=true","fetch_graph":"https://pith.science/api/pith-number/2A4UM5R2YJ4YIKQW4RSIMWIKWN/graph.json","fetch_events":"https://pith.science/api/pith-number/2A4UM5R2YJ4YIKQW4RSIMWIKWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2A4UM5R2YJ4YIKQW4RSIMWIKWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2A4UM5R2YJ4YIKQW4RSIMWIKWN/action/storage_attestation","attest_author":"https://pith.science/pith/2A4UM5R2YJ4YIKQW4RSIMWIKWN/action/author_attestation","sign_citation":"https://pith.science/pith/2A4UM5R2YJ4YIKQW4RSIMWIKWN/action/citation_signature","submit_replication":"https://pith.science/pith/2A4UM5R2YJ4YIKQW4RSIMWIKWN/action/replication_record"}},"created_at":"2026-07-05T10:11:45.159537+00:00","updated_at":"2026-07-05T10:11:45.159537+00:00"}