Pith. sign in

Paper Citation Record · LEDGER

Latency and Token-Aware Test-Time Compute

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.

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 16 of 16 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-05-11T02:14:55.216480Z

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:bbdb9139601380ba6c7ab1f90e8ab0762ced018f4e8900fb660314bd6468ffb3

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:4b009cacfea4fd293c299e8d2f3f4295482b6512fcbff0dc28811d33421c4cb0

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:f88e5aae1916a5414d1051d0835bccade5212582aba71a357cbe7ad3dc1da154

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:df8035a578ad7081db45a2b326f119d3bb22f66aa96eb2a9f89517fca8f1ae24

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:ce15dba6120819c21f7566dd1281cd63643f90c40be8849c26159c0b1680eda8

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:d1a042e826dfac167c42cd3ec4f99acfd130a1cd84fc25dc2b3ccab751c045d5

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:147f93e2d3c1c24b73c4c781150f19f61ec795644dfee31837160cbf5532db37

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:1c6a40c908698989dd713737a78c810cb96c9a1b16e6d586996d6f8604a840a9

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:623f5472ff40719c9f767d03483315cfdcf4b41d7f9493a102c6964b6c1a7b34

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:8c22ea7fe0213a22cd6fb55ec25b3718b0d63e0cf3bb9b2d9e85bb036da654f4

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:6734f0bf15eeb680efd317cba284d5bc8d3029ea3118e27c4e536cd57078d1c9

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:57be4c79dc9fb767d49266b7a34dbc1384ac5e6d2e935e02b2914e4572c546db

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:b360def509a82cce452db3c51baf4a44b344a44df9e867ad639165486a20ec57

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:d8fd50f08fe30f3e01c53908aedb64c32e699b5c4494032afa286ec8e5a7c586

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-05-11T02:14:55.216480Z digest=sha256:5e4c2e45c582cfc39c9dc367148d458c34184a4ec6d5f827ab64a2054d0da84c