{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MYKVBL4QQOM3PBO5SLGFFBLJYI","short_pith_number":"pith:MYKVBL4Q","canonical_record":{"source":{"id":"2501.18916","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T06:34:47Z","cross_cats_sorted":[],"title_canon_sha256":"9c8e5b5e71b6057201ad7205584fa536956df599ec0c24bfa85602334e47bd46","abstract_canon_sha256":"8c71f8c9337004ea747c4ea3f835dbfa95f8d4f559c6e54fbe123940bbadb769"},"schema_version":"1.0"},"canonical_sha256":"661550af908399b785dd92cc528569c208c53c71f8e54fa7931b4c1f68634a8a","source":{"kind":"arxiv","id":"2501.18916","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.18916","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"2501.18916v2","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18916","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"MYKVBL4QQOM3","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_16","alias_value":"MYKVBL4QQOM3PBO5","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_8","alias_value":"MYKVBL4Q","created_at":"2026-06-25T00:18:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MYKVBL4QQOM3PBO5SLGFFBLJYI","target":"record","payload":{"canonical_record":{"source":{"id":"2501.18916","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T06:34:47Z","cross_cats_sorted":[],"title_canon_sha256":"9c8e5b5e71b6057201ad7205584fa536956df599ec0c24bfa85602334e47bd46","abstract_canon_sha256":"8c71f8c9337004ea747c4ea3f835dbfa95f8d4f559c6e54fbe123940bbadb769"},"schema_version":"1.0"},"canonical_sha256":"661550af908399b785dd92cc528569c208c53c71f8e54fa7931b4c1f68634a8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T00:18:10.900636Z","signature_b64":"A/ShDeqz4pXUZIfK8To8GoPjlzCXGbyVI9lstodAkDQ02za0XqcjgBq50n1VACmOLRDmqwbkAShY4JYjJ2uQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"661550af908399b785dd92cc528569c208c53c71f8e54fa7931b4c1f68634a8a","last_reissued_at":"2026-06-25T00:18:10.900140Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T00:18:10.900140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.18916","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-06-25T00:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52yz1IAyHlThIKHmKQzYbYLfFBBgJu/FQwlwjjN4D+T1xYKD6T1B7OgF1l1DoJqvD48JinCTpq0tdnbVy5sLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:47:19.511031Z"},"content_sha256":"41d7d4efeb8b6c95f9f3e128d6711e0eff64992631efdc8ca9ac3b3c24757a5a","schema_version":"1.0","event_id":"sha256:41d7d4efeb8b6c95f9f3e128d6711e0eff64992631efdc8ca9ac3b3c24757a5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MYKVBL4QQOM3PBO5SLGFFBLJYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LLM Program Optimization via Retrieval Augmented Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexander Shypula, Osbert Bastani, Sagnik Anupam","submitted_at":"2025-01-31T06:34:47Z","abstract_excerpt":"Recent work has demonstrated the potential of large language models (LLMs) for program optimization, a key challenge in programming languages. We propose a blackbox adaptation method called Retrieval Augmented Search (RAS) that performs beam search over candidate optimizations; at each step, it retrieves in-context examples from a given training dataset of slow-fast program pairs to guide the LLM. Critically, we find that performing contextual retrieval based on an LLM-generated natural language description significantly outperforms retrieval based on the source code. We also propose AEGIS, a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18916","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/2501.18916/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-06-25T00:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jR2mKTjQobwJgzAqGqnPizAe2LLUfD8HJ1rLDwpWbO9DUAzcEt5UCKtd9HCP6H3S+ggvd5phvh3mxbBtK6WoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:47:19.511929Z"},"content_sha256":"78a618eaec8b3ad3cbc494965429b169aca0e80e700989f6d958d94fbe00f816","schema_version":"1.0","event_id":"sha256:78a618eaec8b3ad3cbc494965429b169aca0e80e700989f6d958d94fbe00f816"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYKVBL4QQOM3PBO5SLGFFBLJYI/bundle.json","state_url":"https://pith.science/pith/MYKVBL4QQOM3PBO5SLGFFBLJYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYKVBL4QQOM3PBO5SLGFFBLJYI/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-11T01:47:19Z","links":{"resolver":"https://pith.science/pith/MYKVBL4QQOM3PBO5SLGFFBLJYI","bundle":"https://pith.science/pith/MYKVBL4QQOM3PBO5SLGFFBLJYI/bundle.json","state":"https://pith.science/pith/MYKVBL4QQOM3PBO5SLGFFBLJYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYKVBL4QQOM3PBO5SLGFFBLJYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MYKVBL4QQOM3PBO5SLGFFBLJYI","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":"8c71f8c9337004ea747c4ea3f835dbfa95f8d4f559c6e54fbe123940bbadb769","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T06:34:47Z","title_canon_sha256":"9c8e5b5e71b6057201ad7205584fa536956df599ec0c24bfa85602334e47bd46"},"schema_version":"1.0","source":{"id":"2501.18916","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.18916","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"2501.18916v2","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18916","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"MYKVBL4QQOM3","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_16","alias_value":"MYKVBL4QQOM3PBO5","created_at":"2026-06-25T00:18:10Z"},{"alias_kind":"pith_short_8","alias_value":"MYKVBL4Q","created_at":"2026-06-25T00:18:10Z"}],"graph_snapshots":[{"event_id":"sha256:78a618eaec8b3ad3cbc494965429b169aca0e80e700989f6d958d94fbe00f816","target":"graph","created_at":"2026-06-25T00:18:10Z","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/2501.18916/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent work has demonstrated the potential of large language models (LLMs) for program optimization, a key challenge in programming languages. We propose a blackbox adaptation method called Retrieval Augmented Search (RAS) that performs beam search over candidate optimizations; at each step, it retrieves in-context examples from a given training dataset of slow-fast program pairs to guide the LLM. Critically, we find that performing contextual retrieval based on an LLM-generated natural language description significantly outperforms retrieval based on the source code. We also propose AEGIS, a ","authors_text":"Alexander Shypula, Osbert Bastani, Sagnik Anupam","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18916","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:41d7d4efeb8b6c95f9f3e128d6711e0eff64992631efdc8ca9ac3b3c24757a5a","target":"record","created_at":"2026-06-25T00:18:10Z","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":"8c71f8c9337004ea747c4ea3f835dbfa95f8d4f559c6e54fbe123940bbadb769","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T06:34:47Z","title_canon_sha256":"9c8e5b5e71b6057201ad7205584fa536956df599ec0c24bfa85602334e47bd46"},"schema_version":"1.0","source":{"id":"2501.18916","kind":"arxiv","version":2}},"canonical_sha256":"661550af908399b785dd92cc528569c208c53c71f8e54fa7931b4c1f68634a8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"661550af908399b785dd92cc528569c208c53c71f8e54fa7931b4c1f68634a8a","first_computed_at":"2026-06-25T00:18:10.900140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T00:18:10.900140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A/ShDeqz4pXUZIfK8To8GoPjlzCXGbyVI9lstodAkDQ02za0XqcjgBq50n1VACmOLRDmqwbkAShY4JYjJ2uQCA==","signature_status":"signed_v1","signed_at":"2026-06-25T00:18:10.900636Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.18916","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41d7d4efeb8b6c95f9f3e128d6711e0eff64992631efdc8ca9ac3b3c24757a5a","sha256:78a618eaec8b3ad3cbc494965429b169aca0e80e700989f6d958d94fbe00f816"],"state_sha256":"53239f691130d51a86a20eee0eb9d00f835dfc54529893a060655c9a27f9558c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULw4FNxMftbSaPKF2s1Nk0RxZ5v7CEflMl2/9cq9JvAgM8kynb/B1XjveUb/TdE6wGR8qUPJo3BwCQt8FFOBCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:47:19.525783Z","bundle_sha256":"56d3781a9a93475b05b04b3c371ffc01eadb6bf1f8cbb8bad0c01dffe4625b3c"}}