{"as_of":"2026-08-20T19:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:574ed0163ca917ab63b0e3682ac93d1b126c8d37bc7e08ee58aa82cec2b79a35","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:36:54.867058Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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.08528/citation-record","integrity":"/paper/2608.08528/integrity","json":"/paper/2608.08528/citation-record.json","paper":"/paper/2608.08528"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.13678","last_updated":"2024-12-18T10:05:43Z","snapshot_observed_at":"2026-08-20T11:16:42.985704Z","submitted_at":"2024-12-18T10:05:43Z","title":"Clio: Privacy-Preserving Insights into Real-World AI Use","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.13678","snapshot_observed_at":"2026-08-14T04:36:54.828736Z","title":"Clio: Privacy-Preserving Insights into Real-World AI Use","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08528","last_updated":"2026-08-09T06:57:53Z","snapshot_observed_at":"2026-08-20T10:59:31.117893Z","submitted_at":"2026-08-09T06:57:53Z","title":"Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T04:36:54.828736Z"},"links":{"cited_paper":"/paper/2412.13678","citing_paper":"/paper/2608.08528"},"observation_digest":"sha256:f9fb456b6e295e71b639f86725bc4e38ecde5436cd2fc2c7b8a3e06eaed777a2","observation_id":"63c66046-de77-4e01-bb1e-5ae669821259","resolution":{"observed_at":"2026-08-14T04:36:54.828736Z","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-08-10T11:59:11.481480Z","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-14T04:36:54.834239Z","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.08528","last_updated":"2026-08-09T06:57:53Z","snapshot_observed_at":"2026-08-20T10:59:31.117893Z","submitted_at":"2026-08-09T06:57:53Z","title":"Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T04:36:54.834239Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2608.08528"},"observation_digest":"sha256:a2bfd79549d3cdf521fbe7de76b72377a78bfdc614b6d71216c9ca0233b075b8","observation_id":"ad59fc0d-6f6e-4021-a26e-001093b13a74","resolution":{"observed_at":"2026-08-14T04:36:54.834239Z","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-08-16T00:08:23.767909Z","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-14T04:36:54.838768Z","title":"RouteLLM: Learning to Route LLMs with Preference Data","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08528","last_updated":"2026-08-09T06:57:53Z","snapshot_observed_at":"2026-08-20T10:59:31.117893Z","submitted_at":"2026-08-09T06:57:53Z","title":"Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T04:36:54.838768Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2608.08528"},"observation_digest":"sha256:a8c4ed6760a21eb9fd6e89d4c267a15c3feb2b2fef3c4832aef215a67b3f6166","observation_id":"4a2c108c-2b01-4375-8d53-6466c124d5d7","resolution":{"observed_at":"2026-08-14T04:36:54.838768Z","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-19T18:40:41.056291Z","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-14T04:36:54.843239Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08528","last_updated":"2026-08-09T06:57:53Z","snapshot_observed_at":"2026-08-20T10:59:31.117893Z","submitted_at":"2026-08-09T06:57:53Z","title":"Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T04:36:54.843239Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2608.08528"},"observation_digest":"sha256:90b902ec8404e0dbbe6641054fe12ca4d5f6c7ad18d05f22677eb2a411dc2135","observation_id":"0e68eff5-f8e7-4635-9969-f8f2c68ee57b","resolution":{"observed_at":"2026-08-14T04:36:54.843239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12963","last_updated":"2025-01-19T15:59:56Z","snapshot_observed_at":"2026-08-19T13:32:11.398338Z","submitted_at":"2023-10-19T17:57:39Z","title":"AutoMix: Automatically Mixing Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12963","snapshot_observed_at":"2026-08-14T04:36:54.849349Z","title":"AutoMix: Automatically Mixing Language Models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.08528","last_updated":"2026-08-09T06:57:53Z","snapshot_observed_at":"2026-08-20T10:59:31.117893Z","submitted_at":"2026-08-09T06:57:53Z","title":"Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T04:36:54.849349Z"},"links":{"cited_paper":"/paper/2310.12963","citing_paper":"/paper/2608.08528"},"observation_digest":"sha256:c802eab763cf5a3503d8c0b7c5eac3f326b3bdee3ddbca75cc9ed9b7dfea5524","observation_id":"5378deae-c700-45fe-8538-ecfab3c8a4c1","resolution":{"observed_at":"2026-08-14T04:36:54.849349Z","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-19T20:05:00.057234Z","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-14T04:36:54.854111Z","title":"Large Language Model Routing with Benchmark Datasets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.08528","last_updated":"2026-08-09T06:57:53Z","snapshot_observed_at":"2026-08-20T10:59:31.117893Z","submitted_at":"2026-08-09T06:57:53Z","title":"Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T04:36:54.854111Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2608.08528"},"observation_digest":"sha256:23b7a9ae31b3811b8e61e4dee8f695c7dc1c7e4cc60170b85c068d74c52007a8","observation_id":"2f57e2d6-804d-47f0-98e9-a51b9c707e97","resolution":{"observed_at":"2026-08-14T04:36:54.854111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06770","last_updated":"2024-11-11T23:05:04Z","snapshot_observed_at":"2026-08-18T08:11:45.716032Z","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-14T04:36:54.858945Z","title":"SWE-bench: Can Language Models Resolve Real-World GitHub Issues? ICLR; arXiv:2310.06770, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.08528","last_updated":"2026-08-09T06:57:53Z","snapshot_observed_at":"2026-08-20T10:59:31.117893Z","submitted_at":"2026-08-09T06:57:53Z","title":"Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T04:36:54.858945Z"},"links":{"cited_paper":"/paper/2310.06770","citing_paper":"/paper/2608.08528"},"observation_digest":"sha256:d61800748e75b6a9e9b049af69ed61897fdf3e545e8d4e2aebce1ffdbd2925b2","observation_id":"8fab5987-9bca-4616-a59f-3101c50d39a4","resolution":{"observed_at":"2026-08-14T04:36:54.858945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-14T04:36:54.862952Z","title":"Evaluating Large Language Models Trained on Code","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.08528","last_updated":"2026-08-09T06:57:53Z","snapshot_observed_at":"2026-08-20T10:59:31.117893Z","submitted_at":"2026-08-09T06:57:53Z","title":"Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T04:36:54.862952Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2608.08528"},"observation_digest":"sha256:f7a78d34902d556a1eb604d7362742b1123c726810780b979e2a27bbcd33757f","observation_id":"6be76008-de74-4409-8fb3-2880aecad84c","resolution":{"observed_at":"2026-08-14T04:36:54.862952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05685","last_updated":"2023-12-24T02:01:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-09T05:55:52Z","title":"Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05685","snapshot_observed_at":"2026-08-14T04:36:54.867058Z","title":"Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.08528","last_updated":"2026-08-09T06:57:53Z","snapshot_observed_at":"2026-08-20T10:59:31.117893Z","submitted_at":"2026-08-09T06:57:53Z","title":"Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T04:36:54.867058Z"},"links":{"cited_paper":"/paper/2306.05685","citing_paper":"/paper/2608.08528"},"observation_digest":"sha256:0dc419d5e46ff79875361637364004da97f923e08d06df7cfa1771b74cd97fdd","observation_id":"08e113c1-146d-40cc-95a6-c3ab85dd38f0","resolution":{"observed_at":"2026-08-14T04:36:54.867058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.08528","last_updated":"2026-08-09T06:57:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T10:59:31.117893Z","submitted_at":"2026-08-09T06:57:53Z","title":"Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":9},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2608.08528."}