{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PAHKPXTC4NZ3TZYMV2YBLULNXB","short_pith_number":"pith:PAHKPXTC","canonical_record":{"source":{"id":"2502.05562","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-08T13:21:34Z","cross_cats_sorted":[],"title_canon_sha256":"3449a8d884835a3f37f51e0584f0b6d7b9925867503503775608dd03613e7c71","abstract_canon_sha256":"f498af48fdae84c6cff8400ac519256dffa496160b9686b42936ed65db95a675"},"schema_version":"1.0"},"canonical_sha256":"780ea7de62e373b9e70caeb015d16db84f9448c6f6a0adf27aa0369b57ce00ce","source":{"kind":"arxiv","id":"2502.05562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05562","created_at":"2026-07-05T10:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05562v1","created_at":"2026-07-05T10:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05562","created_at":"2026-07-05T10:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"PAHKPXTC4NZ3","created_at":"2026-07-05T10:11:40Z"},{"alias_kind":"pith_short_16","alias_value":"PAHKPXTC4NZ3TZYM","created_at":"2026-07-05T10:11:40Z"},{"alias_kind":"pith_short_8","alias_value":"PAHKPXTC","created_at":"2026-07-05T10:11:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PAHKPXTC4NZ3TZYMV2YBLULNXB","target":"record","payload":{"canonical_record":{"source":{"id":"2502.05562","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-08T13:21:34Z","cross_cats_sorted":[],"title_canon_sha256":"3449a8d884835a3f37f51e0584f0b6d7b9925867503503775608dd03613e7c71","abstract_canon_sha256":"f498af48fdae84c6cff8400ac519256dffa496160b9686b42936ed65db95a675"},"schema_version":"1.0"},"canonical_sha256":"780ea7de62e373b9e70caeb015d16db84f9448c6f6a0adf27aa0369b57ce00ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:40.002579Z","signature_b64":"Q4fyFkfMIx05UuIRIufjog0Sz9ShqmBccyUBr1uDRcXyGizfBGizDVQgWuHVenC3vT8cvFAcYNaa3NqPlp3TAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"780ea7de62e373b9e70caeb015d16db84f9448c6f6a0adf27aa0369b57ce00ce","last_reissued_at":"2026-07-05T10:11:40.002110Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:40.002110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.05562","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:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Crpxf3euHc765lEdUGM43Pn2MZHgjTTFfGJ50uZs/vHC64FhjGvMtKaizEDQe9jD8SVUv+Rbusikv8zOcNlIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:52:03.320691Z"},"content_sha256":"0152bf1f851fff1c791c23d0ff331723803828881385b711a1be6415ed249d67","schema_version":"1.0","event_id":"sha256:0152bf1f851fff1c791c23d0ff331723803828881385b711a1be6415ed249d67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PAHKPXTC4NZ3TZYMV2YBLULNXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Can Large Language Models Be Query Optimizer for Relational Databases?","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chengzhi Piao, Deli Zhao, Helen Meng, Hong Cheng, Jeffrey Xu Yu, Jie Tan, Kangfei Zhao, Rui Li, Yu Rong","submitted_at":"2025-02-08T13:21:34Z","abstract_excerpt":"Query optimization, which finds the optimized execution plan for a given query, is a complex planning and decision-making problem within the exponentially growing plan space in database management systems (DBMS). Traditional optimizers heavily rely on a certain cost model constructed by various heuristics and empirical tuning, probably leading to generating suboptimal plans. Recent developments of Large Language Models (LLMs) have demonstrated their potential in solving complex planning and decision-making problems, such as arithmetic and programmatic tasks. In this paper, we try to explore th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05562","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/2502.05562/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:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kly27T/UaySJpC2QTBrv3OybfWfxQn0juEZuLwuSOvbnGkl+qWXHZF5NMsGgrbgxg/2urciVYNpDBxoVegiADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:52:03.321650Z"},"content_sha256":"a7903589556959a737ead427e3e3dbbc0c1e6d5a86f54e730db90e7818420ef6","schema_version":"1.0","event_id":"sha256:a7903589556959a737ead427e3e3dbbc0c1e6d5a86f54e730db90e7818420ef6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAHKPXTC4NZ3TZYMV2YBLULNXB/bundle.json","state_url":"https://pith.science/pith/PAHKPXTC4NZ3TZYMV2YBLULNXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAHKPXTC4NZ3TZYMV2YBLULNXB/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-08T16:52:03Z","links":{"resolver":"https://pith.science/pith/PAHKPXTC4NZ3TZYMV2YBLULNXB","bundle":"https://pith.science/pith/PAHKPXTC4NZ3TZYMV2YBLULNXB/bundle.json","state":"https://pith.science/pith/PAHKPXTC4NZ3TZYMV2YBLULNXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAHKPXTC4NZ3TZYMV2YBLULNXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PAHKPXTC4NZ3TZYMV2YBLULNXB","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":"f498af48fdae84c6cff8400ac519256dffa496160b9686b42936ed65db95a675","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-08T13:21:34Z","title_canon_sha256":"3449a8d884835a3f37f51e0584f0b6d7b9925867503503775608dd03613e7c71"},"schema_version":"1.0","source":{"id":"2502.05562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05562","created_at":"2026-07-05T10:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05562v1","created_at":"2026-07-05T10:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05562","created_at":"2026-07-05T10:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"PAHKPXTC4NZ3","created_at":"2026-07-05T10:11:40Z"},{"alias_kind":"pith_short_16","alias_value":"PAHKPXTC4NZ3TZYM","created_at":"2026-07-05T10:11:40Z"},{"alias_kind":"pith_short_8","alias_value":"PAHKPXTC","created_at":"2026-07-05T10:11:40Z"}],"graph_snapshots":[{"event_id":"sha256:a7903589556959a737ead427e3e3dbbc0c1e6d5a86f54e730db90e7818420ef6","target":"graph","created_at":"2026-07-05T10:11:40Z","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/2502.05562/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Query optimization, which finds the optimized execution plan for a given query, is a complex planning and decision-making problem within the exponentially growing plan space in database management systems (DBMS). Traditional optimizers heavily rely on a certain cost model constructed by various heuristics and empirical tuning, probably leading to generating suboptimal plans. Recent developments of Large Language Models (LLMs) have demonstrated their potential in solving complex planning and decision-making problems, such as arithmetic and programmatic tasks. In this paper, we try to explore th","authors_text":"Chengzhi Piao, Deli Zhao, Helen Meng, Hong Cheng, Jeffrey Xu Yu, Jie Tan, Kangfei Zhao, Rui Li, Yu Rong","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-08T13:21:34Z","title":"Can Large Language Models Be Query Optimizer for Relational Databases?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05562","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:0152bf1f851fff1c791c23d0ff331723803828881385b711a1be6415ed249d67","target":"record","created_at":"2026-07-05T10:11:40Z","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":"f498af48fdae84c6cff8400ac519256dffa496160b9686b42936ed65db95a675","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-08T13:21:34Z","title_canon_sha256":"3449a8d884835a3f37f51e0584f0b6d7b9925867503503775608dd03613e7c71"},"schema_version":"1.0","source":{"id":"2502.05562","kind":"arxiv","version":1}},"canonical_sha256":"780ea7de62e373b9e70caeb015d16db84f9448c6f6a0adf27aa0369b57ce00ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"780ea7de62e373b9e70caeb015d16db84f9448c6f6a0adf27aa0369b57ce00ce","first_computed_at":"2026-07-05T10:11:40.002110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:40.002110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q4fyFkfMIx05UuIRIufjog0Sz9ShqmBccyUBr1uDRcXyGizfBGizDVQgWuHVenC3vT8cvFAcYNaa3NqPlp3TAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:40.002579Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.05562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0152bf1f851fff1c791c23d0ff331723803828881385b711a1be6415ed249d67","sha256:a7903589556959a737ead427e3e3dbbc0c1e6d5a86f54e730db90e7818420ef6"],"state_sha256":"496be5a08b9e362df2e3693ca90c6f3019cc736a6c4923267f221c88db3e55c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gWjHm06HN6SY5alolhuG57/2FtFS7BHktUdedGmQhLGQBi/X6bcleyBfLgX/uMXC7bIMFGB9JSbBmYJqnYKvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T16:52:03.328097Z","bundle_sha256":"ddf7339a2c8138835a8d57637ed0004ee6d81bef8f1b155c867612a840c28adb"}}