{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WZAS4CNA7CQJ4VMEGLTMWCGQPD","short_pith_number":"pith:WZAS4CNA","canonical_record":{"source":{"id":"2401.15210","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-01-26T21:16:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d04f4f63162ca51e01894664b8f92e72c73ae281ef7e36f91347bad68e7f17aa","abstract_canon_sha256":"8f554ab326c021d4dc327e736dfb363a162a799cc07ca5321aeab291d8b4a4e0"},"schema_version":"1.0"},"canonical_sha256":"b6412e09a0f8a09e558432e6cb08d078c065f560f9cfbc5429561bd04d6ba99f","source":{"kind":"arxiv","id":"2401.15210","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.15210","created_at":"2026-07-05T11:08:56Z"},{"alias_kind":"arxiv_version","alias_value":"2401.15210v3","created_at":"2026-07-05T11:08:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15210","created_at":"2026-07-05T11:08:56Z"},{"alias_kind":"pith_short_12","alias_value":"WZAS4CNA7CQJ","created_at":"2026-07-05T11:08:56Z"},{"alias_kind":"pith_short_16","alias_value":"WZAS4CNA7CQJ4VME","created_at":"2026-07-05T11:08:56Z"},{"alias_kind":"pith_short_8","alias_value":"WZAS4CNA","created_at":"2026-07-05T11:08:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WZAS4CNA7CQJ4VMEGLTMWCGQPD","target":"record","payload":{"canonical_record":{"source":{"id":"2401.15210","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-01-26T21:16:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d04f4f63162ca51e01894664b8f92e72c73ae281ef7e36f91347bad68e7f17aa","abstract_canon_sha256":"8f554ab326c021d4dc327e736dfb363a162a799cc07ca5321aeab291d8b4a4e0"},"schema_version":"1.0"},"canonical_sha256":"b6412e09a0f8a09e558432e6cb08d078c065f560f9cfbc5429561bd04d6ba99f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:56.184595Z","signature_b64":"fb/rChZgvU7onZf0ADivdNoawkVGZhoyhCt+nYhhtV74gX1jLzW/p9zAYciwmNJasi5GYdkB+ZXUc8UiLz8ZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6412e09a0f8a09e558432e6cb08d078c065f560f9cfbc5429561bd04d6ba99f","last_reissued_at":"2026-07-05T11:08:56.184112Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:56.184112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.15210","source_version":3,"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-07-05T11:08:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JtYu1wpRW02mRPGZf2m1LdYNPmaOvrehYrObXrFybflSgZ7VXobXE5GUGLpOu59MZPBBAJhTGOBPgguZGUMfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:53:54.920558Z"},"content_sha256":"950cef488d9246d1cdae866747691427da5b167dafe264a44ea014978442ae5a","schema_version":"1.0","event_id":"sha256:950cef488d9246d1cdae866747691427da5b167dafe264a44ea014978442ae5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WZAS4CNA7CQJ4VMEGLTMWCGQPD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Plan Evaluation based on Approximate Probabilistic Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Amin Kamali, Calisto Zuzarte, Verena Kantere, Vincent Corvinelli","submitted_at":"2024-01-26T21:16:37Z","abstract_excerpt":"Query optimizers in RDBMSs search for execution plans expected to be optimal for given queries. They use parameter estimates, often inaccurate, and make assumptions that may not hold in practice. Consequently, they may select plans that are suboptimal at runtime if estimates and assumptions are not valid. Therefore, they do not sufficiently support robust query optimization. Using ML to improve data systems has shown promising results for query optimization. Inspired by this, we propose Robust Query Optimizer (Roq), a holistic framework based on a risk-aware learning approach. Roq includes a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15210","kind":"arxiv","version":3},"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/2401.15210/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-07-05T11:08:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKe6gax9tCJAUgrl3IEBZ1QXTBXcx08qIe9QtsEVeBg1eOciRynC/WXmlCo4aochBkrSr4MRkbo8CpSjybU+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:53:54.921548Z"},"content_sha256":"5311360a163ffb7f4b7cffda8724ebc7f7fc31655dbc224ab68cd0a00ac0fb81","schema_version":"1.0","event_id":"sha256:5311360a163ffb7f4b7cffda8724ebc7f7fc31655dbc224ab68cd0a00ac0fb81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZAS4CNA7CQJ4VMEGLTMWCGQPD/bundle.json","state_url":"https://pith.science/pith/WZAS4CNA7CQJ4VMEGLTMWCGQPD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZAS4CNA7CQJ4VMEGLTMWCGQPD/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-08-10T05:53:54Z","links":{"resolver":"https://pith.science/pith/WZAS4CNA7CQJ4VMEGLTMWCGQPD","bundle":"https://pith.science/pith/WZAS4CNA7CQJ4VMEGLTMWCGQPD/bundle.json","state":"https://pith.science/pith/WZAS4CNA7CQJ4VMEGLTMWCGQPD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZAS4CNA7CQJ4VMEGLTMWCGQPD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WZAS4CNA7CQJ4VMEGLTMWCGQPD","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":"8f554ab326c021d4dc327e736dfb363a162a799cc07ca5321aeab291d8b4a4e0","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-01-26T21:16:37Z","title_canon_sha256":"d04f4f63162ca51e01894664b8f92e72c73ae281ef7e36f91347bad68e7f17aa"},"schema_version":"1.0","source":{"id":"2401.15210","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.15210","created_at":"2026-07-05T11:08:56Z"},{"alias_kind":"arxiv_version","alias_value":"2401.15210v3","created_at":"2026-07-05T11:08:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15210","created_at":"2026-07-05T11:08:56Z"},{"alias_kind":"pith_short_12","alias_value":"WZAS4CNA7CQJ","created_at":"2026-07-05T11:08:56Z"},{"alias_kind":"pith_short_16","alias_value":"WZAS4CNA7CQJ4VME","created_at":"2026-07-05T11:08:56Z"},{"alias_kind":"pith_short_8","alias_value":"WZAS4CNA","created_at":"2026-07-05T11:08:56Z"}],"graph_snapshots":[{"event_id":"sha256:5311360a163ffb7f4b7cffda8724ebc7f7fc31655dbc224ab68cd0a00ac0fb81","target":"graph","created_at":"2026-07-05T11:08:56Z","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/2401.15210/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Query optimizers in RDBMSs search for execution plans expected to be optimal for given queries. They use parameter estimates, often inaccurate, and make assumptions that may not hold in practice. Consequently, they may select plans that are suboptimal at runtime if estimates and assumptions are not valid. Therefore, they do not sufficiently support robust query optimization. Using ML to improve data systems has shown promising results for query optimization. Inspired by this, we propose Robust Query Optimizer (Roq), a holistic framework based on a risk-aware learning approach. Roq includes a n","authors_text":"Amin Kamali, Calisto Zuzarte, Verena Kantere, Vincent Corvinelli","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-01-26T21:16:37Z","title":"Robust Plan Evaluation based on Approximate Probabilistic Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15210","kind":"arxiv","version":3},"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:950cef488d9246d1cdae866747691427da5b167dafe264a44ea014978442ae5a","target":"record","created_at":"2026-07-05T11:08:56Z","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":"8f554ab326c021d4dc327e736dfb363a162a799cc07ca5321aeab291d8b4a4e0","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-01-26T21:16:37Z","title_canon_sha256":"d04f4f63162ca51e01894664b8f92e72c73ae281ef7e36f91347bad68e7f17aa"},"schema_version":"1.0","source":{"id":"2401.15210","kind":"arxiv","version":3}},"canonical_sha256":"b6412e09a0f8a09e558432e6cb08d078c065f560f9cfbc5429561bd04d6ba99f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6412e09a0f8a09e558432e6cb08d078c065f560f9cfbc5429561bd04d6ba99f","first_computed_at":"2026-07-05T11:08:56.184112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:56.184112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fb/rChZgvU7onZf0ADivdNoawkVGZhoyhCt+nYhhtV74gX1jLzW/p9zAYciwmNJasi5GYdkB+ZXUc8UiLz8ZAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:56.184595Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.15210","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:950cef488d9246d1cdae866747691427da5b167dafe264a44ea014978442ae5a","sha256:5311360a163ffb7f4b7cffda8724ebc7f7fc31655dbc224ab68cd0a00ac0fb81"],"state_sha256":"92e4b6b94cc13cee4efbc7b599fd1165a6d59bc0e77cd4d1722e9f4c75a20f7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5aGp+9KTL1e+tvg+WdzP/VHNyoW3LRgwTw2pzU9h2algCcAOVN6pyxs0ZZpF0Fl7a3EnvzKd1Dy5M+igh0JBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T05:53:54.944348Z","bundle_sha256":"8ec450a9a4a7521f71ec19c3edfa9f7680562b10a7ab9f891419855f70c7f3b9"}}