{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QJQ66ALEESSEHPWAFDDH7NHDSV","short_pith_number":"pith:QJQ66ALE","schema_version":"1.0","canonical_sha256":"8261ef016424a443bec028c67fb4e3954326c78b661b9fbfd647890ccc336556","source":{"kind":"arxiv","id":"2409.08142","version":2},"attestation_state":"computed","paper":{"title":"Ranked Enumeration for Database Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Mirek Riedewald, Nikolaos Tziavelis, Wolfgang Gatterbauer","submitted_at":"2024-09-12T15:34:23Z","abstract_excerpt":"Ranked enumeration is a query-answering paradigm where the query answers are returned incrementally in order of importance (instead of returning all answers at once). Importance is defined by a ranking function that can be specific to the application, but typically involves either a lexicographic order (e.g., \"ORDER BY R.A, S.B\" in SQL) or a weighted sum of attributes (e.g., \"ORDER BY 3*R.A + 2*S.B\"). Recent work has introduced any-k algorithms for (multi-way) join queries, which push ranking into joins and avoid materializing intermediate results until necessary. The top-ranked answers are re"},"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":"2409.08142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-09-12T15:34:23Z","cross_cats_sorted":[],"title_canon_sha256":"b475734eecd7ae43341ec562689e70c891469e0f7d7fbde25814fa6ae510da85","abstract_canon_sha256":"29a214622bc8eb4ad680864f0ccae3c9731edbbde0219bd9543ba9b1aa69a5cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:08.914828Z","signature_b64":"gL0Vu36bC82LbqrkhUl7lw0oUCHsEVIQIAPMpCur5Sal1aCCS5yR5VaEsgBTE8xf9B/HMXkUEHdSME/7AYFcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8261ef016424a443bec028c67fb4e3954326c78b661b9fbfd647890ccc336556","last_reissued_at":"2026-07-05T10:10:08.914420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:08.914420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ranked Enumeration for Database Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Mirek Riedewald, Nikolaos Tziavelis, Wolfgang Gatterbauer","submitted_at":"2024-09-12T15:34:23Z","abstract_excerpt":"Ranked enumeration is a query-answering paradigm where the query answers are returned incrementally in order of importance (instead of returning all answers at once). Importance is defined by a ranking function that can be specific to the application, but typically involves either a lexicographic order (e.g., \"ORDER BY R.A, S.B\" in SQL) or a weighted sum of attributes (e.g., \"ORDER BY 3*R.A + 2*S.B\"). Recent work has introduced any-k algorithms for (multi-way) join queries, which push ranking into joins and avoid materializing intermediate results until necessary. The top-ranked answers are re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.08142","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/2409.08142/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":"2409.08142","created_at":"2026-07-05T10:10:08.914479+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.08142v2","created_at":"2026-07-05T10:10:08.914479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.08142","created_at":"2026-07-05T10:10:08.914479+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJQ66ALEESSE","created_at":"2026-07-05T10:10:08.914479+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJQ66ALEESSEHPWA","created_at":"2026-07-05T10:10:08.914479+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJQ66ALE","created_at":"2026-07-05T10:10:08.914479+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/QJQ66ALEESSEHPWAFDDH7NHDSV","json":"https://pith.science/pith/QJQ66ALEESSEHPWAFDDH7NHDSV.json","graph_json":"https://pith.science/api/pith-number/QJQ66ALEESSEHPWAFDDH7NHDSV/graph.json","events_json":"https://pith.science/api/pith-number/QJQ66ALEESSEHPWAFDDH7NHDSV/events.json","paper":"https://pith.science/paper/QJQ66ALE"},"agent_actions":{"view_html":"https://pith.science/pith/QJQ66ALEESSEHPWAFDDH7NHDSV","download_json":"https://pith.science/pith/QJQ66ALEESSEHPWAFDDH7NHDSV.json","view_paper":"https://pith.science/paper/QJQ66ALE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.08142&json=true","fetch_graph":"https://pith.science/api/pith-number/QJQ66ALEESSEHPWAFDDH7NHDSV/graph.json","fetch_events":"https://pith.science/api/pith-number/QJQ66ALEESSEHPWAFDDH7NHDSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJQ66ALEESSEHPWAFDDH7NHDSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJQ66ALEESSEHPWAFDDH7NHDSV/action/storage_attestation","attest_author":"https://pith.science/pith/QJQ66ALEESSEHPWAFDDH7NHDSV/action/author_attestation","sign_citation":"https://pith.science/pith/QJQ66ALEESSEHPWAFDDH7NHDSV/action/citation_signature","submit_replication":"https://pith.science/pith/QJQ66ALEESSEHPWAFDDH7NHDSV/action/replication_record"}},"created_at":"2026-07-05T10:10:08.914479+00:00","updated_at":"2026-07-05T10:10:08.914479+00:00"}