{"as_of":"2026-08-08T16:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97f86704f4ea192790dc7718c5e50fa4a07f5b2afa76cc67b7eb72b118a5e808","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:30:43.732528Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T08:40:40.910461Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T08:40:41.966992Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"cited_work":{"arxiv_id":"2506.10525","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.10525","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Adaptivellm: A framework for selecting optimal cost-efficient llm for code-generation based on cot length","venue":null,"work_id":"c1ffed3c-badb-4a1a-8788-fdacd3bdc543","year":2025},"citing_paper":{"arxiv_id":"2503.09567","last_updated":"2025-07-18T15:57:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-12T17:35:03Z","title":"Towards Reasoning Era: A Survey of Long Chain-of-Thought for Reasoning Large Language Models","version":5},"reference_index":122,"source":"pdf_text","source_observed_at":"2026-05-12T08:40:40.910461Z"},"links":{"cited_paper":"/paper/2506.10525","citing_paper":"/paper/2503.09567"},"observation_digest":"sha256:6bf5b4abd0d1de80ee60f42592da65e872af9b4e9edd3f91109c64cffba09cf6","observation_id":"3ccab821-797d-4115-8d18-3b5c0b0c7ee5","resolution":{"observed_at":"2026-05-12T08:40:41.969888Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.10525/citation-record","integrity":"/paper/2506.10525/integrity","json":"/paper/2506.10525/citation-record.json","paper":"/paper/2506.10525"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T04:30:43.300900Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.300900Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:92728202d8869bb343c13a2118f98043ed25e1d3e57de31f98468c479e131036","observation_id":"a6d41adf-9003-4efc-96ae-f4abbe5d2c83","resolution":{"observed_at":"2026-08-07T04:30:43.300900Z","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-07T04:30:44.275632Z","title":null,"venue":null,"work_id":"496798ed-9ced-4b34-91cf-8d1edcaf8a89","year":2009},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.430145Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:19e39ee71cd5e371d2706047c9ab8d0b3c2b7e040a3f195c41b02f91516fe188","observation_id":"085ca784-ec07-4589-b0cc-2bf9fe381f41","resolution":{"observed_at":"2026-08-07T04:30:44.278749Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T04:30:44.264914Z","title":null,"venue":null,"work_id":"627f38dd-709d-49b3-aedf-dc567c9953fd","year":2015},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.546177Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:46f19a2c783c1d13c2d129694078be86294a71176864a4a67224568b1c98929d","observation_id":"181e9b3c-fc3a-4b65-9044-177b531fd61c","resolution":{"observed_at":"2026-08-07T04:30:44.268418Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T04:30:44.255880Z","title":null,"venue":null,"work_id":"1f107feb-0e83-4f61-8d3a-0d786e16ed54","year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.565379Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:4b2df532bd13654182d30237f82cb74e24b15e95cc47a0ac16509cb529a7c4e9","observation_id":"56bbef96-b376-4315-a59a-d1194ce03380","resolution":{"observed_at":"2026-08-07T04:30:44.258973Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T04:30:44.246149Z","title":null,"venue":null,"work_id":"7fbbd5c9-8c21-4bf9-bead-5dcb8b3f36ca","year":2021},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.576830Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:3d955256925a3232a7a8456ba8f46a78c6f68c1ac1a3cfb5e6eb19b0b905b164","observation_id":"080400c4-9199-44c4-80eb-043eaab6b485","resolution":{"observed_at":"2026-08-07T04:30:44.249433Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11511","last_updated":"2024-10-15T02:09:04Z","snapshot_observed_at":"2026-07-06T17:04:50.608413Z","submitted_at":"2023-12-12T05:38:55Z","title":"ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11511","snapshot_observed_at":"2026-08-07T04:30:43.582129Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.582129Z"},"links":{"cited_paper":"/paper/2312.11511","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:c324a4b8a008ac089f0d5bad4377f26fe0b6caaf2841ff87b3f556374c3284e1","observation_id":"58c29299-0afa-46c1-91e1-7908038b11d8","resolution":{"observed_at":"2026-08-07T04:30:43.582129Z","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-07T04:30:43.585439Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.585439Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:728cf15d822284217e9c38859468df1b598a1d8ff7efc4bc9b6878943d9c1b60","observation_id":"d69930fc-f4f2-4837-a143-7100ec5c7fe3","resolution":{"observed_at":"2026-08-07T04:30:43.585439Z","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-07T04:30:44.229509Z","title":null,"venue":null,"work_id":"4d85dc80-1c4f-40aa-8cbf-4321d7b61319","year":2018},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.588042Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:d1701d6af0319a111c83e799b0ca07c94ff1f223c6583adc4e8eaf595fd62008","observation_id":"25feb3ce-8b89-42e1-bcae-079939d47858","resolution":{"observed_at":"2026-08-07T04:30:44.233221Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.08227","last_updated":"2022-12-19T10:30:12Z","snapshot_observed_at":"2026-07-06T13:42:40.131502Z","submitted_at":"2022-08-17T11:16:52Z","title":"MultiPL-E: A Scalable and Extensible Approach to Benchmarking Neural Code Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.08227","snapshot_observed_at":"2026-08-07T04:30:43.590827Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.590827Z"},"links":{"cited_paper":"/paper/2208.08227","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:157a6f333228e5c94a9a246e4203ad26034c67c6b58cec8ce021a383aa08b2b7","observation_id":"d7019c4b-ba3f-410e-a2fa-98961a55c0e3","resolution":{"observed_at":"2026-08-07T04:30:43.590827Z","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-07T04:30:43.593849Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.593849Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:0ea01f8165925d5552fd427d95ecb82049fbf46c66a6cc743e8f0b56a40cbba3","observation_id":"92d62d8b-3b14-4b96-9898-2fe10eef2b7a","resolution":{"observed_at":"2026-08-07T04:30:43.593849Z","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-07T04:30:43.597123Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.597123Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:f61b3c4ab6fefbc3c3705bacee0d40455537e604c0bf2dea8afefaa80f3385cb","observation_id":"edd0a937-333b-4642-9e55-eb752022975f","resolution":{"observed_at":"2026-08-07T04:30:43.597123Z","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-07T04:30:44.220103Z","title":null,"venue":null,"work_id":"f479f599-f1f5-4ff5-83ea-8bbaf508fa2b","year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.599996Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:3f193ffaaa0d7be8da53504d27426f8f56ff9f1febdc010767db56a7535c71c9","observation_id":"ce330976-62e4-4c45-a122-be0549cd89c5","resolution":{"observed_at":"2026-08-07T04:30:44.223518Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T04:30:43.602644Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.602644Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:5984b875538bdce01318f0cdb5beefddd2ca8462e68e22820f899a428653e696","observation_id":"7c2eb538-bc52-4b94-8ea3-f5488ab8d1b7","resolution":{"observed_at":"2026-08-07T04:30:43.602644Z","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-07T04:30:44.202979Z","title":null,"venue":null,"work_id":"1d42770b-13ba-423e-bf1c-dd8469775e48","year":2018},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.605268Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:a021cbca4b11d3edf14b9d34a4488e4135250c4e43178d4584cc54484881f588","observation_id":"8b262a59-c24a-4bd7-bf3f-1c216af475e9","resolution":{"observed_at":"2026-08-07T04:30:44.207216Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T04:30:44.193254Z","title":null,"venue":null,"work_id":"621aa953-33c8-4847-ae3f-8996b775ad15","year":2016},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.607616Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:0150f20c96b0e0698c509b06f47f9c48f3ff9cef2d45c05e31059eff88f35692","observation_id":"53f4c308-0197-49a2-8071-825db8eaee08","resolution":{"observed_at":"2026-08-07T04:30:44.196873Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08155","last_updated":"2020-09-18T15:38:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-02-19T13:09:07Z","title":"CodeBERT: A Pre-Trained Model for Programming and Natural Languages","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08155","snapshot_observed_at":"2026-08-07T04:30:43.610078Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.610078Z"},"links":{"cited_paper":"/paper/2002.08155","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:3a6c4f0c3acd2ef2030f97371a3d22d4d11867d8103d04c0260591b9351c4009","observation_id":"93b1f274-69b1-47fd-bce9-1788d8f777be","resolution":{"observed_at":"2026-08-07T04:30:43.610078Z","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-07T04:30:44.181966Z","title":null,"venue":null,"work_id":"e0604ef1-c032-4968-be0c-07a04987c50f","year":2021},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.612976Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:7b1541c26f14178a49aeed648e80c9607f808f897927f80aeb7e4de48006934d","observation_id":"245272a0-dde3-41bd-aa09-5c90b0a76eb9","resolution":{"observed_at":"2026-08-07T04:30:44.186016Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T04:30:43.615874Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.615874Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:0faedd04b3a94011f81e35f224520f7c4b8e4418d215e983e2bc17c89c6fa453","observation_id":"a6d507ab-7111-45cc-a462-6226fcbe8cfb","resolution":{"observed_at":"2026-08-07T04:30:43.615874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-07T04:30:43.618685Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.618685Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:ed7d08da3fbf69121a323a29a029fa6c51af843e74cf190370159c7cedf3bee8","observation_id":"f4ca2098-8333-409f-adec-9f7189fac41e","resolution":{"observed_at":"2026-08-07T04:30:43.618685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14196","last_updated":"2024-01-26T09:23:11Z","snapshot_observed_at":"2026-08-06T22:40:28.707813Z","submitted_at":"2024-01-25T14:17:53Z","title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.14196","snapshot_observed_at":"2026-08-07T04:30:43.621198Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.621198Z"},"links":{"cited_paper":"/paper/2401.14196","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:dd33a6d80051fdc787c700505f2caa11debe87a41a1d56aa4c81260910384e05","observation_id":"b034d4d6-8ffc-4734-bf5e-47a1c9d05c2b","resolution":{"observed_at":"2026-08-07T04:30:43.621198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10136","last_updated":"2024-04-15T21:02:48Z","snapshot_observed_at":"2026-08-04T20:44:47.423981Z","submitted_at":"2024-04-15T21:02:48Z","title":"Language Model Cascades: Token-level uncertainty and beyond","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.10136","snapshot_observed_at":"2026-08-07T04:30:43.623890Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.623890Z"},"links":{"cited_paper":"/paper/2404.10136","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:49c2c083025878836cb93ae52fb4cdfda2401e065d0b882a6d4c57204ccfcfc8","observation_id":"b407d3de-efad-4227-b031-c7652a78dd28","resolution":{"observed_at":"2026-08-07T04:30:43.623890Z","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-07T04:30:44.172791Z","title":null,"venue":null,"work_id":"d47a038a-c293-466b-9d8d-3930c139260f","year":2017},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.626419Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:6b4e1880392038c45fc8d3338b5d76b9a98638c7e1d96e8fd8d47f0a5be85795","observation_id":"b89f800a-d10e-49e1-af3a-f17bcfa6d4ea","resolution":{"observed_at":"2026-08-07T04:30:44.176154Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T04:30:44.163437Z","title":null,"venue":null,"work_id":"9b739f2c-fe7d-461f-8a9d-76cba8bd4cca","year":2015},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.628950Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:1738808f3b9beb308ef9189539515339247b6857fa2b44577984d8db1e946c0f","observation_id":"5e4780ae-9de9-4892-a7e0-2ad823c7d0ec","resolution":{"observed_at":"2026-08-07T04:30:44.166461Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T04:30:43.631402Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.631402Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:e696b8e245b6a71a2dd854bf11dfb97650cd4b80fe94a9568e5fa959678688cb","observation_id":"740f8f4d-9ffc-40a9-aaa6-3bf02bc37561","resolution":{"observed_at":"2026-08-07T04:30:43.631402Z","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-07T04:30:43.634336Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.634336Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:7efba3c0d68b71b40306134a1adb22a403307b1282b4f840551d7d83afe97e8b","observation_id":"a7a7b159-4077-40c5-8c41-283cbaa1fa1c","resolution":{"observed_at":"2026-08-07T04:30:43.634336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.02561","last_updated":"2023-06-30T21:39:54Z","snapshot_observed_at":"2026-08-05T15:27:19.717152Z","submitted_at":"2023-06-05T03:32:26Z","title":"LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusion","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.02561","snapshot_observed_at":"2026-08-07T04:30:43.639675Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.639675Z"},"links":{"cited_paper":"/paper/2306.02561","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:ec419ad98093fefcf55a21ba4226eba06cd5f1aaa5ed8a0e64933fc4dc57bc71","observation_id":"38c27a63-7aab-4904-91fd-52fa2f6f72cc","resolution":{"observed_at":"2026-08-07T04:30:43.639675Z","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-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-07T04:30:43.642302Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.642302Z"},"links":{"cited_paper":"/paper/2310.06770","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:a19fc2388dc2b06dfc531f23613a1339ee75b631e0a21677e6fa8440ecc4b59f","observation_id":"b5b5bbf8-09d7-4c79-b561-3896ca3d8954","resolution":{"observed_at":"2026-08-07T04:30:43.642302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.01220","last_updated":"2024-05-23T17:27:12Z","snapshot_observed_at":"2026-07-06T15:36:56.786182Z","submitted_at":"2023-06-02T00:57:03Z","title":"Do Large Language Models Pay Similar Attention Like Human Programmers When Generating Code?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.01220","snapshot_observed_at":"2026-08-07T04:30:43.645255Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.645255Z"},"links":{"cited_paper":"/paper/2306.01220","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:a383368672e007451bb652c07ca8a7af63fac5f542907f9cba64a5793b867cd1","observation_id":"2d98c8f2-cb62-4d1f-9b53-0535dd8758cc","resolution":{"observed_at":"2026-08-07T04:30:43.645255Z","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-07T04:30:43.648066Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.648066Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:17b4a17464af0260b28970b7c7960a751fa5ad591d1d130bbbf741ffab27d5e6","observation_id":"c84b1aed-5527-4a07-99d0-31ba94f60efd","resolution":{"observed_at":"2026-08-07T04:30:43.648066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04434","last_updated":"2024-06-19T06:04:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-07T15:56:43Z","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04434","snapshot_observed_at":"2026-08-07T04:30:43.650633Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.650633Z"},"links":{"cited_paper":"/paper/2405.04434","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:7e946d01e838844303cfb8d0f4ffa47d4fc99179b431a7fc5b54f933664e4f73","observation_id":"ff3db786-fd0f-452c-a8b1-029ef1b21dd0","resolution":{"observed_at":"2026-08-07T04:30:43.650633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-07T04:30:43.653562Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.653562Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:f3d9f0723e16b162d9182253ef67a3a419a9bad4a1d4ef7d5ae42db30d4da75a","observation_id":"3f0b7629-f38b-47a7-aa3a-d9435ac079ba","resolution":{"observed_at":"2026-08-07T04:30:43.653562Z","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-07T04:30:43.656174Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.656174Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:ab87b32ecb30ce0af8301c6b2e0f169c8265be2a3d2e2af41c16e1ef6739ece4","observation_id":"ce55d222-9e74-4001-9191-381bc053aa64","resolution":{"observed_at":"2026-08-07T04:30:43.656174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00535","last_updated":"2025-05-12T10:24:14Z","snapshot_observed_at":"2026-07-06T19:59:28.832182Z","submitted_at":"2024-11-30T16:58:42Z","title":"FullStack Bench: Evaluating LLMs as Full Stack Coders","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00535","snapshot_observed_at":"2026-08-07T04:30:43.658947Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.658947Z"},"links":{"cited_paper":"/paper/2412.00535","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:ca17cdd15506a718b68c86208fdeb2da0ebe8a64b37ab51e2e43c989e6aad0f0","observation_id":"4e68e30d-277c-49e1-95bf-b374a7ea367d","resolution":{"observed_at":"2026-08-07T04:30:43.658947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.19173","last_updated":"2024-02-29T13:53:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-29T13:53:35Z","title":"StarCoder 2 and The Stack v2: The Next Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19173","snapshot_observed_at":"2026-08-07T04:30:43.661632Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.661632Z"},"links":{"cited_paper":"/paper/2402.19173","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:0962d49dc95b523466c06d2d28a1fc970f1e9a07a5a9ca7287cde592ff05aac4","observation_id":"6f044a43-55fa-4252-a4d9-595f70fb8249","resolution":{"observed_at":"2026-08-07T04:30:43.661632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09583","last_updated":"2025-06-04T08:58:56Z","snapshot_observed_at":"2026-08-02T06:48:43.121988Z","submitted_at":"2023-08-18T14:23:21Z","title":"WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instruct","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09583","snapshot_observed_at":"2026-08-07T04:30:43.664154Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.664154Z"},"links":{"cited_paper":"/paper/2308.09583","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:556ccb88d1104c76b64cdc025ec483e7c671275ccf7e9b8f0b32621e13900d6f","observation_id":"bd49d803-f4e7-4f44-9eed-4e88660907a9","resolution":{"observed_at":"2026-08-07T04:30:43.664154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10511","last_updated":"2023-07-02T07:21:59Z","snapshot_observed_at":"2026-07-06T14:33:08.041820Z","submitted_at":"2022-12-20T18:30:15Z","title":"When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memories","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10511","snapshot_observed_at":"2026-08-07T04:30:43.667045Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.667045Z"},"links":{"cited_paper":"/paper/2212.10511","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:a92a29d1d5421b489e235aa1468d8319a584cc39d08a0eeef9806559826ba581","observation_id":"32edd287-44c9-4c67-aa65-b888d08bd87a","resolution":{"observed_at":"2026-08-07T04:30:43.667045Z","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-07T04:30:44.138368Z","title":null,"venue":null,"work_id":"195fe30d-7496-4fa7-bc27-b457c7e176fd","year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.670025Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:a0c55d591f75ead4d8fb209ce00ac86575d99e01c388f0e6b29d6eb74b524e54","observation_id":"42128702-f35f-4589-9f32-d278006f71c6","resolution":{"observed_at":"2026-08-07T04:30:44.142156Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-07-06T06:49:24.960992Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-07T04:30:43.672608Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.672608Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:0288d9c96ec506aab0c76ece9b60db0f6b7c44d2e5b1b150c7ed67341a3fe6bf","observation_id":"00982c16-3aa2-4f64-8f00-cafb8c3066b7","resolution":{"observed_at":"2026-08-07T04:30:43.672608Z","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-07T04:30:44.127963Z","title":null,"venue":null,"work_id":"8ae738e9-5be1-4a83-b568-de3d5b01446b","year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.675280Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:db2339d2706d6c9a33a5c84d3c3142dbc245f779c54a7669d108863fea2e072a","observation_id":"319037ad-95de-44ac-a5e9-e9c2444920c2","resolution":{"observed_at":"2026-08-07T04:30:44.131542Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T04:30:44.118819Z","title":null,"venue":null,"work_id":"52e470c5-6c08-4fa6-9422-8534d3f66467","year":2025},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.677637Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:68bdacb2a86640dbb31b1de160ea8ec86f0e03030d2ae61d714cd1bccd427662","observation_id":"3c311e54-140c-401e-b012-4c4ab196a9b8","resolution":{"observed_at":"2026-08-07T04:30:44.122150Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T04:30:44.108691Z","title":null,"venue":null,"work_id":"daf0fddf-a608-4dfb-bcfe-6a2c960710d8","year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.680205Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:425a9293b6ee49285557d8c45d98949c5e0420b593569f27ffe0a672db449de8","observation_id":"3e780167-c7f0-458a-8aa0-4d5f37817028","resolution":{"observed_at":"2026-08-07T04:30:44.112956Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T04:30:43.682950Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.682950Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:b85369ecea1b1240fdd29f81e623342750b089f379079ee08b39e30529eb1e38","observation_id":"2ff70853-156d-4456-9d79-edd42e2d9209","resolution":{"observed_at":"2026-08-07T04:30:43.682950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-07-06T16:10:07.931347Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-07T04:30:43.685864Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.685864Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:e8e6931ac7a58d51b7cef32f33f898eb91d578172a5e0c12091f92d63392e9d9","observation_id":"1bb8b34d-2271-4f63-932d-c787bf8e5539","resolution":{"observed_at":"2026-08-07T04:30:43.685864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05530","last_updated":"2024-12-16T17:39:39Z","snapshot_observed_at":"2026-07-06T17:41:42.995949Z","submitted_at":"2024-03-08T18:54:20Z","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.05530","snapshot_observed_at":"2026-08-07T04:30:43.689526Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.689526Z"},"links":{"cited_paper":"/paper/2403.05530","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:a970a047c0849a1ccb425bccc16a6719bad87f08890f7ea638c438a3def25a6e","observation_id":"3b92a9bf-855c-4519-9e93-e78c559616f0","resolution":{"observed_at":"2026-08-07T04:30:43.689526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.08295","last_updated":"2024-04-16T12:52:47Z","snapshot_observed_at":"2026-08-03T03:29:01.959523Z","submitted_at":"2024-03-13T06:59:16Z","title":"Gemma: Open Models Based on Gemini Research and Technology","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.08295","snapshot_observed_at":"2026-08-07T04:30:43.692536Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.692536Z"},"links":{"cited_paper":"/paper/2403.08295","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:7521bdfdee90d4504689117e53f101e8066bb9cd7225448283b19eaf675a4046","observation_id":"e32e607b-e44d-4e50-87db-0ff058070d3b","resolution":{"observed_at":"2026-08-07T04:30:43.692536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12599","last_updated":"2025-06-03T02:14:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T02:48:14Z","title":"Kimi k1.5: Scaling Reinforcement Learning with LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12599","snapshot_observed_at":"2026-08-07T04:30:43.695588Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.695588Z"},"links":{"cited_paper":"/paper/2501.12599","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:24eeb95ee7e4912a3207818c59d39d57c403dd2835f13ec198279bdc678eaaaf","observation_id":"b930f33c-fd93-46a0-9a66-acd38f40e671","resolution":{"observed_at":"2026-08-07T04:30:43.695588Z","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-07T04:30:44.093919Z","title":null,"venue":null,"work_id":"6118098d-9d60-44eb-bea1-7f9175771971","year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.698655Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:2119e4a8985f62bc7081679b3c3df1075eee43daa98b082a4b79d87ee7fe983e","observation_id":"4b23d8fb-f22b-4b5e-b1c4-9cdf380063ca","resolution":{"observed_at":"2026-08-07T04:30:44.097420Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-07T04:30:43.701638Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.701638Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:64e8035d9d764e64478159fa5829117ed3c7f65f13d62bbae4c73d0fa37418c3","observation_id":"e9643e6f-418d-45ef-adfa-f068a8990bea","resolution":{"observed_at":"2026-08-07T04:30:43.701638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.16416","last_updated":"2024-09-24T19:28:55Z","snapshot_observed_at":"2026-07-06T19:21:25.132336Z","submitted_at":"2024-09-24T19:28:55Z","title":"Selection of Prompt Engineering Techniques for Code Generation through Predicting Code Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.16416","snapshot_observed_at":"2026-08-07T04:30:43.704737Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.704737Z"},"links":{"cited_paper":"/paper/2409.16416","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:8f8f2e39bfd276511aa073a248f39c560347634f808889ef64decdd89a55a840","observation_id":"25c25e3a-7ab5-4e77-957f-277fca33f16d","resolution":{"observed_at":"2026-08-07T04:30:43.704737Z","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-07T04:30:43.707591Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.707591Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:afb06f001f4c31a47f19dfbc05d702a89860b01612b26fcfb989d7d9cb22bc1e","observation_id":"f20e54fe-6374-44c8-b590-6e6eb016213e","resolution":{"observed_at":"2026-08-07T04:30:43.707591Z","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-07T04:30:44.067545Z","title":null,"venue":null,"work_id":"89e8a898-6319-42ed-9c64-2fbd479981b5","year":2001},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.712993Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:764a2dd098e479d80c04ad4bf65d6d067754c3724af04df82593eb0822f0faa1","observation_id":"2cfef98e-b375-4b95-8323-89889a61895d","resolution":{"observed_at":"2026-08-07T04:30:44.071763Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-07T04:30:43.715452Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.715452Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:8c961febfb32096b877616eb93e80c5a74b03c27165fcda2a5fa248c81cd73c1","observation_id":"b8d7e6f9-d2ad-41d4-9f89-a20754e104b0","resolution":{"observed_at":"2026-08-07T04:30:43.715452Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12122","last_updated":"2024-09-18T16:45:37Z","snapshot_observed_at":"2026-07-06T19:17:41.512834Z","submitted_at":"2024-09-18T16:45:37Z","title":"Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvement","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12122","snapshot_observed_at":"2026-08-07T04:30:43.718419Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.718419Z"},"links":{"cited_paper":"/paper/2409.12122","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:10763366ef7a498526a78c8f3a5ff07294a67ceb77483262f556f49dca838d2d","observation_id":"3de8bf67-c0f0-4809-8d89-109eea562b45","resolution":{"observed_at":"2026-08-07T04:30:43.718419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04652","last_updated":"2025-01-21T10:12:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-03-07T16:52:49Z","title":"Yi: Open Foundation Models by 01.AI","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.04652","snapshot_observed_at":"2026-08-07T04:30:43.721019Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.721019Z"},"links":{"cited_paper":"/paper/2403.04652","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:001420cd5fae507a999c1e5308f1fa099c6db20250db7b0e5c91507650f20a8a","observation_id":"ca3ebee5-37d8-4145-b92e-2765831549a9","resolution":{"observed_at":"2026-08-07T04:30:43.721019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.12284","last_updated":"2024-05-03T17:36:07Z","snapshot_observed_at":"2026-08-02T15:00:50.388422Z","submitted_at":"2023-09-21T17:45:42Z","title":"MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.12284","snapshot_observed_at":"2026-08-07T04:30:43.723767Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.723767Z"},"links":{"cited_paper":"/paper/2309.12284","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:b4e9b247361aa02415b68e91fb1594d094602b08ca80b28d822c014f402ae5a6","observation_id":"231a6897-843b-4d50-bad0-1cf99c1ea2ae","resolution":{"observed_at":"2026-08-07T04:30:43.723767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03094","last_updated":"2024-02-08T22:02:22Z","snapshot_observed_at":"2026-08-06T02:17:36.856108Z","submitted_at":"2023-10-04T18:21:17Z","title":"Large Language Model Cascades with Mixture of Thoughts Representations for Cost-efficient Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03094","snapshot_observed_at":"2026-08-07T04:30:43.727123Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.727123Z"},"links":{"cited_paper":"/paper/2310.03094","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:b059c35e83cce3d9fff4572adec038ca9b7aad13fc20a8c0fee9920a3ad5012f","observation_id":"eae85b95-1cc1-44ad-964a-a3da894f18e1","resolution":{"observed_at":"2026-08-07T04:30:43.727123Z","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-07T04:30:44.056341Z","title":null,"venue":null,"work_id":"2a0261dd-5e68-48a2-8a42-84dd8186780a","year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.730009Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:ee940f78d60c585f253a8ae75f717c6c03f8200a89140e1d8d2c6134a10293da","observation_id":"bb07e68d-d2ab-4062-bcb6-f87f4f21e081","resolution":{"observed_at":"2026-08-07T04:30:44.060622Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11931","last_updated":"2024-06-17T13:51:35Z","snapshot_observed_at":"2026-08-07T06:30:25.302107Z","submitted_at":"2024-06-17T13:51:35Z","title":"DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11931","snapshot_observed_at":"2026-08-07T04:30:43.732528Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.732528Z"},"links":{"cited_paper":"/paper/2406.11931","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:3dcb38c2ffe780744c01fdee7de4369da05c6941b32ac391f3b5e0b5b2b55b59","observation_id":"de1b0651-0b12-440d-9045-b5403c4351d6","resolution":{"observed_at":"2026-08-07T04:30:43.732528Z","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-07T04:30:44.077923Z","title":"InProceedings of the 44th International Conference on Software Engineering","venue":null,"work_id":"cda7f6ff-e58e-404a-a93e-83d83a999a0e","year":null},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.710396Z"},"links":{"citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:9807b3a3188cd34734288dde706d308e69c1d77492dcedd30c689b20ac13744d","observation_id":"9feef7df-bea4-4c2f-bd73-a41ef18d0074","resolution":{"observed_at":"2026-08-07T04:30:44.081970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14403","last_updated":"2024-03-28T06:45:11Z","snapshot_observed_at":"2026-08-04T09:23:59.079378Z","submitted_at":"2024-03-21T13:52:30Z","title":"Adaptive-RAG: Learning to Adapt Retrieval-Augmented Large Language Models through Question Complexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14403","snapshot_observed_at":"2026-08-07T04:30:43.637029Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.637029Z"},"links":{"cited_paper":"/paper/2403.14403","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:1a9011d2b370a208083b28ab259ca4be6968029572f13c85a6aadfc953573fea","observation_id":"833ed143-18c0-4c71-a32b-3604d6225d84","resolution":{"observed_at":"2026-08-07T04:30:43.637029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-07T22:00:10.464035Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":59,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":60},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 1 inbound Pith citation observation for arXiv:2506.10525."}