{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VV6OED24TWWFGPDXPPBJR4UTKT","short_pith_number":"pith:VV6OED24","schema_version":"1.0","canonical_sha256":"ad7ce20f5c9dac533c777bc298f29354e41ba6562ec2b586fd25b892fcb723cb","source":{"kind":"arxiv","id":"2511.14482","version":2},"attestation_state":"computed","paper":{"title":"Gradient-Based Join Ordering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Maribel Acosta, Tim Schwabe","submitted_at":"2025-11-18T13:24:28Z","abstract_excerpt":"Join ordering is the NP-hard problem of selecting the most efficient order in which to evaluate joins (conjunctive, binary operators) in a database query. Because query execution performance critically depends on this choice, join ordering lies at the core of query optimization. Traditional approaches cast this problem as a discrete combinatorial search over binary trees guided by a cost model, but they have trade-offs between effectiveness and efficiency. We show that when the cost model is differentiable, query plans can be continuously relaxed into a soft adjacency matrix that represents a "},"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":"2511.14482","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-11-18T13:24:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b2283f5c48be1ef01be66da6867643737e769a7558046f69add946d40eaea124","abstract_canon_sha256":"680cfdbded51ae53c53720c8f33daa5690a14b769d939d2a8ffbb210615f53c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:28.084633Z","signature_b64":"0GXw8yWhWVC90WdwKHhs7K7ld3nZsF8VR/c6KgmGRs2UJMsUWgJbd8yYL98XL+WoKJKmcH1F213jv01jVmVZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad7ce20f5c9dac533c777bc298f29354e41ba6562ec2b586fd25b892fcb723cb","last_reissued_at":"2026-05-20T00:00:28.083859Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:28.083859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient-Based Join Ordering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Maribel Acosta, Tim Schwabe","submitted_at":"2025-11-18T13:24:28Z","abstract_excerpt":"Join ordering is the NP-hard problem of selecting the most efficient order in which to evaluate joins (conjunctive, binary operators) in a database query. Because query execution performance critically depends on this choice, join ordering lies at the core of query optimization. Traditional approaches cast this problem as a discrete combinatorial search over binary trees guided by a cost model, but they have trade-offs between effectiveness and efficiency. We show that when the cost model is differentiable, query plans can be continuously relaxed into a soft adjacency matrix that represents a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.14482","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/2511.14482/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":"2511.14482","created_at":"2026-05-20T00:00:28.083993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.14482v2","created_at":"2026-05-20T00:00:28.083993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.14482","created_at":"2026-05-20T00:00:28.083993+00:00"},{"alias_kind":"pith_short_12","alias_value":"VV6OED24TWWF","created_at":"2026-05-20T00:00:28.083993+00:00"},{"alias_kind":"pith_short_16","alias_value":"VV6OED24TWWFGPDX","created_at":"2026-05-20T00:00:28.083993+00:00"},{"alias_kind":"pith_short_8","alias_value":"VV6OED24","created_at":"2026-05-20T00:00:28.083993+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/VV6OED24TWWFGPDXPPBJR4UTKT","json":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT.json","graph_json":"https://pith.science/api/pith-number/VV6OED24TWWFGPDXPPBJR4UTKT/graph.json","events_json":"https://pith.science/api/pith-number/VV6OED24TWWFGPDXPPBJR4UTKT/events.json","paper":"https://pith.science/paper/VV6OED24"},"agent_actions":{"view_html":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT","download_json":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT.json","view_paper":"https://pith.science/paper/VV6OED24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.14482&json=true","fetch_graph":"https://pith.science/api/pith-number/VV6OED24TWWFGPDXPPBJR4UTKT/graph.json","fetch_events":"https://pith.science/api/pith-number/VV6OED24TWWFGPDXPPBJR4UTKT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT/action/storage_attestation","attest_author":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT/action/author_attestation","sign_citation":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT/action/citation_signature","submit_replication":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT/action/replication_record"}},"created_at":"2026-05-20T00:00:28.083993+00:00","updated_at":"2026-05-20T00:00:28.083993+00:00"}