{"as_of":"2026-08-09T04:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbf821da02d7c7835eab5a0a5ad2a79717773f2c48c2f911ab870543bfdff163","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T18:37:58.966197Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-11T02:14:55.216480Z","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-11T19:56:09.066478Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"cited_work":{"arxiv_id":"2509.09864","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.09864","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Neharika Jali, Anupam Nayak, and Gauri Joshi","venue":null,"work_id":"ba3a3fd9-ba43-479e-9890-2f779b860f8b","year":null},"citing_paper":{"arxiv_id":"2605.06110","last_updated":"2026-05-08T14:07:34Z","snapshot_observed_at":"2026-08-08T09:29:34.106054Z","submitted_at":"2026-05-07T12:24:21Z","title":"On Time, Within Budget: Constraint-Driven Online Resource Allocation for Agentic Workflows","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T10:39:39.482599Z"},"links":{"cited_paper":"/paper/2509.09864","citing_paper":"/paper/2605.06110"},"observation_digest":"sha256:8168d1fb428f6fe71716844b4aa5bfbb31112bba205e3114d6d7d47777ed7d6e","observation_id":"3dc14d54-31ea-4523-abca-c55360ff8198","resolution":{"observed_at":"2026-05-11T19:56:09.071718Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"cited_work":{"arxiv_id":"2509.09864","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.09864","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Neharika Jali, Anupam Nayak, and Gauri Joshi","venue":null,"work_id":"ba3a3fd9-ba43-479e-9890-2f779b860f8b","year":null},"citing_paper":{"arxiv_id":"2605.06110","last_updated":"2026-05-08T14:07:34Z","snapshot_observed_at":"2026-08-08T09:29:34.106054Z","submitted_at":"2026-05-07T12:24:21Z","title":"On Time, Within Budget: Constraint-Driven Online Resource Allocation for Agentic Workflows","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-11T02:14:55.216480Z"},"links":{"cited_paper":"/paper/2509.09864","citing_paper":"/paper/2605.06110"},"observation_digest":"sha256:5e4c2e45c582cfc39c9dc367148d458c34184a4ec6d5f827ab64a2054d0da84c","observation_id":"e50f9d31-95fd-4eab-a908-4cb69917e026","resolution":{"observed_at":"2026-05-11T03:50:55.007607Z","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/2509.09864/citation-record","integrity":"/paper/2509.09864/integrity","json":"/paper/2509.09864/citation-record.json","paper":"/paper/2509.09864"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:37:58.919848Z","title":"Optimal policy minimum bayesian risk.arXiv preprint arXiv:2505.17242,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.919848Z"},"links":{"citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:bbdb9139601380ba6c7ab1f90e8ab0762ced018f4e8900fb660314bd6468ffb3","observation_id":"5acd07e2-c1d1-453e-8e72-1229c9419162","resolution":{"observed_at":"2026-08-04T18:37:58.919848Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-08-06T21:57:22.791105Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.22716","snapshot_observed_at":"2026-08-04T18:37:58.931386Z","title":"Best-route: Adaptive llm routing with test-time optimal compute.arXiv preprint arXiv:2506.22716,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.931386Z"},"links":{"cited_paper":"/paper/2506.22716","citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:4b009cacfea4fd293c299e8d2f3f4295482b6512fcbff0dc28811d33421c4cb0","observation_id":"4edfac5e-441f-46b9-8da6-0f949d252f5e","resolution":{"observed_at":"2026-08-04T18:37:58.931386Z","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-04T18:37:58.934810Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning.arXiv preprint arXiv:2501.12948,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.934810Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:f88e5aae1916a5414d1051d0835bccade5212582aba71a357cbe7ad3dc1da154","observation_id":"2117a44b-e616-4c6c-a539-2aeaa5fc8b4c","resolution":{"observed_at":"2026-08-04T18:37:58.934810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12031","last_updated":"2024-03-28T17:56:28Z","snapshot_observed_at":"2026-07-06T17:46:29.153377Z","submitted_at":"2024-03-18T17:59:04Z","title":"RouterBench: A Benchmark for Multi-LLM Routing System","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12031","snapshot_observed_at":"2026-08-04T18:37:58.938132Z","title":"Routerbench: A benchmark for multi-llm routing system.arXiv preprint arXiv:2403.12031,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.938132Z"},"links":{"cited_paper":"/paper/2403.12031","citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:df8035a578ad7081db45a2b326f119d3bb22f66aa96eb2a9f89517fca8f1ae24","observation_id":"50f2bdc7-61cb-45bb-88f6-6061eb0cfa68","resolution":{"observed_at":"2026-08-04T18:37:58.938132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18665","last_updated":"2025-02-23T08:50:33Z","snapshot_observed_at":"2026-07-30T15:06:18.011623Z","submitted_at":"2024-06-26T18:10:22Z","title":"RouteLLM: Learning to Route LLMs with Preference Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18665","snapshot_observed_at":"2026-08-04T18:37:58.941919Z","title":"Isaac Ong, Amjad Almahairi, Vincent Wu, Wei-Lin Chiang, Tianhao Wu, Joseph E Gonzalez, M Waleed Kadous, and Ion Stoica","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.941919Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:ce15dba6120819c21f7566dd1281cd63643f90c40be8849c26159c0b1680eda8","observation_id":"74dd0f9a-df63-405d-97d0-6b6bf5643719","resolution":{"observed_at":"2026-08-04T18:37:58.941919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-04T18:37:58.945314Z","title":"The openai o1 system card.arXiv preprint arXiv:2412.16720,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.945314Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:d1a042e826dfac167c42cd3ec4f99acfd130a1cd84fc25dc2b3ccab751c045d5","observation_id":"b9be7044-9b12-4f4f-8767-4d93df13d252","resolution":{"observed_at":"2026-08-04T18:37:58.945314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11366","last_updated":"2023-10-10T05:21:45Z","snapshot_observed_at":"2026-07-06T15:05:53.556198Z","submitted_at":"2023-03-20T18:08:50Z","title":"Reflexion: Language Agents with Verbal Reinforcement Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.11366","snapshot_observed_at":"2026-08-04T18:37:58.952001Z","title":"Reflexion: Language agents with verbal reinforcement learning, 2023.URL https://arxiv","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.952001Z"},"links":{"cited_paper":"/paper/2303.11366","citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:147f93e2d3c1c24b73c4c781150f19f61ec795644dfee31837160cbf5532db37","observation_id":"1bed0bd4-19ce-420d-8279-cc676e648f4f","resolution":{"observed_at":"2026-08-04T18:37:58.952001Z","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-04T18:37:58.959490Z","title":"Causal llm routing: End-to-end regret minimiza- tion from observational data.arXiv preprint arXiv:2505.16037,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.959490Z"},"links":{"citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:1c6a40c908698989dd713737a78c810cb96c9a1b16e6d586996d6f8604a840a9","observation_id":"6f785bb5-bd54-4360-8cd9-026b130b0c06","resolution":{"observed_at":"2026-08-04T18:37:58.959490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.07266","last_updated":"2025-05-27T02:56:52Z","snapshot_observed_at":"2026-08-08T13:14:58.702776Z","submitted_at":"2025-02-11T05:28:59Z","title":"When More is Less: Understanding Chain-of-Thought Length in LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.07266","snapshot_observed_at":"2026-08-04T18:37:58.962802Z","title":"When more is less: Understanding chain-of-thought length in llms.arXiv preprint arXiv:2502.07266,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.962802Z"},"links":{"cited_paper":"/paper/2502.07266","citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:623f5472ff40719c9f767d03483315cfdcf4b41d7f9493a102c6964b6c1a7b34","observation_id":"60ebc5f8-5678-46b3-bd93-9b21b7693f22","resolution":{"observed_at":"2026-08-04T18:37:58.962802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22480","last_updated":"2024-10-29T19:17:55Z","snapshot_observed_at":"2026-08-08T14:46:58.049897Z","submitted_at":"2024-10-29T19:17:55Z","title":"Scaling LLM Inference with Optimized Sample Compute Allocation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22480","snapshot_observed_at":"2026-08-04T18:37:58.966197Z","title":"Scaling llm inference with optimized sample compute allocation.arXiv preprint arXiv:2410.22480,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.966197Z"},"links":{"cited_paper":"/paper/2410.22480","citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:8c22ea7fe0213a22cd6fb55ec25b3718b0d63e0cf3bb9b2d9e85bb036da654f4","observation_id":"558b23a1-800d-40a6-8199-930e0505f8a7","resolution":{"observed_at":"2026-08-04T18:37:58.966197Z","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-04T18:37:58.948745Z","title":"Abon: Adaptive best-of-n alignment.arXiv preprint arXiv:2505.12050,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.948745Z"},"links":{"citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:6734f0bf15eeb680efd317cba284d5bc8d3029ea3118e27c4e536cd57078d1c9","observation_id":"e851658b-e3a4-48c0-aec3-92ee25e3a28b","resolution":{"observed_at":"2026-08-04T18:37:58.948745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-04T18:37:58.955871Z","title":"Scaling llm test-time compute optimally can be more effective than scaling model parameters.arXiv preprint arXiv:2408.03314,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.955871Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:57be4c79dc9fb767d49266b7a34dbc1384ac5e6d2e935e02b2914e4572c546db","observation_id":"0c4bb1a7-4ad5-43b8-bdf5-3e041abe146d","resolution":{"observed_at":"2026-08-04T18:37:58.955871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-08T07:33:06.296401Z","submitted_at":"2024-10-07T02:52:30Z","title":"Learning How Hard to Think: Input-Adaptive Allocation of LM Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-08-04T18:37:58.927864Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation.arXiv preprint arXiv:2410.04707,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.927864Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:b360def509a82cce452db3c51baf4a44b344a44df9e867ad639165486a20ec57","observation_id":"c091b011-5038-4d53-802e-73825271e40e","resolution":{"observed_at":"2026-08-04T18:37:58.927864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21787","last_updated":"2024-12-30T19:03:24Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:57:25Z","title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21787","snapshot_observed_at":"2026-08-04T18:37:58.924352Z","title":"Large language monkeys: Scaling inference compute with repeated sampling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T18:37:58.924352Z"},"links":{"cited_paper":"/paper/2407.21787","citing_paper":"/paper/2509.09864"},"observation_digest":"sha256:d8fd50f08fe30f3e01c53908aedb64c32e699b5c4494032afa286ec8e5a7c586","observation_id":"653b2d7a-5096-4b02-a882-0c096d479b67","resolution":{"observed_at":"2026-08-04T18:37:58.924352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.09864","last_updated":"2025-09-11T21:35:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T15:40:25.756323Z","submitted_at":"2025-09-11T21:35:19Z","title":"Latency and Token-Aware Test-Time Compute"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":14},"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 9 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 2 inbound Pith citation observations for arXiv:2509.09864."}