{"as_of":"2026-08-06T18:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:167c71254ef6f07cd1407e9b6b0ccce62a779d5b6e6c1d834316d2612b39eeb6","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T17:49:46.383559Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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-06-28T00:57:02.959467Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-02T13:46:59.819303Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"cited_work":{"arxiv_id":"2603.01692","doi":null,"metadata_source":"pith","pith_arxiv_id":"2603.01692","snapshot_observed_at":"2026-07-02T13:46:59.819303Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","venue":"cs.LG","work_id":"d9531c90-148b-4f61-95e0-c8d79a25524d","year":2026},"citing_paper":{"arxiv_id":"2606.06473","last_updated":"2026-06-04T17:55:59Z","snapshot_observed_at":"2026-08-01T19:37:15.448610Z","submitted_at":"2026-06-04T17:55:59Z","title":"MLEvolve: A Self-Evolving Framework for Automated Machine Learning Algorithm Discovery","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T00:57:02.959467Z"},"links":{"cited_paper":"/paper/2603.01692","citing_paper":"/paper/2606.06473"},"observation_digest":"sha256:ca5b020c70ae6224ac889a25dc9b9ae1412bf7936cfbcfbca6f416069573ee61","observation_id":"1a6316ec-f914-4ef8-9e5c-48801ceb1afa","resolution":{"observed_at":"2026-07-02T13:46:59.820786Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2603.01692/citation-record","integrity":"/paper/2603.01692/integrity","json":"/paper/2603.01692/citation-record.json","paper":"/paper/2603.01692"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Artificial Analysis: Independent Benchmarks and Performance Landscape of AI Models","venue":null,"work_id":"845d8a4b-f226-421d-b467-e2d27082e393","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:3337db54ce32724bb5eb1169d6a0c9995f486f0ba7fa42b6f528a44587b2a2db","observation_id":"2b42aabe-6b40-48f6-9be2-8c6f128f2152","resolution":{"observed_at":"2026-05-15T17:50:12.686241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.04470","last_updated":"2025-05-09T05:20:55Z","snapshot_observed_at":"2026-08-03T13:04:05.195861Z","submitted_at":"2024-09-04T09:02:31Z","title":"Comparative Analysis of Gradient-Based Optimization Techniques Using Multidimensional Surface 3D Visualizations and Initial Point Sensitivity","version":3},"cited_work":{"arxiv_id":"2409.04470","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.04470","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Comparative analysis of gradient-based optimization techniques using multidimensional surface 3d visualizations and initial point sensitivity","venue":null,"work_id":"1d96fde4-4b93-44a5-8dbe-a605b29609a5","year":2024},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2409.04470","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:ac833ba9a186c09f1d7e12b51eda2fa3d038f338f7ce2ffd49ba5f8559420407","observation_id":"e32422cc-45d3-4768-ba82-69a10d3d56ac","resolution":{"observed_at":"2026-05-15T17:50:12.242212Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Optimization methods for large-scale machine learning","venue":null,"work_id":"2767430d-7305-4f08-9bb2-d294ed068785","year":2018},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:bf7fc36295b13c5440fce88ad6d6d7d9a45ce1f71bd71c985a2c7b39f8c87062","observation_id":"e006deef-3792-4eca-b631-fadc636f4e49","resolution":{"observed_at":"2026-05-15T17:50:12.681018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07095","last_updated":"2025-02-26T11:57:30Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-09T17:34:27Z","title":"MLE-bench: Evaluating Machine Learning Agents on Machine Learning Engineering","version":6},"cited_work":{"arxiv_id":"2410.07095","doi":"10.48550/arxiv.2410.07095","metadata_source":"pith","pith_arxiv_id":"2410.07095","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"MLE-bench: Evaluating Machine Learning Agents on Machine Learning Engineering","venue":"cs.CL","work_id":"a671e43f-ceab-49e7-adc3-473d802a97ca","year":2024},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2410.07095","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:b336001082dbdaaa9035c59f3e9ae55a139437605b83c5f73dc9be62b0a85390","observation_id":"fc560ce5-11dd-48aa-a399-67b7b6147fd9","resolution":{"observed_at":"2026-05-15T17:50:12.253270Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Traceisthenextautodiff: Generativeoptimization with rich feedback, execution traces, and llms.Advances in Neural Information Processing Systems, 37: 71596–71642","venue":null,"work_id":"a151ba4c-f6ef-4355-9662-7ac14f9c3f0f","year":2024},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:f3162123e5ec32a562e48b1edd63f415bea713d8e55785ab80bc34a7972a3166","observation_id":"fd8ae382-a983-4aab-9846-7de665371c18","resolution":{"observed_at":"2026-05-15T17:50:12.670532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19499","last_updated":"2025-06-26T18:40:26Z","snapshot_observed_at":"2026-07-06T19:39:38.201130Z","submitted_at":"2024-10-25T11:58:12Z","title":"Introducing MAPO: Momentum-Aided Gradient Descent Prompt Optimization","version":3},"cited_work":{"arxiv_id":"2410.19499","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.19499","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Introducing mapo: Momentum-aided gradient descent prompt optimization","venue":null,"work_id":"5372b4a4-7f11-4eb9-93ce-214e4a6e9d99","year":2024},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2410.19499","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:8b0d82876911064f09116871d99019b0d86fe1ea1efc95b59b09f0c8516d2fdd","observation_id":"fa3c3ac3-2da2-49d6-a902-f3d09918edc6","resolution":{"observed_at":"2026-05-15T17:50:12.248468Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Internagent-mle: Navigating fine-grained optimization for coding agent","venue":null,"work_id":"996d1e8d-6eeb-49de-aaa7-2a25777cc075","year":null},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:984bb8a195cd59eb7428b256afb0a47e2c85d0859239202da46eb3bec5f194f1","observation_id":"3bfa3821-07b9-4da1-ace5-825cfba6cb1e","resolution":{"observed_at":"2026-05-15T17:50:12.665991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Loss surfaces, mode connectivity, and fast ensembling of dnns.Advances in neural information processing systems, 31","venue":null,"work_id":"8980d1ad-41ce-4f1e-a8c3-a679538c7eb5","year":2018},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:eff0756bc93181902520dc16d691ca60591a51f3d93ff7766214db5d696c0f76","observation_id":"a4a69550-6662-4b06-8d4c-31dda1adba60","resolution":{"observed_at":"2026-05-15T17:50:12.675713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Aider LLM Leaderboards: Code Editing and Refactoring Benchmarks.https://aider","venue":null,"work_id":"d307bc47-69c8-4831-b5ce-990fa70ce83f","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:0fed24aee5eccaa8e710fe633f39db9f2183bfb3a0c2954d972ab93da5539c12","observation_id":"ebd0af58-2f3a-4c18-a1bb-cd4549d9421a","resolution":{"observed_at":"2026-05-15T17:50:12.661133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2501.12948","doi":"10.1016/j.artmed.2024.103001","metadata_source":"pith","pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","venue":"cs.CL","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:783ba4bc109f910aa8457e96ec3be695b7132d65d17105f79970a47c4e05421c","observation_id":"3cf5e1d7-b1ef-4ac2-bd90-fa5c3afde300","resolution":{"observed_at":"2026-05-15T17:50:12.213590Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Evoprompt: Connecting llms with evolutionary algorithms yields powerful prompt optimizers","venue":null,"work_id":"71602c43-18c1-44f0-bd95-016007ba801f","year":2023},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:61bdf4e00a6e296ade81b7d646a5dfa1c327af3cb9171b9b3e26795c6e46ebba","observation_id":"0dafeb71-0a0e-4c7e-ae4b-d818f3348287","resolution":{"observed_at":"2026-05-15T17:50:12.644086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03302","last_updated":"2024-04-14T21:02:16Z","snapshot_observed_at":"2026-08-03T01:30:37.931398Z","submitted_at":"2023-10-05T04:06:12Z","title":"MLAgentBench: Evaluating Language Agents on Machine Learning Experimentation","version":2},"cited_work":{"arxiv_id":"2310.03302","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.03302","snapshot_observed_at":"2026-07-05T17:51:14.743354Z","title":"Mlagentbench: Evaluating language agents on ma- chine learning experimentation","venue":"cs.LG","work_id":"5655b20a-fbb7-4a39-8605-d6e1d689895a","year":2023},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2310.03302","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:90e61664f3995416b6e34bc10effa0d92442e5c2c59bd0578f40ee8ffc7ff403","observation_id":"d2b289d4-6ea3-4b36-b315-08cd9ed0c454","resolution":{"observed_at":"2026-05-15T17:50:12.229176Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Academic Press","venue":null,"work_id":"4543a6c3-2f0e-4f28-a2a5-cf89363bb4ec","year":2013},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:0ae0a8a43a601906480ec5d5e8a8f9005812b7d8a8d5dfcbe25b152fc574638d","observation_id":"dd702606-79f4-47f2-975c-db6e499ae27b","resolution":{"observed_at":"2026-05-15T17:50:12.639121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":"2412.16720","doi":"10.48550/arxiv.2412.16720","metadata_source":"pith","pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"OpenAI o1 System Card","venue":"cs.AI","work_id":"68d3c334-0fc9-49e3-b7b0-a69afae933e2","year":2024},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:09adeae59c92cf8f922213796ff7fff5cf68edbd5358313715230afeb8ad831a","observation_id":"d2836d84-479d-48df-ba82-db90c9680158","resolution":{"observed_at":"2026-05-15T17:50:12.236045Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13138","last_updated":"2025-02-18T18:57:21Z","snapshot_observed_at":"2026-08-05T07:03:00.655237Z","submitted_at":"2025-02-18T18:57:21Z","title":"AIDE: AI-Driven Exploration in the Space of Code","version":1},"cited_work":{"arxiv_id":"2502.13138","doi":"10.48550/arxiv.2502.13138","metadata_source":"pith","pith_arxiv_id":"2502.13138","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"AIDE: AI-Driven Exploration in the Space of Code","venue":"cs.AI","work_id":"22aa3d2a-9edd-44c4-b8b8-1442ea805e01","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2502.13138","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:234e11bf277f7d3907d0d37b2b345d9a90362c3518a48a6c554717603130315c","observation_id":"a38e1dbc-a2c5-4607-8a7f-342d9112c06a","resolution":{"observed_at":"2026-05-17T18:22:30.071006Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T19:23:24.934132+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T19:23:24.934132+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06770","last_updated":"2024-11-11T23:05:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T16:47:29Z","title":"SWE-bench: Can Language Models Resolve Real-World GitHub Issues?","version":3},"cited_work":{"arxiv_id":"2310.06770","doi":"10.1145/512927.512945","metadata_source":"pith","pith_arxiv_id":"2310.06770","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SWE-bench: Can Language Models Resolve Real-World GitHub Issues?","venue":"cs.CL","work_id":"d0effe15-a689-441a-8e3f-ea35f1c4e4b1","year":2023},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2310.06770","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:12e952ee601d299a373fd7682ce0fd3ba9d94fc6f97303661a5655a1e62d3920","observation_id":"997664c4-9e2c-419c-a512-24f3e388a755","resolution":{"observed_at":"2026-05-15T17:50:12.218265Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.10177","last_updated":"2026-04-22T18:28:23Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-08-13T20:29:56Z","title":"KompeteAI: Accelerated Autonomous Multi-Agent System for End-to-End Pipeline Generation for Machine Learning Problems","version":3},"cited_work":{"arxiv_id":"2508.10177","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.10177","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"KompeteAI: Accelerated Autonomous Multi-Agent System for End-to-End Pipeline Generation for Machine Learning Problems","venue":"cs.AI","work_id":"c4e3f22b-f15f-489b-8885-4206235cee8f","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2508.10177","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:ede774f50beb0c070965ba0342b2746cb60c33f4cd1fcd2b30934b84a290ae83","observation_id":"21457aac-a06d-4a9b-bbda-fdb7d98ef398","resolution":{"observed_at":"2026-05-15T17:50:12.285295Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.26144","doi":"10.48550/arxiv.2510.26144","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The FM Agent, February 2026.https://arxiv.org/abs/2510.26144","venue":"arXiv (Cornell University)","work_id":"fdcfb178-e1c6-4d8c-8162-ff22494f991b","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:1e1accebd0a85e5afc83fb6ad6a800f68d970a61c60ffab363abafa50b3f0143","observation_id":"eee33bf5-61d4-46ff-b717-29752422a941","resolution":{"observed_at":"2026-05-15T17:50:12.256694Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.16499","last_updated":"2025-06-19T17:53:28Z","snapshot_observed_at":"2026-07-06T21:44:57.091757Z","submitted_at":"2025-06-19T17:53:28Z","title":"ML-Master: Towards AI-for-AI via Integration of Exploration and Reasoning","version":1},"cited_work":{"arxiv_id":"2506.16499","doi":"10.48550/arxiv.2506.16499","metadata_source":"pith","pith_arxiv_id":"2506.16499","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2506.16499 (2025)","venue":"cs.AI","work_id":"ccdc8eb5-334a-4710-b191-154fd6fbcfe7","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2506.16499","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:32c65ea4939bc535175b1c2ea39c8d3f93b40668ce6f10c10040ea5ef0d14478","observation_id":"2a4574c1-f0aa-422b-96a7-fb020fc66d1a","resolution":{"observed_at":"2026-05-15T17:50:12.279869Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T19:23:24.59793+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T19:23:24.59793+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Self-refine: Iterative refinement with self- feedback.Advances in Neural Information Processing Systems, 36:46534–46594","venue":null,"work_id":"ddf1c1a1-0e3c-4b31-8406-8ee7daf84e6e","year":2023},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:70a6aac76a84bd29dad4d5b6b933aab202fccc05e8e6080514ec9e0cb553bc38","observation_id":"3a339b5e-2e46-46a9-9bc0-08c295a70a2f","resolution":{"observed_at":"2026-05-15T17:50:12.598644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Guided evo- lutionary strategies: Augmenting random search with surrogate gradients","venue":null,"work_id":"1316cf23-aced-42dc-9629-c1583e9c31cd","year":2019},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:b5573f0aa343b62e5302a5f66f7376c9e0c9ce10c074a02c3dec7b8e3514efb2","observation_id":"78d84997-31e1-4a34-b89a-8847383e15e7","resolution":{"observed_at":"2026-05-15T17:50:12.648720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.15692","last_updated":"2025-08-28T04:12:45Z","snapshot_observed_at":"2026-08-06T15:35:12.713403Z","submitted_at":"2025-05-27T18:11:25Z","title":"MLE-STAR: Machine Learning Engineering Agent via Search and Targeted Refinement","version":3},"cited_work":{"arxiv_id":"2506.15692","doi":"10.48550/arxiv.2506.15692","metadata_source":"pith","pith_arxiv_id":"2506.15692","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mle-star: Machine learning engineering agent via search and targeted refinement","venue":"cs.LG","work_id":"18961cf8-9dc4-402c-8a09-dee6cdb17563","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2506.15692","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:aef90f5bbbad219bdfd82fbf0f17874ad4250b69857ee4decbe73b78f344b7ef","observation_id":"4cfcd81b-d4f2-4adf-ba7e-02617503ee1f","resolution":{"observed_at":"2026-05-15T17:50:12.299130Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Springer","venue":null,"work_id":"1ca7c840-6fa6-4f9b-b138-e0a216c264ff","year":2018},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:23e3122b680d8975d22d449fd836ae139600cae5a6d714de65c9c318da5eb15f","observation_id":"d7a505a1-1aab-4526-9ffd-8f761124b57d","resolution":{"observed_at":"2026-05-15T17:50:12.626327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.16344","doi":"10.48550/arxiv.2601.16344","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dsgym: A holistic framework for evaluating and training data science agents","venue":"arXiv (Cornell University)","work_id":"5a455d6f-ed41-4555-8be8-58e0671992ed","year":2026},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:2d45954fedb0ee594e3e6b7750e4950f679b6fefc1cbecde6d79ec6f3dd99cbb","observation_id":"bd0cd20f-91f8-4db2-8a78-7c815bbd6cc8","resolution":{"observed_at":"2026-05-15T17:50:12.246096Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Introducing openai o3 and o4-mini","venue":null,"work_id":"83ed8354-79ae-4adc-9ca8-4f3bd8adb79f","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:ff421acaf5763aff6a334f2ff3c5eee3bd4b4e33a4cb8248c286411509773fa1","observation_id":"bfb10034-9596-459e-913c-db9e4c33a663","resolution":{"observed_at":"2026-05-15T17:50:12.630480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03495","last_updated":"2023-10-19T04:37:25Z","snapshot_observed_at":"2026-08-06T03:31:54.947656Z","submitted_at":"2023-05-04T15:15:22Z","title":"Automatic Prompt Optimization with \"Gradient Descent\" and Beam Search","version":2},"cited_work":{"arxiv_id":"2305.03495","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.03495","snapshot_observed_at":"2026-07-04T18:40:03.102880Z","title":"Rafailov, R., Sharma, A., Mitchell, E., Ermon, S., Manning, C","venue":null,"work_id":"8f5910e5-bea1-4761-87ec-05f692dd6f04","year":2023},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2305.03495","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:b24e25e18dd162cf8d13a233696c11af3efacf021ab9a6bd904722eeed72d960","observation_id":"e988b4d7-58fc-499f-8bea-7ad2a6f5b85c","resolution":{"observed_at":"2026-05-15T17:50:12.234658Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T03:44:29.499952Z","title":"Reflexion: Language agents with verbal reinforcement learning.Advances in Neural Information Processing Systems, 36:8634–8652","venue":null,"work_id":"a1894bfe-ed8e-4cc3-a955-b4689ee7d53f","year":2023},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:9c268cf4cca22f7bfe91482fcca0e874c3375ecbee8827bd8f037e2abf5f837a","observation_id":"3d1bee81-8690-4a6b-8b37-eac93e8e4c29","resolution":{"observed_at":"2026-05-15T17:50:12.602593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.03267","last_updated":"2026-05-01T23:55:43Z","snapshot_observed_at":"2026-08-02T10:52:10.211700Z","submitted_at":"2025-12-19T07:05:38Z","title":"OpenAI GPT-5 System Card","version":2},"cited_work":{"arxiv_id":"2601.03267","doi":"10.48550/arxiv.2601.03267","metadata_source":"pith","pith_arxiv_id":"2601.03267","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"OpenAI GPT-5 System Card","venue":"cs.CL","work_id":"ca87689a-0d29-4476-b504-b65dbbb08af4","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2601.03267","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:7d7c79cde59dd06686eddf42f9c0d216169e006ec8f7436fca2ef39548780534","observation_id":"3885500f-d69c-4163-bdd9-da5a7d47b325","resolution":{"observed_at":"2026-05-15T17:50:12.268050Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-03T00:38:11.458508+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T00:38:11.458508+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-05T02:30:41.723625Z","title":"A survey of reasoning with foundation models: Concepts, methodologies, and outlook.ACM Computing Surveys, 57(11):1–43","venue":null,"work_id":"32b11900-2bf3-411b-8d71-990a0f6c3e01","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:68dda131a2d0e552dfdc16d3b64e5b43aa2d6f1795c3b74b73a3017f111c293b","observation_id":"1ad37891-d224-4ced-868e-e59b5b8bfe1b","resolution":{"observed_at":"2026-05-15T17:50:12.617201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2507.02554","doi":"10.48550/arxiv.2507.02554","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2507.02554 , year=","venue":"Örebro University Library (Örebro University)","work_id":"960dcc2b-873e-4304-84e6-ac1f04277254","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:cf859c17abfb18fd1fd079cbbca5812545a012d3352536633aa92df2d8eab7a8","observation_id":"0ce0e877-bbe7-4695-bc08-94c8cc66fb34","resolution":{"observed_at":"2026-05-15T17:50:12.305111Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16741","last_updated":"2025-04-18T18:14:31Z","snapshot_observed_at":"2026-08-02T14:58:44.167588Z","submitted_at":"2024-07-23T17:50:43Z","title":"OpenHands: An Open Platform for AI Software Developers as Generalist Agents","version":3},"cited_work":{"arxiv_id":"2407.16741","doi":"10.1145/3718958.3750537","metadata_source":"pith","pith_arxiv_id":"2407.16741","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"OpenHands: An Open Platform for AI Software Developers as Generalist Agents","venue":"cs.SE","work_id":"f1762ea0-e382-4f38-a28c-adc643789859","year":2024},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2407.16741","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:2f3f1409062d4ba959e0075a9ed67d42fc65659073c4c00d7c1f8017c6986eda","observation_id":"27273833-eab6-4c93-b937-b56f111959e6","resolution":{"observed_at":"2026-05-15T17:50:12.239953Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.09686","last_updated":"2025-01-23T08:44:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-16T17:37:58Z","title":"Towards Large Reasoning Models: A Survey of Reinforced Reasoning with Large Language Models","version":3},"cited_work":{"arxiv_id":"2501.09686","doi":"10.48550/arxiv.2501.09686","metadata_source":"pith","pith_arxiv_id":"2501.09686","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards Large Reasoning Models: A Survey of Reinforced Reasoning with Large Language Models","venue":"cs.AI","work_id":"9b0d5273-2b7c-477e-b49b-2e0edab55456","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2501.09686","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:fab3b709fecd224908cd04e55a15b219cbaf18bc0ae575ac215305da63aa72c4","observation_id":"b577fd38-ccbe-40ab-8160-7ed3fe4d4c88","resolution":{"observed_at":"2026-05-15T21:20:59.729674Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Large language models as optimizers","venue":null,"work_id":"72be2ea3-5097-4b52-8bcc-b0d161472d66","year":2023},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:073655a4027782858b524669bcae0cdf2d924658054218cef06847f2f1339dbd","observation_id":"6305306d-5c67-474a-b389-3d917ed32398","resolution":{"observed_at":"2026-05-15T17:50:12.656577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07496","last_updated":"2024-06-11T17:32:21Z","snapshot_observed_at":"2026-07-06T18:29:04.294349Z","submitted_at":"2024-06-11T17:32:21Z","title":"TextGrad: Automatic \"Differentiation\" via Text","version":1},"cited_work":{"arxiv_id":"2406.07496","doi":"10.48550/arxiv.2406.07496","metadata_source":"pith","pith_arxiv_id":"2406.07496","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TextGrad: Automatic \"Differentiation\" via Text","venue":"cs.CL","work_id":"c52b4841-a4b4-4b4e-bc86-8ef6645a9bbb","year":2024},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"cited_paper":"/paper/2406.07496","citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:933d568ae33e5ecf5136b4bd000572791a66b39493e9cbe5c5ceea9eccced696","observation_id":"c9a48c6b-51d6-4475-a6aa-04eb22a23448","resolution":{"observed_at":"2026-05-15T17:50:12.251461Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-07-14T18:20:25.209279+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T18:20:25.209279+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.14069","doi":"10.48550/arxiv.2505.14069","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Initialization with Forced Diversifi- cation","venue":"ArXiv.org","work_id":"1c69c962-0519-4b2d-837b-7b03c66cf1bb","year":2025},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:9b62117f168a8ad48ce5c3fe53986f24d053d8d999a7911a3068156bad817940","observation_id":"9eb5eb1c-92a0-4956-8562-9090a3dd596c","resolution":{"observed_at":"2026-05-15T17:50:12.262503Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f49568a9-62c7-436a-8e05-dc332c54197b","year":null},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:0b3f5207444e3e09b9f781aa557a1bed7b6581086a0ef898bccccdaff6be8db1","observation_id":"00b82697-ca5f-4106-a06f-98a2903bf469","resolution":{"observed_at":"2026-05-15T17:50:12.593776Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4511b94b-8e01-4312-ab28-76a65a3c28b3","year":null},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:3dd7266266768a7ccdc0be024f0dc8980c02ec542ed26d8fbf090c47480c8c24","observation_id":"78cb3d50-3ee9-44a4-8025-04ba9d0844e4","resolution":{"observed_at":"2026-05-15T17:50:12.652657Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"31d0c58e-cc44-4d30-b973-7827e85b52cc","year":null},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:b0f46ffbec6f50cb8ccf1def37de16e0bc3efb4ef37b7ce50470b9e7e2ddaaf6","observation_id":"ebb73b01-7424-42d2-b607-b2586791174a","resolution":{"observed_at":"2026-05-15T17:50:12.614595Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"These are moderately detectable, as the validator can flag suspiciously specific features by analyzing their construction logic","venue":null,"work_id":"6e95071b-f1b6-408d-865d-fdaa6c72a078","year":null},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:006fda9056dd4e79c6643f609bdff86be046f9483ddd6875aa99038ab128da2a","observation_id":"84f370f1-67bd-4fe2-b429-de30f1e0cc62","resolution":{"observed_at":"2026-05-15T17:50:12.621943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"shortcut solvability","venue":null,"work_id":"f465a794-c45b-4553-98d2-570e75097b71","year":null},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:4dbe11f455376269214462bd83feb28ee7923ba097aa03208d90af5ba099e7f3","observation_id":"983fcd4d-bdae-4d92-8f78-a62c3acdb8b1","resolution":{"observed_at":"2026-05-15T17:50:12.634976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"neural networks vs","venue":null,"work_id":"60d72db1-c618-4c23-927e-5d3d5da2e8c9","year":null},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:f9a2659066d7f00be7dc3db1a65a09ba9481d8ac9698ca4e2fb43bee44015cad","observation_id":"7ae772a5-29b8-4d28-a22a-2116ccfa326f","resolution":{"observed_at":"2026-05-15T17:50:12.606600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"When one trace discovers a better region, others can adopt or adapt that hypothesis, enabling non-local transitions while preserving local refinement within each region","venue":null,"work_id":"12fa6ac8-e1cf-48a6-812c-9e8c73466096","year":null},"citing_paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-15T17:49:46.383559Z"},"links":{"citing_paper":"/paper/2603.01692"},"observation_digest":"sha256:149d81879722855b094cd1580745c31937e80c5f0adc0d9ddc76abe03b7edfbc","observation_id":"631f2466-06a0-4298-b6d2-133aa5d9c4e7","resolution":{"observed_at":"2026-05-15T17:50:12.610715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2603.01692","last_updated":"2026-04-12T09:20:27Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T17:24:03.244671Z","submitted_at":"2026-03-02T10:22:47Z","title":"Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":19,"verified_fuzzy":19},"total_outbound_references":42},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 1 inbound Pith citation observation for arXiv:2603.01692."}