{"as_of":"2026-08-11T03:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b52d63f4c9b7848833bd5c47bc7c4f07b2a00d53976cbbc4188ccb456a7ffce0","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T22:03:18.907212Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T04:44:56.826859Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-10T11:50:21.209425Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"cited_work":{"arxiv_id":"2501.18916","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.18916","snapshot_observed_at":"2026-06-25T01:17:43.956564Z","title":"LLM Program Optimization via Retrieval Augmented Search","venue":null,"work_id":"aa3af7ad-f7a8-4c38-a8c5-9a882ea94443","year":2025},"citing_paper":{"arxiv_id":"2604.18026","last_updated":"2026-04-20T09:52:36Z","snapshot_observed_at":"2026-07-06T23:04:59.629739Z","submitted_at":"2026-04-20T09:52:36Z","title":"RASP-Tuner: Retrieval-Augmented Soft Prompts for Context-Aware Black-Box Optimization in Non-Stationary Environments","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-10T04:44:56.826859Z"},"links":{"cited_paper":"/paper/2501.18916","citing_paper":"/paper/2604.18026"},"observation_digest":"sha256:f0778aa7229d1beafb88387745b08c6b02ae41348fd4ff0672926817b390de1a","observation_id":"77a1e867-5a3b-45f6-ba72-b91cddabb8a8","resolution":{"observed_at":"2026-06-25T01:17:43.956564Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.18916/citation-record","integrity":"/paper/2501.18916/integrity","json":"/paper/2501.18916/citation-record.json","paper":"/paper/2501.18916"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:18.804718Z","title":"Contextual retrieval","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.804718Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:c275a44206ad71d0e9802c16c4a60eb4d03d35edab4db3203bd267aebc2632cc","observation_id":"dd292d93-54e9-45e4-a2de-984c2f3d73ea","resolution":{"observed_at":"2026-08-09T22:03:18.804718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:19.316270Z","title":"K., Saidi, A., Basu, A., Hestness, J., Hower, D","venue":null,"work_id":"69085393-4d85-43eb-acf6-258002434ad2","year":2011},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.810814Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:9ee3ab74d4091dd7fb4b0e2a1573f590c954580664d7219749f764b254433282","observation_id":"b3bb0666-2c56-46d7-abc8-74e7a5a0ce83","resolution":{"observed_at":"2026-08-09T22:03:19.321325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:18.816343Z","title":"D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.816343Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:73f5bdd96e8d6a8fbea4a5225a8265e036b658c64d8977d01588080a73bb49ae","observation_id":"efa12349-0762-42e2-a024-8c95314962e8","resolution":{"observed_at":"2026-08-09T22:03:18.816343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-09T22:03:18.821704Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.821704Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:0a618a66321111d4ab0e2c3f1ddde50993d6d35fa65a96b73f43c49d261f7d9f","observation_id":"89c9b634-7639-44d9-8b95-b2f1157c2cad","resolution":{"observed_at":"2026-08-09T22:03:18.821704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08281","last_updated":"2025-10-23T09:36:08Z","snapshot_observed_at":"2026-07-31T05:45:37.385210Z","submitted_at":"2024-01-16T11:12:36Z","title":"The Faiss library","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08281","snapshot_observed_at":"2026-08-09T22:03:18.827684Z","title":"The faiss library","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.827684Z"},"links":{"cited_paper":"/paper/2401.08281","citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:fe87955d712d9ff210bbb46b7861a38e1f174d525ffbbe1fc2cbf439f561ce0e","observation_id":"b5ced890-80c2-4a48-bf1a-1ec2f01277e9","resolution":{"observed_at":"2026-08-09T22:03:18.827684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:19.289879Z","title":"Search-based llms for code optimization","venue":null,"work_id":"afb32731-d48a-4891-a876-c5c43d81c2bc","year":2025},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.833198Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:ae7f6c40db981478211d035757bd9f8ab670c863e690225021efa136b2b9e0f0","observation_id":"1ab2c086-ece5-4880-b20b-7a5cfea7354c","resolution":{"observed_at":"2026-08-09T22:03:19.295239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:19.274302Z","title":"Deep code search","venue":null,"work_id":"be1cb63a-3cc1-4586-a01d-5618a8ca15fd","year":2018},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.839371Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:466b1d48b5f7c463f289ee4f810d1f5c2407623eef4428e7e0f920233fcb1f1b","observation_id":"97f1d4d0-1c08-454e-a2a1-44fbb92aa5de","resolution":{"observed_at":"2026-08-09T22:03:19.279477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:18.843933Z","title":"A., Ali, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.843933Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:535c62d8fbc2e0f75a3f001a7e474660ac5a656297fb346232ab46f689625166","observation_id":"f09f8077-7330-49b7-83dc-412e1e1e93fe","resolution":{"observed_at":"2026-08-09T22:03:18.843933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.00655","last_updated":"2024-12-31T21:47:46Z","snapshot_observed_at":"2026-08-10T22:43:28.805302Z","submitted_at":"2024-12-31T21:47:46Z","title":"Finding Missed Code Size Optimizations in Compilers using LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.00655","snapshot_observed_at":"2026-08-09T22:03:18.849179Z","title":"and Cummins, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.849179Z"},"links":{"cited_paper":"/paper/2501.00655","citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:f981636ebb96036063ef8199bb6ddbe4f60c272de94af09d00befdcb4ce1d2c3","observation_id":"1dde5453-edc8-484a-9457-f2c79609a716","resolution":{"observed_at":"2026-08-09T22:03:18.849179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:18.854548Z","title":"u ttler, H., Lewis, M., Yih, W.-t., Rockt \\","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.854548Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:6fbc1f40891fb410471ada4545108ab9b38a73486888943d1c3d9642705d4801","observation_id":"ab78c3e3-ea17-45d9-bd17-3acc7d5ef954","resolution":{"observed_at":"2026-08-09T22:03:18.854548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:18.859246Z","title":"Competition-level code generation with alphacode","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.859246Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:8c61d3f6bbc614d740cd59d3534b984a0a1b93ef750c1ac9c307f4a5763d40d0","observation_id":"bdbd4854-9081-4db0-81f4-3152ef43e6e9","resolution":{"observed_at":"2026-08-09T22:03:18.859246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:19.235970Z","title":"Portfolio: finding relevant functions and their usage","venue":null,"work_id":"e233b87e-9635-4a01-9a9b-dbc44ef9e786","year":2011},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.863680Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:60ec03dbea59defa0032fea97ca8d9edd47fb996cae68fc20a1b1be723a4703b","observation_id":"b127c923-c2fb-4e63-82bc-a8f11af69173","resolution":{"observed_at":"2026-08-09T22:03:19.241091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:19.221016Z","title":"Reframing instructional prompts to gptk’s language","venue":null,"work_id":"011dba2a-44de-434d-a27d-6c5484b4157c","year":2022},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.868428Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:558fefaa4e8dcf2baeba6db46361ff92dd830d3be1d93c03ca0f8a91ecf34bfb","observation_id":"15ae2e7f-35ca-4405-86b1-beb771674768","resolution":{"observed_at":"2026-08-09T22:03:19.225702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:19.205098Z","title":"Synchromesh: Reliable code generation from pre-trained language models","venue":null,"work_id":"ad3a6843-7e32-438f-bd87-1ab2ac79b4b4","year":2022},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.873370Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:322b34c16ea2dfa584859a8b380ecc72c80c4ff3936ad7f61a6ad17e0153a7f9","observation_id":"b5f92e3c-0934-4878-8bab-d8935978671d","resolution":{"observed_at":"2026-08-09T22:03:19.210038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:19.189001Z","title":"Codenet: A large-scale ai for code dataset for learning a diversity of coding tasks, 2021","venue":null,"work_id":"93df79a4-7748-475a-a703-19826d096781","year":2021},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.878084Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:d562984b526eca1c672bd45101124324487847db057b4f459132a45fe7e98496","observation_id":"582a1986-b747-4697-a9b1-fdd8f66e5eda","resolution":{"observed_at":"2026-08-09T22:03:19.194977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:19.173161Z","title":"W., Tong, H., Ezick, J., and Lott, C","venue":null,"work_id":"43d44267-aaec-4997-8284-698b77fa7e65","year":2025},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.882933Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:7417cdc598c9d00f9e1d4d4d40562343f5502a4e3003fa65708ddc23ff5b66de","observation_id":"610f222a-ab82-4d46-a821-dd263b6d7717","resolution":{"observed_at":"2026-08-09T22:03:19.178468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:18.887517Z","title":"R., Yang, Y., Hashemi, M., Neubig, G., Ranganathan, P., Bastani, O., and Yazdanbakhsh, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.887517Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:530966b7d501f0199cb6a4db08c3aeabf10556a1c3891d7c1ef80bf04191e36b","observation_id":"dfb0e7c3-60d5-4bc3-afe9-64ccd2643934","resolution":{"observed_at":"2026-08-09T22:03:18.887517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14497","last_updated":"2025-02-26T22:10:36Z","snapshot_observed_at":"2026-07-06T18:34:24.078145Z","submitted_at":"2024-06-20T16:59:52Z","title":"CodeRAG-Bench: Can Retrieval Augment Code Generation?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14497","snapshot_observed_at":"2026-08-09T22:03:18.891937Z","title":"Z., Asai, A., Yu, X","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.891937Z"},"links":{"cited_paper":"/paper/2406.14497","citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:1c47d8150656580a946b4fddcb82b54ae66828da64aa33703acd2f503e1c8fa4","observation_id":"fee4ddec-fce2-4ea5-9df4-763dddb7e91f","resolution":{"observed_at":"2026-08-09T22:03:18.891937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:18.897488Z","title":"V., Zhou, D., et al","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.897488Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:bf4907a774e7b2705e05e313de7381d58a04eb2b5e60a5199c51519d5f0e0ded","observation_id":"7ffb903f-d393-42c1-af36-d14b69cc6516","resolution":{"observed_at":"2026-08-09T22:03:18.897488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:19.134658Z","title":"R., and Sun, H","venue":null,"work_id":"11e589a7-a5ab-4511-ac99-f7e146869230","year":2019},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.902297Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:00767f5fe88f0a4d723842d3b812adebd7420817635886931838cb41e482f803","observation_id":"9da5dac8-1dd6-4d88-9a9f-e263af2a8a92","resolution":{"observed_at":"2026-08-09T22:03:19.140257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T22:03:18.907212Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T22:03:18.907212Z"},"links":{"citing_paper":"/paper/2501.18916"},"observation_digest":"sha256:b6c1ba5591b61cba5edfede75a13c714c49085043500bbab8233dd7675ab4e9c","observation_id":"fa1ef6dd-fe98-4b84-8779-488c5cda6fc8","resolution":{"observed_at":"2026-08-09T22:03:18.907212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.18916","last_updated":"2026-06-23T21:39:56Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T21:55:23.187648Z","submitted_at":"2025-01-31T06:34:47Z","title":"LLM Program Optimization via Retrieval Augmented Search"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":21},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 1 inbound Pith citation observation for arXiv:2501.18916."}