{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QDCDICWTXESJXGA3UNKA2CYMAD","short_pith_number":"pith:QDCDICWT","schema_version":"1.0","canonical_sha256":"80c4340ad3b9249b981ba3540d0b0c00d18566f202e067eec7b5bfca150e22e2","source":{"kind":"arxiv","id":"2412.10253","version":1},"attestation_state":"computed","paper":{"title":"A Novel Framework Using Deep Reinforcement Learning for Join Order Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amin Kamali, Calisto Zuzarte, Chang Liu, Verena Kantere, Vincent Corvinelli","submitted_at":"2024-12-13T16:22:58Z","abstract_excerpt":"Join order selection is a sub-field of query optimization that aims to find the optimal join order for an SQL query with the minimum cost. The challenge lies in the exponentially growing search space as the number of tables increases, making exhaustive enumeration impractical. Traditional optimizers use static heuristics to prune the search space, but they often fail to adapt to changes or improve based on feedback from the DBMS. Recent research addresses these limitations with Deep Reinforcement Learning (DRL), allowing models to use feedback to dynamically search for better join orders and e"},"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.10253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-13T16:22:58Z","cross_cats_sorted":[],"title_canon_sha256":"c7e1dd5be4372c336db5cdfb9d1ea30141ebf39314cf09bf55206a22cb757280","abstract_canon_sha256":"b6a83e718fae57d2430c58fa96f24a2301a29c6e8c53ab6e3bde606033f6dff0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:49.255559Z","signature_b64":"YiWY5CKcjWpBo6uceEWenGBXXpizZwaPf6jXTWcq7CCUs2dCCn9M4M5h9Ym+Rppgz9hmrL2TlnuxDrtGQXcoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80c4340ad3b9249b981ba3540d0b0c00d18566f202e067eec7b5bfca150e22e2","last_reissued_at":"2026-07-05T09:48:49.255147Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:49.255147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Framework Using Deep Reinforcement Learning for Join Order Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amin Kamali, Calisto Zuzarte, Chang Liu, Verena Kantere, Vincent Corvinelli","submitted_at":"2024-12-13T16:22:58Z","abstract_excerpt":"Join order selection is a sub-field of query optimization that aims to find the optimal join order for an SQL query with the minimum cost. The challenge lies in the exponentially growing search space as the number of tables increases, making exhaustive enumeration impractical. Traditional optimizers use static heuristics to prune the search space, but they often fail to adapt to changes or improve based on feedback from the DBMS. Recent research addresses these limitations with Deep Reinforcement Learning (DRL), allowing models to use feedback to dynamically search for better join orders and e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.10253","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/2412.10253/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.10253","created_at":"2026-07-05T09:48:49.255209+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.10253v1","created_at":"2026-07-05T09:48:49.255209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.10253","created_at":"2026-07-05T09:48:49.255209+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDCDICWTXESJ","created_at":"2026-07-05T09:48:49.255209+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDCDICWTXESJXGA3","created_at":"2026-07-05T09:48:49.255209+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDCDICWT","created_at":"2026-07-05T09:48:49.255209+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/QDCDICWTXESJXGA3UNKA2CYMAD","json":"https://pith.science/pith/QDCDICWTXESJXGA3UNKA2CYMAD.json","graph_json":"https://pith.science/api/pith-number/QDCDICWTXESJXGA3UNKA2CYMAD/graph.json","events_json":"https://pith.science/api/pith-number/QDCDICWTXESJXGA3UNKA2CYMAD/events.json","paper":"https://pith.science/paper/QDCDICWT"},"agent_actions":{"view_html":"https://pith.science/pith/QDCDICWTXESJXGA3UNKA2CYMAD","download_json":"https://pith.science/pith/QDCDICWTXESJXGA3UNKA2CYMAD.json","view_paper":"https://pith.science/paper/QDCDICWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.10253&json=true","fetch_graph":"https://pith.science/api/pith-number/QDCDICWTXESJXGA3UNKA2CYMAD/graph.json","fetch_events":"https://pith.science/api/pith-number/QDCDICWTXESJXGA3UNKA2CYMAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDCDICWTXESJXGA3UNKA2CYMAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDCDICWTXESJXGA3UNKA2CYMAD/action/storage_attestation","attest_author":"https://pith.science/pith/QDCDICWTXESJXGA3UNKA2CYMAD/action/author_attestation","sign_citation":"https://pith.science/pith/QDCDICWTXESJXGA3UNKA2CYMAD/action/citation_signature","submit_replication":"https://pith.science/pith/QDCDICWTXESJXGA3UNKA2CYMAD/action/replication_record"}},"created_at":"2026-07-05T09:48:49.255209+00:00","updated_at":"2026-07-05T09:48:49.255209+00:00"}