{"as_of":"2026-08-09T19:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d1cfcb388bd39cb036afcf97136cf4439068c31048e65b5a8290c0e42b4247c3","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:21:11.174293Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.04804/citation-record","integrity":"/paper/2608.04804/integrity","json":"/paper/2608.04804/citation-record.json","paper":"/paper/2608.04804"},"outbound":[{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06770","snapshot_observed_at":"2026-08-06T16:21:09.884756Z","title":"SWE-bench: Can language mod- els resolve real-world GitHub issues?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:09.884756Z"},"links":{"cited_paper":"/paper/2310.06770","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:b99471f4101a04e06b23f681471a58672b232e8aaf5ad7ff3fc704a043c4d694","observation_id":"20a499f3-073b-4382-8510-b0c35e32e7c9","resolution":{"observed_at":"2026-08-06T16:21:09.884756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18665","last_updated":"2025-02-23T08:50:33Z","snapshot_observed_at":"2026-07-30T15:06:18.011623Z","submitted_at":"2024-06-26T18:10:22Z","title":"RouteLLM: Learning to Route LLMs with Preference Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18665","snapshot_observed_at":"2026-08-06T16:21:10.022647Z","title":"RouteLLM: Learning to route LLMs with preference data,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:10.022647Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:9e30c47be5cba3184f821d90a0868227779c63824ce2dd38c8bcf775f59caba3","observation_id":"f2367007-11be-49bd-a7ac-b130e7cd675b","resolution":{"observed_at":"2026-08-06T16:21:10.022647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05176","last_updated":"2023-05-09T05:11:02Z","snapshot_observed_at":"2026-07-31T18:33:34.529799Z","submitted_at":"2023-05-09T05:11:02Z","title":"FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.05176","snapshot_observed_at":"2026-08-06T16:21:10.172655Z","title":"FrugalGPT: How to use large language models while reducing cost and improving performance,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:10.172655Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:fe6da98ec9b4c650c2cd6cdeb3e33961f5a38cded63c37c725d4c1e496dfea43","observation_id":"4cdf207a-a9ba-4c81-af04-0f4fcfa31235","resolution":{"observed_at":"2026-08-06T16:21:10.172655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.16941","last_updated":"2025-11-14T22:00:03Z","snapshot_observed_at":"2026-08-06T21:34:46.041153Z","submitted_at":"2025-09-21T06:28:17Z","title":"SWE-Bench Pro: Can AI Agents Solve Long-Horizon Software Engineering Tasks?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.16941","snapshot_observed_at":"2026-08-06T16:21:10.295146Z","title":"SWE-bench Pro: Can AI agents solve long-horizon software engineering tasks?","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:10.295146Z"},"links":{"cited_paper":"/paper/2509.16941","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:6e1023fd80c29150d22306277690b07af9f64d98100721771d3214776ffef3c2","observation_id":"3fa6614d-2b13-4217-82e5-1911df8fc217","resolution":{"observed_at":"2026-08-06T16:21:10.295146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15793","last_updated":"2024-11-11T20:01:15Z","snapshot_observed_at":"2026-07-06T18:19:29.996982Z","submitted_at":"2024-05-06T17:41:33Z","title":"SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15793","snapshot_observed_at":"2026-08-06T16:21:10.374802Z","title":"SWE-agent: Agent-computer interfaces enable automated software engineering,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:10.374802Z"},"links":{"cited_paper":"/paper/2405.15793","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:dcd744544b8bfec2cf22cdf22cf80302f5549c29d3e68864f2bc1d3dc9039006","observation_id":"8555da6c-cbbe-4420-9949-c938e3eef4bd","resolution":{"observed_at":"2026-08-06T16:21:10.374802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01489","last_updated":"2024-10-29T17:29:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-01T17:24:45Z","title":"Agentless: Demystifying LLM-based Software Engineering Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01489","snapshot_observed_at":"2026-08-06T16:21:10.441409Z","title":"Agentless: Demystifying LLM-based software engineering agents,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:10.441409Z"},"links":{"cited_paper":"/paper/2407.01489","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:e9a40aef6924779fd8b8c277ffd988f193e11843743cc88358c00cd406e85248","observation_id":"8e36e7e9-63ea-4fa9-8d3d-b70e1c59a1a1","resolution":{"observed_at":"2026-08-06T16:21:10.441409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.21798","last_updated":"2025-05-21T17:21:45Z","snapshot_observed_at":"2026-07-06T21:17:09.837496Z","submitted_at":"2025-04-30T16:56:06Z","title":"SWE-smith: Scaling Data for Software Engineering Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.21798","snapshot_observed_at":"2026-08-06T16:21:10.531995Z","title":"SWE-smith: Scaling data for software engineering agents,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:10.531995Z"},"links":{"cited_paper":"/paper/2504.21798","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:afceb77240543f62f6e6a8d948986f151171a67d1f5bd98f63918618aee926d7","observation_id":"1685fdc7-a4a4-4917-a48c-15e7cdf48413","resolution":{"observed_at":"2026-08-06T16:21:10.531995Z","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-06T16:21:12.204673Z","title":"Training software engineering agents and verifiers with SWE-Gym,","venue":null,"work_id":"18709f5b-5600-4a8a-bdb3-080a27d93fc9","year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:10.626414Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:ab3ce4d7e4c24721cbb7392e077da2b3cc5ac7f836d585eae6c19f26683fdca6","observation_id":"52e20be3-e61b-4a89-9312-107a7fe360c3","resolution":{"observed_at":"2026-08-06T16:21:12.211280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.07164","last_updated":"2025-04-09T17:55:19Z","snapshot_observed_at":"2026-08-07T16:07:06.150702Z","submitted_at":"2025-04-09T17:55:19Z","title":"R2E-Gym: Procedural Environments and Hybrid Verifiers for Scaling Open-Weights SWE Agents","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.07164","snapshot_observed_at":"2026-08-06T16:21:10.741606Z","title":"R2E-Gym: Procedural environments and hy- brid verifiers for scaling open-weights SWE agents,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:10.741606Z"},"links":{"cited_paper":"/paper/2504.07164","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:d4f537fe66e0295ebb32b248adaf18af3ea697737fefbf8df6a42025cb7b8733","observation_id":"63d7a0af-ac1a-4701-9dda-6e8f11e26e7b","resolution":{"observed_at":"2026-08-06T16:21:10.741606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.05040","last_updated":"2025-05-07T04:06:41Z","snapshot_observed_at":"2026-08-09T14:17:37.281562Z","submitted_at":"2025-01-09T07:54:24Z","title":"SWE-Fixer: Training Open-Source LLMs for Effective and Efficient GitHub Issue Resolution","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.05040","snapshot_observed_at":"2026-08-06T16:21:10.867962Z","title":"SWE-Fixer: Training open-source LLMs for effective and efficient GitHub issue resolution,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:10.867962Z"},"links":{"cited_paper":"/paper/2501.05040","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:d60d66232d901ed1742151dbe6cbbc413d178d19d26074f7b0b2941bf2c10b50","observation_id":"66144ce3-fc94-4c1b-8d9f-feb15afd81a5","resolution":{"observed_at":"2026-08-06T16:21:10.867962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.09089","last_updated":"2025-04-29T14:37:43Z","snapshot_observed_at":"2026-08-07T17:11:01.393818Z","submitted_at":"2025-03-12T05:55:01Z","title":"LocAgent: Graph-Guided LLM Agents for Code Localization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.09089","snapshot_observed_at":"2026-08-06T16:21:10.977833Z","title":"LocAgent: Graph-guided LLM agents for code localization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:10.977833Z"},"links":{"cited_paper":"/paper/2503.09089","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:ae5fff0655b652ed782c1594ec930170ef57970d394ab117dd425f226a6cd2a7","observation_id":"d046c397-4240-4e3b-9377-680ed84ad48f","resolution":{"observed_at":"2026-08-06T16:21:10.977833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.07849","last_updated":"2026-04-22T07:43:16Z","snapshot_observed_at":"2026-08-08T04:04:17.950337Z","submitted_at":"2025-05-07T19:44:09Z","title":"SweRank: Software Issue Localization with Code Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.07849","snapshot_observed_at":"2026-08-06T16:21:11.013016Z","title":"SweRank: Software issue localization with code ranking,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.013016Z"},"links":{"cited_paper":"/paper/2505.07849","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:a05809450e03911e2f22775b1960e9d947e200eed7e05692f0faf399d6b5953f","observation_id":"279c8003-6398-462d-a205-e1f36175d083","resolution":{"observed_at":"2026-08-06T16:21:11.013016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-08-08T18:42:25.777499Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-08-06T16:21:11.021145Z","title":"Hybrid LLM: Cost-efficient and quality-aware query routing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.021145Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:a3cae941f8872bb95b12e707e0a7ef67b41155e6fb217c681b91d4bf54c162b3","observation_id":"b1a11c41-d239-4cd2-9b00-07df7df0d872","resolution":{"observed_at":"2026-08-06T16:21:11.021145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-06T08:57:12.331150Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-06T16:21:11.026627Z","title":"Large language model routing with benchmark datasets,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.026627Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:aa1661bb24cac2188b22c03583ad83dec7a69569f624580db77c3c7c3cf5eccb","observation_id":"8b09e4e5-502f-4dd1-b6aa-9b1d780a376f","resolution":{"observed_at":"2026-08-06T16:21:11.026627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02223","last_updated":"2024-10-16T22:23:00Z","snapshot_observed_at":"2026-08-08T02:19:27.944517Z","submitted_at":"2024-10-03T05:43:24Z","title":"EmbedLLM: Learning Compact Representations of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02223","snapshot_observed_at":"2026-08-06T16:21:11.032050Z","title":"EmbedLLM: Learning compact represen- tations of large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.032050Z"},"links":{"cited_paper":"/paper/2410.02223","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:01c5349c45ff29eab55efbbc9250bbdcc046a0955f76fed22867849cc0cffe5a","observation_id":"2278767c-2c79-4bb2-9806-51843a141c3c","resolution":{"observed_at":"2026-08-06T16:21:11.032050Z","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-06T16:21:11.039006Z","title":"ICL-router: In-context learned model representations for LLM routing,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.039006Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:359fafc831d4354b0f193d69056dbb39e3ef35032d56aeafa0770ce2f8be992c","observation_id":"f9723c20-62bb-4b34-8615-93f0f140d83f","resolution":{"observed_at":"2026-08-06T16:21:11.039006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.00053","last_updated":"2026-06-30T01:46:26Z","snapshot_observed_at":"2026-07-07T00:05:41.920778Z","submitted_at":"2026-06-30T01:46:26Z","title":"SWE-Router: Routing in Multi-turn Agentic Software Engineering Tasks","version":1},"cited_work":{"arxiv_id":"2607.00053","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.00053","snapshot_observed_at":"2026-08-06T16:21:11.692315Z","title":"SWE-Router: Routing in Multi-turn Agentic Software Engineering Tasks","venue":"cs.SE","work_id":"adf24b87-638e-4d23-82a1-a9f9c1b14b4d","year":2026},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.044397Z"},"links":{"cited_paper":"/paper/2607.00053","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:98ed591929ab71da902ab23009b6ef9d6d2b80ad96996bba1ac49b94b4b881d8","observation_id":"f5e25c16-da25-437f-97aa-13f75b468236","resolution":{"observed_at":"2026-08-06T16:21:11.698790Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.19338","last_updated":"2026-07-30T18:56:15Z","snapshot_observed_at":"2026-08-05T23:11:03.030949Z","submitted_at":"2026-07-21T17:56:49Z","title":"CodeRescue: Budget-Calibrated Recovery Routing for Coding Agents","version":2},"cited_work":{"arxiv_id":"2607.19338","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.19338","snapshot_observed_at":"2026-08-06T16:21:11.665499Z","title":"CodeRescue: Budget-Calibrated Recovery Routing for Coding Agents","venue":"cs.AI","work_id":"973b3f17-c73c-48f4-9077-a1c3d1142a12","year":2026},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.050987Z"},"links":{"cited_paper":"/paper/2607.19338","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:c1c7666a857c0365d4e10c483d45fc173fb660e85d4f123f680d0eb855a76ff5","observation_id":"c4887691-aa60-4cff-adf0-d6af79f3cde3","resolution":{"observed_at":"2026-08-06T16:21:11.672155Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.22465","last_updated":"2026-07-27T17:28:05Z","snapshot_observed_at":"2026-08-08T07:44:46.445363Z","submitted_at":"2026-07-24T16:29:06Z","title":"TRACE-ROUTER: Task-Consistent and Adaptive Online Routing for Agentic AI","version":2},"cited_work":{"arxiv_id":"2607.22465","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.22465","snapshot_observed_at":"2026-08-06T16:21:11.636583Z","title":"TRACE-ROUTER: Task-Consistent and Adaptive Online Routing for Agentic AI","venue":"cs.AI","work_id":"9abc8f51-061d-4caf-8670-c5acb9fecf6d","year":2026},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.057338Z"},"links":{"cited_paper":"/paper/2607.22465","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:b6177eccb66342c810c72c6e7a3609910366d0f74c91a2857b1af5c9d7e30f81","observation_id":"27ee8197-0a95-4f73-b92c-7c63d5bc625f","resolution":{"observed_at":"2026-08-06T16:21:11.644399Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.18552","last_updated":"2026-06-02T06:06:43Z","snapshot_observed_at":"2026-08-03T15:02:08.953642Z","submitted_at":"2025-12-21T00:49:40Z","title":"Toward Training Superintelligent Software Agents through Self-Play SWE-RL","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.18552","snapshot_observed_at":"2026-08-06T16:21:11.065080Z","title":"Toward training superintelligent soft- ware agents through self-play SWE-RL,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.065080Z"},"links":{"cited_paper":"/paper/2512.18552","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:60f78c09b263af15deabbb523c9a1789b7f69dfa591cc4fc12b3095052087633","observation_id":"79c68b93-61ab-48b2-b69d-95bf37658216","resolution":{"observed_at":"2026-08-06T16:21:11.065080Z","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-06T16:21:12.185841Z","title":"Introducing SWE-bench Verified,","venue":null,"work_id":"44502841-09c3-4d21-953a-1466040dc4df","year":2024},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.069983Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:5abb1a9c92d2d2ec0db65b6ef6b8628d283d251c76923bceb7e7c227285b1a80","observation_id":"823e6188-2b6d-42a6-baa5-cb99a8cfedef","resolution":{"observed_at":"2026-08-06T16:21:12.192276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T16:21:12.160863Z","title":"SWE-bench multilingual,","venue":null,"work_id":"7e49e809-e656-4ff6-9dfc-e1e15f9986c8","year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.074685Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:47828934d4853d8b6541a773a97778c4e645dc9532dc3a2b7bf10b05e0014c0f","observation_id":"0d0d1bfe-73b4-4e70-9753-fefd1aec8617","resolution":{"observed_at":"2026-08-06T16:21:12.166668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-06T16:21:11.080197Z","title":"Qwen2.5-Coder technical report,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.080197Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:f1faed1d5f9109c0a840d1e1bbde2f029f8122a5b619e9e94b9c68f8370d2904","observation_id":"6ba785ba-607b-4754-b9aa-fb576a88e69d","resolution":{"observed_at":"2026-08-06T16:21:11.080197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05176","last_updated":"2025-06-11T02:54:49Z","snapshot_observed_at":"2026-08-09T13:23:52.437582Z","submitted_at":"2025-06-05T15:49:48Z","title":"Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05176","snapshot_observed_at":"2026-08-06T16:21:11.084927Z","title":"Qwen3 Embedding: Advancing text embedding and reranking through foundation models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.084927Z"},"links":{"cited_paper":"/paper/2506.05176","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:b6683eeea31e06c56bffa08f65edcb105246fd48cade1cb1cf1ce15f7be8aa7a","observation_id":"9dbfb3ff-041c-4898-bd60-820acf1113aa","resolution":{"observed_at":"2026-08-06T16:21:11.084927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.10925","last_updated":"2025-08-08T19:24:38Z","snapshot_observed_at":"2026-08-01T16:27:35.664983Z","submitted_at":"2025-08-08T19:24:38Z","title":"gpt-oss-120b & gpt-oss-20b Model Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.10925","snapshot_observed_at":"2026-08-06T16:21:11.089911Z","title":"gpt-oss-120b & gpt-oss-20b model card,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.089911Z"},"links":{"cited_paper":"/paper/2508.10925","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:dfd31964eb9d1cbb92fc253db7b5cded77b0ffd2507310dbc3c0d794773928d5","observation_id":"d78d2982-eb55-4525-9653-0ca721e0ac13","resolution":{"observed_at":"2026-08-06T16:21:11.089911Z","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-06T16:21:11.095147Z","title":"Open-SWE-Traces: Advancing dual-mode mul- tilingual distillation for software engineering agents,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.095147Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:f3fe2ef8a19d3559d354ac575bcbaeff2cfe206d16e7661f3a6cf212e01c9b5c","observation_id":"02268a81-3a2e-49cd-b292-34b3efd69bd1","resolution":{"observed_at":"2026-08-06T16:21:11.095147Z","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-06T16:21:12.141491Z","title":"OpenHands Trajectories with Qwen3-Coder-480B-A35B-Instruct,","venue":null,"work_id":"2fa44d76-b910-4806-982b-cd02af888415","year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.101263Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:83ddb8fdafe256b92908a2bb7dc395684a079747aa3169b5a790c0e426e7baaa","observation_id":"d448b95f-b146-488a-9bd3-149a4d16bbcd","resolution":{"observed_at":"2026-08-06T16:21:12.146379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T16:21:12.116503Z","title":"SWE-rebench: An automated pipeline for task collection and decontaminated evaluation of software engineering agents,","venue":null,"work_id":"dc139fe8-1aca-49f9-96a5-6ced8bc86d04","year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.106741Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:a041d627164b18bc299f97d9065ead1bfb0be3830d1347c2be1c51bf7f5a37ec","observation_id":"3d666a44-73fd-4f0e-8e88-4d099dc97afb","resolution":{"observed_at":"2026-08-06T16:21:12.122847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.01496","last_updated":"2026-05-06T00:02:23Z","snapshot_observed_at":"2026-07-06T22:51:35.522923Z","submitted_at":"2026-04-02T00:11:17Z","title":"From SWE-ZERO to SWE-HERO: Execution-free to Execution-based Fine-tuning for Software Engineering Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.01496","snapshot_observed_at":"2026-08-06T16:21:11.112283Z","title":"From SWE-ZERO to SWE-HERO: Execution-free to execution-based fine-tuning for software engineering agents,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.112283Z"},"links":{"cited_paper":"/paper/2604.01496","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:073b1392bb73bef5ddac9cbbc7671b2f6697eb847b83073a2219475cddc15e42","observation_id":"83bbd989-a178-4b82-baba-2bbcd25f3871","resolution":{"observed_at":"2026-08-06T16:21:11.112283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16741","snapshot_observed_at":"2026-08-06T16:21:11.119246Z","title":"OpenHands: An open platform for AI software developers as generalist agents,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.119246Z"},"links":{"cited_paper":"/paper/2407.16741","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:f2c0be9371cfaa50d59588e1f4e881c866e16470cab3e74448c0ca8d4eeb410e","observation_id":"27eff993-cc46-46dd-90e7-746cd5eb21f9","resolution":{"observed_at":"2026-08-06T16:21:11.119246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-07T07:43:16.294957Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-06T16:21:11.126569Z","title":"LoRA: Low-rank adaptation of large lan- guage models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.126569Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:523d0135a50881e84afb26994f7da39059359499267fa89a126dac5bbea8c7aa","observation_id":"72fbcc84-e3f4-482a-ae71-6ab65897163a","resolution":{"observed_at":"2026-08-06T16:21:11.126569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-06T16:21:11.133668Z","title":"DeepSeekMath: Pushing the limits of mathematical reasoning in open language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.133668Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:e09322862165f32ba2bd85837bcc1c43b9c64a7e512689aa0f01f2ddebcba1a2","observation_id":"8529b07d-f629-4470-8c68-040186b283ca","resolution":{"observed_at":"2026-08-06T16:21:11.133668Z","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-06T16:21:12.094758Z","title":"Introducing Claude Opus 4.6,","venue":null,"work_id":"40435546-2edb-4d96-89d3-73707e289056","year":2026},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.141340Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:15121d863c940beafc0bd51b60f71b178789e1b5e926c3fd55161822312362df","observation_id":"3da08b11-821a-4c34-94d8-f46531dfaba5","resolution":{"observed_at":"2026-08-06T16:21:12.102497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T16:21:12.077077Z","title":"Introducing GPT-5.2,","venue":null,"work_id":"675c733c-019f-4bdf-ba2c-fc488d8d8683","year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.147073Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:6363062bce2277d26dbca0e19988f2fc1e05aae63dbfe3c180c46d2434cd2619","observation_id":"4b9bcd93-1fe8-4bf3-ac0f-6524606d081e","resolution":{"observed_at":"2026-08-06T16:21:12.082582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.02276","last_updated":"2026-02-02T16:17:38Z","snapshot_observed_at":"2026-07-06T22:44:09.804048Z","submitted_at":"2026-02-02T16:17:38Z","title":"Kimi K2.5: Visual Agentic Intelligence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.02276","snapshot_observed_at":"2026-08-06T16:21:11.152966Z","title":"Kimi K2.5: Visual agentic intelligence,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.152966Z"},"links":{"cited_paper":"/paper/2602.02276","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:7c07f8b6f25276935c008a933cc0104f550bb0fa2b2d5307b95dcbc77da62e79","observation_id":"df032f04-3e70-4ba2-8409-06a18bb8a60f","resolution":{"observed_at":"2026-08-06T16:21:11.152966Z","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-06T16:21:12.059269Z","title":"Gemini 3 Flash model card,","venue":null,"work_id":"8fcda4ff-0011-40f3-b8f2-9ebc1d392276","year":2025},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.162254Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:c52d9de889dce5c773320354ccb78698b7b6cf1b885640d2abcc3be077bcc107","observation_id":"4e618a04-8d79-459e-adbc-b2c5f599b6c1","resolution":{"observed_at":"2026-08-06T16:21:12.065241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T16:21:11.167792Z","title":"Note on the sampling error of the dif- ference between correlated proportions or percentages,","venue":null,"work_id":null,"year":1947},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.167792Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:21767b653f04b9f7d5cbb6ee9ea0ef27fdbce54c1add3664ebf45046c5cf4ffa","observation_id":"55532fe1-73c6-4071-9efb-2cbd35d93a53","resolution":{"observed_at":"2026-08-06T16:21:11.167792Z","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":"6130.63068","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:21:11.281740Z","title":"Bootstrap methods: Another look at the jackknife,","venue":null,"work_id":"b1f6df79-94fe-4f90-ad64-de6467563b59","year":1979},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.174293Z"},"links":{"citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:6c2819c1ea6c54ce158038048feb076eb77e9af9ed5db56947c5b84fb6fae97e","observation_id":"d9f85322-1a67-4f6d-b45b-c1abc9fb8452","resolution":{"observed_at":"2026-08-06T16:21:11.298429Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-08T23:13:12.927485Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":3,"verified_fuzzy":8},"total_outbound_references":38},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2608.04804."}