{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PK6BMPALIRX74WMJC32CS3WO7C","short_pith_number":"pith:PK6BMPAL","canonical_record":{"source":{"id":"2504.06399","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-08T19:41:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ffe9f1b9e3c7b8d21eea924d4bc62d7171733aea2dacc90ee1ed6de572f58a9b","abstract_canon_sha256":"79dbf82357416239484229bf182f816eb48ec8d0db07f7f2f602ea906f978872"},"schema_version":"1.0"},"canonical_sha256":"7abc163c0b446ffe598916f4296ecef8850a17fdc208e695b2b3b66c81aeca08","source":{"kind":"arxiv","id":"2504.06399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.06399","created_at":"2026-07-05T10:46:26Z"},{"alias_kind":"arxiv_version","alias_value":"2504.06399v1","created_at":"2026-07-05T10:46:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.06399","created_at":"2026-07-05T10:46:26Z"},{"alias_kind":"pith_short_12","alias_value":"PK6BMPALIRX7","created_at":"2026-07-05T10:46:26Z"},{"alias_kind":"pith_short_16","alias_value":"PK6BMPALIRX74WMJ","created_at":"2026-07-05T10:46:26Z"},{"alias_kind":"pith_short_8","alias_value":"PK6BMPAL","created_at":"2026-07-05T10:46:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PK6BMPALIRX74WMJC32CS3WO7C","target":"record","payload":{"canonical_record":{"source":{"id":"2504.06399","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-08T19:41:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ffe9f1b9e3c7b8d21eea924d4bc62d7171733aea2dacc90ee1ed6de572f58a9b","abstract_canon_sha256":"79dbf82357416239484229bf182f816eb48ec8d0db07f7f2f602ea906f978872"},"schema_version":"1.0"},"canonical_sha256":"7abc163c0b446ffe598916f4296ecef8850a17fdc208e695b2b3b66c81aeca08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:26.208415Z","signature_b64":"8XXlArvmTIu74jHBtK+uNklaaHGWM6csbwYusfY/cskmnj6izzmNLfeLBqFKpCzFlyP0fkZKhNJSqo2AZDuDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7abc163c0b446ffe598916f4296ecef8850a17fdc208e695b2b3b66c81aeca08","last_reissued_at":"2026-07-05T10:46:26.207989Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:26.207989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.06399","source_version":1,"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-05T10:46:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CuyL59ryTgQxMjbAgMKMwrhRpXCfjfP1kEpU6B3B5eJH/fXhaoc6PhqyqVX27XHaXFpaDrpxSgZO85MG6xbtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:14:06.484937Z"},"content_sha256":"e447b2a6b6a64b839b6f2f84c081ce7796933c461b1841efefeda24a2dddde60","schema_version":"1.0","event_id":"sha256:e447b2a6b6a64b839b6f2f84c081ce7796933c461b1841efefeda24a2dddde60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PK6BMPALIRX74WMJC32CS3WO7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Rank Learning for Offline Query Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Ryan Marcus, Yao Tian, Zachary G. Ives, Zixuan Yi","submitted_at":"2025-04-08T19:41:19Z","abstract_excerpt":"Recent deployments of learned query optimizers use expensive neural networks and ad-hoc search policies. To address these issues, we introduce \\textsc{LimeQO}, a framework for offline query optimization leveraging low-rank learning to efficiently explore alternative query plans with minimal resource usage. By modeling the workload as a partially observed, low-rank matrix, we predict unobserved query plan latencies using purely linear methods, significantly reducing computational overhead compared to neural networks. We formalize offline exploration as an active learning problem, and present si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.06399","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/2504.06399/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-05T10:46:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOgtHG+XNTCLme3kSGvnDDvJA20xpDV7Z6Wd2j0WUGAtJrvv94e0zRD4qBNq6HP0h75TBsQxb6ueRTelZgJuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:14:06.485447Z"},"content_sha256":"8b31594870a0d1e67148ee98b5ebdecb6664a56da746a470aad17c071359e618","schema_version":"1.0","event_id":"sha256:8b31594870a0d1e67148ee98b5ebdecb6664a56da746a470aad17c071359e618"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PK6BMPALIRX74WMJC32CS3WO7C/bundle.json","state_url":"https://pith.science/pith/PK6BMPALIRX74WMJC32CS3WO7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PK6BMPALIRX74WMJC32CS3WO7C/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-23T13:14:06Z","links":{"resolver":"https://pith.science/pith/PK6BMPALIRX74WMJC32CS3WO7C","bundle":"https://pith.science/pith/PK6BMPALIRX74WMJC32CS3WO7C/bundle.json","state":"https://pith.science/pith/PK6BMPALIRX74WMJC32CS3WO7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PK6BMPALIRX74WMJC32CS3WO7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PK6BMPALIRX74WMJC32CS3WO7C","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":"79dbf82357416239484229bf182f816eb48ec8d0db07f7f2f602ea906f978872","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-08T19:41:19Z","title_canon_sha256":"ffe9f1b9e3c7b8d21eea924d4bc62d7171733aea2dacc90ee1ed6de572f58a9b"},"schema_version":"1.0","source":{"id":"2504.06399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.06399","created_at":"2026-07-05T10:46:26Z"},{"alias_kind":"arxiv_version","alias_value":"2504.06399v1","created_at":"2026-07-05T10:46:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.06399","created_at":"2026-07-05T10:46:26Z"},{"alias_kind":"pith_short_12","alias_value":"PK6BMPALIRX7","created_at":"2026-07-05T10:46:26Z"},{"alias_kind":"pith_short_16","alias_value":"PK6BMPALIRX74WMJ","created_at":"2026-07-05T10:46:26Z"},{"alias_kind":"pith_short_8","alias_value":"PK6BMPAL","created_at":"2026-07-05T10:46:26Z"}],"graph_snapshots":[{"event_id":"sha256:8b31594870a0d1e67148ee98b5ebdecb6664a56da746a470aad17c071359e618","target":"graph","created_at":"2026-07-05T10:46:26Z","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/2504.06399/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent deployments of learned query optimizers use expensive neural networks and ad-hoc search policies. To address these issues, we introduce \\textsc{LimeQO}, a framework for offline query optimization leveraging low-rank learning to efficiently explore alternative query plans with minimal resource usage. By modeling the workload as a partially observed, low-rank matrix, we predict unobserved query plan latencies using purely linear methods, significantly reducing computational overhead compared to neural networks. We formalize offline exploration as an active learning problem, and present si","authors_text":"Ryan Marcus, Yao Tian, Zachary G. Ives, Zixuan Yi","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-08T19:41:19Z","title":"Low Rank Learning for Offline Query Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.06399","kind":"arxiv","version":1},"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:e447b2a6b6a64b839b6f2f84c081ce7796933c461b1841efefeda24a2dddde60","target":"record","created_at":"2026-07-05T10:46:26Z","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":"79dbf82357416239484229bf182f816eb48ec8d0db07f7f2f602ea906f978872","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-08T19:41:19Z","title_canon_sha256":"ffe9f1b9e3c7b8d21eea924d4bc62d7171733aea2dacc90ee1ed6de572f58a9b"},"schema_version":"1.0","source":{"id":"2504.06399","kind":"arxiv","version":1}},"canonical_sha256":"7abc163c0b446ffe598916f4296ecef8850a17fdc208e695b2b3b66c81aeca08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7abc163c0b446ffe598916f4296ecef8850a17fdc208e695b2b3b66c81aeca08","first_computed_at":"2026-07-05T10:46:26.207989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:46:26.207989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8XXlArvmTIu74jHBtK+uNklaaHGWM6csbwYusfY/cskmnj6izzmNLfeLBqFKpCzFlyP0fkZKhNJSqo2AZDuDCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:46:26.208415Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.06399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e447b2a6b6a64b839b6f2f84c081ce7796933c461b1841efefeda24a2dddde60","sha256:8b31594870a0d1e67148ee98b5ebdecb6664a56da746a470aad17c071359e618"],"state_sha256":"9022787b60eba5d841932d9b189541b39cb8d48b7f42f8e548a0ebbe0b0ab36e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bVIJFt/REjUL56G0ax/NqUgMNrmLsc6O1wb6dN6HVN7Yl+K48obNOT2MX0mJ4VY0HFBJ+H1RJQEnUkQ1vQYYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T13:14:06.490121Z","bundle_sha256":"edff308183cab3fcd16592eee93917b6fd47c66a0d8635aafc49753d00277f37"}}