{"as_of":"2026-08-09T21:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2d136e45d1c03699069e29505953c0bf9ad2dc7b784d73802921804f582cca95","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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-09T06:31:02.800959+00:00","state":"measured"},{"denominator":16,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T16:18:47.988297Z","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-07-01T22:26:17.063908Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-09T17:45:41.436469Z","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":"2410.04707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-07-01T22:26:17.063908Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation.arXiv preprint arXiv:2410.04707","venue":null,"work_id":"f5ebaa1e-c4de-4f8c-baef-b41db89e21b3","year":2025},"citing_paper":{"arxiv_id":"2412.21187","last_updated":"2025-02-01T07:57:37Z","snapshot_observed_at":"2026-08-01T16:43:44.704797Z","submitted_at":"2024-12-30T18:55:12Z","title":"Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-13T15:51:29.022336Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2412.21187"},"observation_digest":"sha256:18d428e77b6f972e98b0bf3d8d19f08ee94c407f782d502df84467bfd7aaffb6","observation_id":"a5a8c85f-007f-4312-b530-284b87c955f2","resolution":{"observed_at":"2026-05-13T15:51:29.476618Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-09T17:45:41.436469Z","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-08T16:18:47.988297Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06258","last_updated":"2025-08-04T03:29:30Z","snapshot_observed_at":"2026-08-09T03:04:18.558302Z","submitted_at":"2025-02-10T08:48:10Z","title":"Emergent Response Planning in LLMs","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T16:18:47.988297Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2502.06258"},"observation_digest":"sha256:da339fec8d77e1a0594d3667ee1f467c2e37e7f75ad7840a1a55e2d52272e9aa","observation_id":"45a5734c-5395-4298-b185-f158ee9e72dd","resolution":{"observed_at":"2026-08-08T16:18:47.988297Z","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-09T17:45:41.436469Z","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-07T15:06:00.664496Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-09T03:56:59.767238Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.664496Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:e9867310a04fac4a0ba4be216c7251694efd4b5dbb632e29e36ca7b58e217e27","observation_id":"15aea0aa-d327-40a5-b8ae-0cf900157896","resolution":{"observed_at":"2026-08-07T15:06:00.664496Z","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-09T17:45:41.436469Z","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-07T10:56:23.551437Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03978","last_updated":"2025-06-09T04:15:05Z","snapshot_observed_at":"2026-08-09T20:38:50.514409Z","submitted_at":"2025-06-04T14:08:44Z","title":"Structured Pruning for Diverse Best-of-N Reasoning Optimization","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:56:23.551437Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2506.03978"},"observation_digest":"sha256:405ebaa482cb92de8a88f0143ea1a3788c8c7e4c1f56f289cd51d9ccfa12d53c","observation_id":"77aebce6-4914-4c51-956f-81cdfa8e45c0","resolution":{"observed_at":"2026-08-07T10:56:23.551437Z","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-09T17:45:41.436469Z","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-05T17:04:38.139893Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.17196","last_updated":"2025-08-29T14:42:16Z","snapshot_observed_at":"2026-08-06T13:40:01.864747Z","submitted_at":"2025-08-24T03:17:50Z","title":"BudgetThinker: Empowering Budget-aware LLM Reasoning with Control Tokens","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T17:04:38.139893Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2508.17196"},"observation_digest":"sha256:54be629c0b15c5a12451430f9fab69e9c97139066b56f4237837fe066611cace","observation_id":"3cb1a58f-a184-4b77-b97a-e4ffabe2b42f","resolution":{"observed_at":"2026-08-05T17:04:38.139893Z","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-09T17:45:41.436469Z","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-05T05:34:40.267369Z","title":"Damani, I","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.05226","last_updated":"2025-09-05T16:40:13Z","snapshot_observed_at":"2026-08-09T08:01:23.924366Z","submitted_at":"2025-09-05T16:40:13Z","title":"Less is More Tokens: Efficient Math Reasoning via Difficulty-Aware Chain-of-Thought Distillation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T05:34:40.267369Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2509.05226"},"observation_digest":"sha256:5206953580bd6edf8e023b53d0273166ab18a70b5cb11d9c1af6b4174e9653af","observation_id":"ef116e5c-cec4-4023-acfd-1c09196c69b0","resolution":{"observed_at":"2026-08-05T05:34:40.267369Z","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-09T17:45:41.436469Z","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-05T00:03:58.401997Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation.arXiv preprint arXiv:2410.04707, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.06174","last_updated":"2025-09-07T19:00:44Z","snapshot_observed_at":"2026-08-07T08:58:49.156790Z","submitted_at":"2025-09-07T19:00:44Z","title":"From Long to Short: LLMs Excel at Trimming Own Reasoning Chains","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T00:03:58.401997Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2509.06174"},"observation_digest":"sha256:debc9c201a8e9f6d5b29a77822360c580264f2a587b61077573efc252fcf7b99","observation_id":"f25098e2-7bad-4ba5-976b-82c4cdecf6a8","resolution":{"observed_at":"2026-08-05T00:03:58.401997Z","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-09T17:45:41.436469Z","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:05f1d1355e0bd9496ec439568f86504dd3fbf09c8833bf317c110403875c8e46","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":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-09T17:45:41.436469Z","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":"2410.04707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-07-01T22:26:17.063908Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation.arXiv preprint arXiv:2410.04707","venue":null,"work_id":"f5ebaa1e-c4de-4f8c-baef-b41db89e21b3","year":2025},"citing_paper":{"arxiv_id":"2601.05110","last_updated":"2026-04-28T12:22:24Z","snapshot_observed_at":"2026-07-06T22:41:10.836235Z","submitted_at":"2026-01-08T16:58:07Z","title":"GlimpRouter: Efficient Collaborative Inference by Glimpsing One Token of Thoughts","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-16T15:53:07.496412Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2601.05110"},"observation_digest":"sha256:fcd54d33ac7271b79c0e6c1b64ebc9586fafdf18fba889bc408b4de61037fedd","observation_id":"1b269d24-e216-4ceb-aed9-2421a09ac982","resolution":{"observed_at":"2026-05-16T15:58:04.004882Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-09T17:45:41.436469Z","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":"2410.04707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-07-01T22:26:17.063908Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation.arXiv preprint arXiv:2410.04707","venue":null,"work_id":"f5ebaa1e-c4de-4f8c-baef-b41db89e21b3","year":2025},"citing_paper":{"arxiv_id":"2602.01970","last_updated":"2026-05-15T12:23:06Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T11:24:36Z","title":"Small Generalizable Prompt Predictive Models Can Steer Efficient RL Post-Training of Large Reasoning Models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T14:09:26.842696Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2602.01970"},"observation_digest":"sha256:e738817917dc392864e829b9991fa94b18a946bcd5a34346b45de2834eb597d9","observation_id":"1f7ddd34-2dea-4a48-8a55-c14c8196e823","resolution":{"observed_at":"2026-05-21T14:10:13.026482Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-09T17:45:41.436469Z","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":"2410.04707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-07-01T22:26:17.063908Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation.arXiv preprint arXiv:2410.04707","venue":null,"work_id":"f5ebaa1e-c4de-4f8c-baef-b41db89e21b3","year":2025},"citing_paper":{"arxiv_id":"2602.16699","last_updated":"2026-05-15T21:12:58Z","snapshot_observed_at":"2026-07-06T22:46:21.571641Z","submitted_at":"2026-02-18T18:46:14Z","title":"Calibrate-Then-Act: Cost-Aware Exploration in LLM Agents","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T12:35:23.879207Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2602.16699"},"observation_digest":"sha256:9d61714d34b4cc3ef992b212ec0ae4f9148b5561e0dd64aef3ea4da78300c86e","observation_id":"df8e1a92-8e47-45ef-a3d8-142108e3ae33","resolution":{"observed_at":"2026-05-21T12:40:08.825784Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-09T17:45:41.436469Z","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":"2410.04707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-07-01T22:26:17.063908Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation.arXiv preprint arXiv:2410.04707","venue":null,"work_id":"f5ebaa1e-c4de-4f8c-baef-b41db89e21b3","year":2025},"citing_paper":{"arxiv_id":"2605.15706","last_updated":"2026-05-29T15:25:05Z","snapshot_observed_at":"2026-07-06T23:26:56.013191Z","submitted_at":"2026-05-15T07:54:46Z","title":"Differentiable Mixture-of-Agents Incentivizes Swarm Intelligence of Large Language Models","version":1},"reference_index":113,"source":"arxiv_source","source_observed_at":"2026-05-20T19:53:04.689519Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2605.15706"},"observation_digest":"sha256:a6e26e83c3daa28f9a44f906c3d1352e346ec847075bc4f212d19bca4391be88","observation_id":"663b5e4e-27be-4e6c-a5e7-6c69885c12a4","resolution":{"observed_at":"2026-05-20T19:53:42.214972Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-09T17:45:41.436469Z","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":"2410.04707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-07-01T22:26:17.063908Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation.arXiv preprint arXiv:2410.04707","venue":null,"work_id":"f5ebaa1e-c4de-4f8c-baef-b41db89e21b3","year":2025},"citing_paper":{"arxiv_id":"2605.15706","last_updated":"2026-05-29T15:25:05Z","snapshot_observed_at":"2026-07-06T23:26:56.013191Z","submitted_at":"2026-05-15T07:54:46Z","title":"Differentiable Mixture-of-Agents Incentivizes Swarm Intelligence of Large Language Models","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-30T19:40:41.219923Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2605.15706"},"observation_digest":"sha256:4d3e0396a4fa91d273b1dd6ca2cc1c5a946e5acd4976f9fc0bd9145b6de78d72","observation_id":"3fae7f65-7cfe-421a-a7de-141aa2273200","resolution":{"observed_at":"2026-06-30T19:45:00.805465Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-09T17:45:41.436469Z","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":"2410.04707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-07-01T22:26:17.063908Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation.arXiv preprint arXiv:2410.04707","venue":null,"work_id":"f5ebaa1e-c4de-4f8c-baef-b41db89e21b3","year":2025},"citing_paper":{"arxiv_id":"2605.17497","last_updated":"2026-05-17T15:14:24Z","snapshot_observed_at":"2026-08-05T13:27:59.292796Z","submitted_at":"2026-05-17T15:14:24Z","title":"Self-Supervised On-Policy Distillation for Reasoning Language Models","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-05-20T14:42:55.368104Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2605.17497"},"observation_digest":"sha256:e806a918619c55f01a121b1520baa3ed460bcc6f66ddd5f266fe563473d19d22","observation_id":"890de3f6-cd4e-445c-93a4-716a155a044a","resolution":{"observed_at":"2026-05-20T14:43:22.181773Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-09T17:45:41.436469Z","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":"2410.04707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-07-01T22:26:17.063908Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation.arXiv preprint arXiv:2410.04707","venue":null,"work_id":"f5ebaa1e-c4de-4f8c-baef-b41db89e21b3","year":2025},"citing_paper":{"arxiv_id":"2606.01667","last_updated":"2026-06-01T04:19:50Z","snapshot_observed_at":"2026-08-03T01:20:45.755599Z","submitted_at":"2026-06-01T04:19:50Z","title":"ATLAS: Agentic Test-time Learning-to-Allocate Scaling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T15:27:28.290178Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2606.01667"},"observation_digest":"sha256:0cfc1937d4d15c1239da8e815331f6a0725888fd16a457bb0df9e6b563ced222","observation_id":"e49d0f63-5f9b-414f-a8f1-f7ddcb255eb9","resolution":{"observed_at":"2026-07-01T22:26:17.065605Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-09T17:45:41.436469Z","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":"2410.04707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-07-01T22:26:17.063908Z","title":"Learning how hard to think: Input-adaptive allocation of lm computation.arXiv preprint arXiv:2410.04707","venue":null,"work_id":"f5ebaa1e-c4de-4f8c-baef-b41db89e21b3","year":2025},"citing_paper":{"arxiv_id":"2606.31511","last_updated":"2026-06-30T11:26:14Z","snapshot_observed_at":"2026-08-08T07:30:21.970617Z","submitted_at":"2026-06-30T11:26:14Z","title":"Falsification, Not Exposure: An Internally Preregistered Placebo-Controlled Decomposition of Self-Repair Feedback in Frozen Small Code Models","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-01T04:44:56.520156Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2606.31511"},"observation_digest":"sha256:8e346b87081c9f35f84a5d1c64125a9f96e270085020e7a860cfc99c10f76dd6","observation_id":"393c9c4a-8dd6-43ac-b9ce-b9055cce5f6a","resolution":{"observed_at":"2026-07-01T11:05:42.264953Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.04707/citation-record","integrity":"/paper/2410.04707/integrity","json":"/paper/2410.04707/citation-record.json","paper":"/paper/2410.04707"},"outbound":[],"paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T17:45:41.436469Z","submitted_at":"2024-10-07T02:52:30Z","title":"Learning How Hard to Think: Input-Adaptive Allocation of LM Computation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 16 inbound Pith citation observations for arXiv:2410.04707."}