Pith. sign in

Paper Citation Record · LEDGER

Latency and Token-Aware Test-Time Compute

As of 18 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 3 inbound Pith citation observations for arXiv:2509.09864.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2509.09864 v1

Coverage vector

measured 14 of 14 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T18:37:58.966197Z

measured 17 of 17 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-11T04:17:28.305280Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-11T19:56:09.066478Z

Reference resolution

14 of 14 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved14
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 5acd07e2-c1d1-453e-8e72-1229c9419162 · outbound

This paper cites Optimal policy minimum bayesian risk.arXiv preprint arXiv:2505.17242,.

Latency and Token-Aware Test-Time Compute Optimal policy minimum bayesian risk.arXiv preprint arXiv:2505.17242,

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.919848Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.919848Z digest=sha256:f0cd8588fd180d221fd071409f508cc6175bfc9aa551b2897753416dd08f7032

Observation 4edfac5e-441f-46b9-8da6-0f949d252f5e · outbound

This paper cites BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute.

Latency and Token-Aware Test-Time Compute BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.931386Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.931386Z digest=sha256:3e4472382f4b049ed00eed685646252324fca4971e3902c43c993a868374fc0e

Observation 2117a44b-e616-4c6c-a539-2aeaa5fc8b4c · outbound

This paper cites DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning.

Latency and Token-Aware Test-Time Compute DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.934810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.934810Z digest=sha256:a6ed5a7ef7f1667b2ded55f998e1a9bf029b0d7129c8e28e77cfeedcbec74fe8

Observation 50f2bdc7-61cb-45bb-88f6-6061eb0cfa68 · outbound

This paper cites RouterBench: A Benchmark for Multi-LLM Routing System.

Latency and Token-Aware Test-Time Compute RouterBench: A Benchmark for Multi-LLM Routing System

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.938132Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.938132Z digest=sha256:fa55565630e6a38b8d0e5431ad35f86fdce87524fec33de4feb8550005d7eff3

Observation 74dd0f9a-df63-405d-97d0-6b6bf5643719 · outbound

This paper cites RouteLLM: Learning to Route LLMs with Preference Data.

Latency and Token-Aware Test-Time Compute RouteLLM: Learning to Route LLMs with Preference Data

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.941919Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.941919Z digest=sha256:9b6508978537df64d829b21fb881240db4c7b325f014f576ccd1a4633b7f90fc

Observation b9be7044-9b12-4f4f-8767-4d93df13d252 · outbound

This paper cites OpenAI o1 System Card.

Latency and Token-Aware Test-Time Compute OpenAI o1 System Card

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.945314Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.945314Z digest=sha256:c4caee384f13897b82d63e8229040ded3d7c4878e04195cde20949e748343fb9

Observation 1bed0bd4-19ce-420d-8279-cc676e648f4f · outbound

This paper cites Reflexion: Language Agents with Verbal Reinforcement Learning.

Latency and Token-Aware Test-Time Compute Reflexion: Language Agents with Verbal Reinforcement Learning

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.952001Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.952001Z digest=sha256:4f4cd9c6c05b87871f27fa566955a67e8923fe7ef51826d8020b22e2c5c68416

Observation 6f785bb5-bd54-4360-8cd9-026b130b0c06 · outbound

This paper cites Causal llm routing: End-to-end regret minimiza- tion from observational data.arXiv preprint arXiv:2505.16037,.

Latency and Token-Aware Test-Time Compute Causal llm routing: End-to-end regret minimiza- tion from observational data.arXiv preprint arXiv:2505.16037,

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.959490Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.959490Z digest=sha256:1fe61fec83e03809f178199806f7339976026e29aca288c67873f83c6a7b7b23

Observation 60ebc5f8-5678-46b3-bd93-9b21b7693f22 · outbound

This paper cites When More is Less: Understanding Chain-of-Thought Length in LLMs.

Latency and Token-Aware Test-Time Compute When More is Less: Understanding Chain-of-Thought Length in LLMs

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.962802Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.962802Z digest=sha256:8a81549cd1a179c4ac3fa8abd1ea5f787ff8b314528f79130afbdb4b17ab4a30

Observation 558b23a1-800d-40a6-8199-930e0505f8a7 · outbound

This paper cites Scaling LLM Inference with Optimized Sample Compute Allocation.

Latency and Token-Aware Test-Time Compute Scaling LLM Inference with Optimized Sample Compute Allocation

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.966197Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.966197Z digest=sha256:e52006edfd810ae2b436bfc20943c12535d74c7cc61173bdad241a5a0da423f6

Observation e851658b-e3a4-48c0-aec3-92ee25e3a28b · outbound

This paper cites Abon: Adaptive best-of-n alignment.arXiv preprint arXiv:2505.12050,.

Latency and Token-Aware Test-Time Compute Abon: Adaptive best-of-n alignment.arXiv preprint arXiv:2505.12050,

Reference 2022

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.948745Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.948745Z digest=sha256:733b4541fbb90e07932956058a23817f2d2241df10e09637766d3b9f6d663592

Observation 0c4bb1a7-4ad5-43b8-bdf5-3e041abe146d · outbound

This paper cites Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters.

Latency and Token-Aware Test-Time Compute Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters

Reference 2023

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.955871Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.955871Z digest=sha256:461a3a78b037a35599ae1a6bc0d03311729920b1a627622ee0a1e517b5c128e1

Observation c091b011-5038-4d53-802e-73825271e40e · outbound

This paper cites Learning How Hard to Think: Input-Adaptive Allocation of LM Computation.

Latency and Token-Aware Test-Time Compute Learning How Hard to Think: Input-Adaptive Allocation of LM Computation

Reference 2024

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.927864Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.927864Z digest=sha256:f64f9ffd8760ea52cd73cf8681ae4dc8523fa3d84a545908c8f57825e3ae80bf

Observation 653b2d7a-5096-4b02-a882-0c096d479b67 · outbound

This paper cites Large Language Monkeys: Scaling Inference Compute with Repeated Sampling.

Latency and Token-Aware Test-Time Compute Large Language Monkeys: Scaling Inference Compute with Repeated Sampling

Reference 2025

Resolution
unresolved
no resolver link, observed 2026-08-04T18:37:58.924352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T18:37:58.924352Z digest=sha256:b30aa602b6ff105fff32e89e6e6d2a82b1dea8e7c43ea2d19418b8e159e4378c

Pith citing papers

Observation 3dc14d54-31ea-4523-abca-c55360ff8198 · inbound

On Time, Within Budget: Constraint-Driven Online Resource Allocation for Agentic Workflows cites this paper.

On Time, Within Budget: Constraint-Driven Online Resource Allocation for Agentic Workflows Latency and Token-Aware Test-Time Compute

Reference 2

Resolution
verified exact
arxiv_id, observed 2026-05-11T19:56:09.071718Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-05-08T10:39:39.482599Z digest=sha256:ed1821a13b8b34d95d5a4ccdf3400a6f3c8a8322efeeae4c02ce56ed5a5aa67e

Observation e50f9d31-95fd-4eab-a908-4cb69917e026 · inbound

On Time, Within Budget: Constraint-Driven Online Resource Allocation for Agentic Workflows cites this paper.

On Time, Within Budget: Constraint-Driven Online Resource Allocation for Agentic Workflows Latency and Token-Aware Test-Time Compute

Reference 2

Resolution
verified exact
arxiv_id, observed 2026-05-11T03:50:55.007607Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-05-11T02:14:55.216480Z digest=sha256:525d8d63b41accc61e72da4381520c8799b4ec006b57b00f78d884743f20621f

Observation 5924a9b0-1e17-43ac-b442-ce885de8e09b · inbound

CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing cites this paper.

CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing Latency and Token-Aware Test-Time Compute

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-11T04:17:28.305280Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T04:17:28.305280Z digest=sha256:d3c6f116e8f07c02521090f90df2b7c64f0371520614b32fd0e655db7f12b5bb