{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VV6OED24TWWFGPDXPPBJR4UTKT","short_pith_number":"pith:VV6OED24","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"},"canonical_sha256":"ad7ce20f5c9dac533c777bc298f29354e41ba6562ec2b586fd25b892fcb723cb","source":{"kind":"arxiv","id":"2511.14482","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.14482","created_at":"2026-05-20T00:00:28Z"},{"alias_kind":"arxiv_version","alias_value":"2511.14482v2","created_at":"2026-05-20T00:00:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.14482","created_at":"2026-05-20T00:00:28Z"},{"alias_kind":"pith_short_12","alias_value":"VV6OED24TWWF","created_at":"2026-05-20T00:00:28Z"},{"alias_kind":"pith_short_16","alias_value":"VV6OED24TWWFGPDX","created_at":"2026-05-20T00:00:28Z"},{"alias_kind":"pith_short_8","alias_value":"VV6OED24","created_at":"2026-05-20T00:00:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VV6OED24TWWFGPDXPPBJR4UTKT","target":"record","payload":{"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"},"canonical_sha256":"ad7ce20f5c9dac533c777bc298f29354e41ba6562ec2b586fd25b892fcb723cb","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"},"source_kind":"arxiv","source_id":"2511.14482","source_version":2,"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-05-20T00:00:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FIIFwn33tBulFlFaP+OGZvGR2vJzfQ0UZr3LqJ9I+fT84RIztEEt1pyyhFnat+PALJLgESmKMJ8IMtXk4mtPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:50:51.273097Z"},"content_sha256":"500845278a662f0c7c202ddc2f7e7ef1ce8795775e64d8a21e2ac006d7601e39","schema_version":"1.0","event_id":"sha256:500845278a662f0c7c202ddc2f7e7ef1ce8795775e64d8a21e2ac006d7601e39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VV6OED24TWWFGPDXPPBJR4UTKT","target":"graph","payload":{"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"},"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-05-20T00:00:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrQv1Ajjo0yx5BVK/C78eg2CSz5N1v3hJQ1IaOSrWgOXoCtCUpyCRo3kz7ZLD7fn4FpXks1rMM8kesEUMU+cCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:50:51.273493Z"},"content_sha256":"a96790532420d6872c8d21040357d8beb6a38ceed837d879ca6a54c45e8a4a34","schema_version":"1.0","event_id":"sha256:a96790532420d6872c8d21040357d8beb6a38ceed837d879ca6a54c45e8a4a34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT/bundle.json","state_url":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VV6OED24TWWFGPDXPPBJR4UTKT/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-05-28T10:50:51Z","links":{"resolver":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT","bundle":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT/bundle.json","state":"https://pith.science/pith/VV6OED24TWWFGPDXPPBJR4UTKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VV6OED24TWWFGPDXPPBJR4UTKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VV6OED24TWWFGPDXPPBJR4UTKT","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":"680cfdbded51ae53c53720c8f33daa5690a14b769d939d2a8ffbb210615f53c3","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-11-18T13:24:28Z","title_canon_sha256":"b2283f5c48be1ef01be66da6867643737e769a7558046f69add946d40eaea124"},"schema_version":"1.0","source":{"id":"2511.14482","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.14482","created_at":"2026-05-20T00:00:28Z"},{"alias_kind":"arxiv_version","alias_value":"2511.14482v2","created_at":"2026-05-20T00:00:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.14482","created_at":"2026-05-20T00:00:28Z"},{"alias_kind":"pith_short_12","alias_value":"VV6OED24TWWF","created_at":"2026-05-20T00:00:28Z"},{"alias_kind":"pith_short_16","alias_value":"VV6OED24TWWFGPDX","created_at":"2026-05-20T00:00:28Z"},{"alias_kind":"pith_short_8","alias_value":"VV6OED24","created_at":"2026-05-20T00:00:28Z"}],"graph_snapshots":[{"event_id":"sha256:a96790532420d6872c8d21040357d8beb6a38ceed837d879ca6a54c45e8a4a34","target":"graph","created_at":"2026-05-20T00:00:28Z","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/2511.14482/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Maribel Acosta, Tim Schwabe","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-11-18T13:24:28Z","title":"Gradient-Based Join Ordering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.14482","kind":"arxiv","version":2},"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:500845278a662f0c7c202ddc2f7e7ef1ce8795775e64d8a21e2ac006d7601e39","target":"record","created_at":"2026-05-20T00:00:28Z","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":"680cfdbded51ae53c53720c8f33daa5690a14b769d939d2a8ffbb210615f53c3","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-11-18T13:24:28Z","title_canon_sha256":"b2283f5c48be1ef01be66da6867643737e769a7558046f69add946d40eaea124"},"schema_version":"1.0","source":{"id":"2511.14482","kind":"arxiv","version":2}},"canonical_sha256":"ad7ce20f5c9dac533c777bc298f29354e41ba6562ec2b586fd25b892fcb723cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad7ce20f5c9dac533c777bc298f29354e41ba6562ec2b586fd25b892fcb723cb","first_computed_at":"2026-05-20T00:00:28.083859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:28.083859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0GXw8yWhWVC90WdwKHhs7K7ld3nZsF8VR/c6KgmGRs2UJMsUWgJbd8yYL98XL+WoKJKmcH1F213jv01jVmVZDQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:28.084633Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.14482","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:500845278a662f0c7c202ddc2f7e7ef1ce8795775e64d8a21e2ac006d7601e39","sha256:a96790532420d6872c8d21040357d8beb6a38ceed837d879ca6a54c45e8a4a34"],"state_sha256":"8a6d3af813936a9f7e06e33edb8d3c31c14d0501cf73c65b9fc35620d88f1e16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xmex88XfwZogPvb6kXKRHKaV5E+pMaqLspw11q6efY765b4Ck8owfeiLEL3nno/hereLw5cozJ5C6vrszmU9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:50:51.275576Z","bundle_sha256":"e39b06d204d491bf2bd01afe995b4e0e1477f23623d1c550fb062652dff12da9"}}