{"as_of":"2026-08-09T14:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ef121aba4bd18090a534a468e6f97bfa3876615c2289b4ea6aa1a912e91b32e","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":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":23,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:00:35.543462Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":"2412.20993","doi":"10.48550/arxiv.2412.20993","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jazbec, M., Timans, A., Hadˇzi Veljkovi´c, T., Sakmann, K., Zhang, D., Andersson Naesseth, C., and Nalisnick, E","venue":"arXiv (Cornell University)","work_id":"57494d13-0d57-400a-8e38-67a61f1677d1","year":2024},"citing_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-07T04:27:23.738927Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-14T01:29:56.480020Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2503.16419"},"observation_digest":"sha256:6ac2ffbcf47f4e78b30253024e6463e23486b4d632c0175b0e60f5725b10a66e","observation_id":"6e0d08a8-9e23-4130-a8f4-ced75a1a038b","resolution":{"observed_at":"2026-05-14T01:29:57.109815Z","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":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-07T15:00:35.543462Z","title":"Efficiently serving llm reasoning programs with certaindex","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17155","last_updated":"2025-05-31T13:54:42Z","snapshot_observed_at":"2026-08-09T10:41:14.859275Z","submitted_at":"2025-05-22T12:23:30Z","title":"TrimR: Verifier-based Training-Free Thinking Compression for Efficient Test-Time Scaling","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:00:35.543462Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2505.17155"},"observation_digest":"sha256:83d7f15c7519bf5ad264c9f28f63661af0bc876e6cd4ac07139f1e4b3e01a086","observation_id":"c5aa9570-f12d-4cd8-bd51-dd5f7adbd967","resolution":{"observed_at":"2026-08-07T15:00:35.543462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-07T14:27:38.131067Z","title":"doi: 10.18653/v1/ 2024.acl-long.681","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18962","last_updated":"2025-05-31T15:08:41Z","snapshot_observed_at":"2026-08-09T13:11:14.871776Z","submitted_at":"2025-05-25T03:35:49Z","title":"System-1.5 Reasoning: Traversal in Language and Latent Spaces with Dynamic Shortcuts","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:38.131067Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2505.18962"},"observation_digest":"sha256:0d105149ede5f0904d325fd12cbc113d9735f6183c3ae043b34a4746023d6949","observation_id":"6db0e2b9-1de1-47ed-84f4-c4bd503631df","resolution":{"observed_at":"2026-08-07T14:27:38.131067Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-07T14:21:21.310044Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19250","last_updated":"2025-05-25T17:58:50Z","snapshot_observed_at":"2026-08-08T11:21:53.639135Z","submitted_at":"2025-05-25T17:58:50Z","title":"PATS: Process-Level Adaptive Thinking Mode Switching","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T14:21:21.310044Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2505.19250"},"observation_digest":"sha256:13b1cb3226ef12f0b0c26e06fe72b7b7f49207534e76afcc6be870f0f043e2b4","observation_id":"83c84468-153f-4f89-905a-a0f6e0c4aef4","resolution":{"observed_at":"2026-08-07T14:21:21.310044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-07T13:30:19.664239Z","title":"Efficiently serving llm reasoning programs with certaindex","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21765","last_updated":"2025-05-27T20:59:29Z","snapshot_observed_at":"2026-08-08T03:33:47.797238Z","submitted_at":"2025-05-27T20:59:29Z","title":"Don't Think Longer, Think Wisely: Optimizing Thinking Dynamics for Large Reasoning Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:19.664239Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2505.21765"},"observation_digest":"sha256:a14cc7b335f66bd1fda3aac18ed9b8ad52dd432b8a65a537a20e08a6f1a4f7ca","observation_id":"79ec7da9-6ade-49f4-af82-365c2fbc742c","resolution":{"observed_at":"2026-08-07T13:30:19.664239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-07T10:30:34.191878Z","title":"Efficiently serving llm reasoning programs with certaindex.arXiv preprint arXiv:2412.20993,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.05333","last_updated":"2025-06-20T01:25:25Z","snapshot_observed_at":"2026-08-07T10:18:59.977399Z","submitted_at":"2025-06-05T17:59:24Z","title":"Kinetics: Rethinking Test-Time Scaling Laws","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:34.191878Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2506.05333"},"observation_digest":"sha256:497f10a707d3e2fd7d4cc4feaf8b7a9e7fb39c1157ab8710e5dcd56e3c359f0e","observation_id":"cd607189-bf74-479a-b376-433772d9fc8f","resolution":{"observed_at":"2026-08-07T10:30:34.191878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-07T05:49:35.259278Z","title":"Efficiently serving llm reasoning programs with certaindex.arXiv preprint arXiv:2412.20993, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:35.259278Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:83373e4d8dbec45e925922249239e9579f4b87f4b1c5a045618ad8a894f47807","observation_id":"e92c41ce-5ba5-40f2-a2e8-addd6482a401","resolution":{"observed_at":"2026-08-07T05:49:35.259278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-07T04:26:28.457364Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-09T03:27:12.818075Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.457364Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:138c547ff2855f7ac7493da8f1016895ccc1f3e810d737cbe89908f44db469cf","observation_id":"96088a5a-5855-46d9-a528-57ad1580d18d","resolution":{"observed_at":"2026-08-07T04:26:28.457364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-06T21:45:07.680145Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23840","last_updated":"2025-06-30T13:30:33Z","snapshot_observed_at":"2026-08-08T01:50:45.730700Z","submitted_at":"2025-06-30T13:30:33Z","title":"Do Thinking Tokens Help or Trap? Towards More Efficient Large Reasoning Model","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T21:45:07.680145Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2506.23840"},"observation_digest":"sha256:dd20214fbf1ad13530f88e6e7f1a98a356a8d90d0374f908c858dfc52cc2b8b7","observation_id":"36d735ad-bb62-4f98-aa8a-decd1ec86a3c","resolution":{"observed_at":"2026-08-06T21:45:07.680145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-06T20:43:10.229212Z","title":"Efficiently Serving LLM Reasoning Programs with Certaindex.arXiv preprint arXiv:2412.20993,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.02076","last_updated":"2025-07-02T18:27:42Z","snapshot_observed_at":"2026-08-08T01:09:25.758170Z","submitted_at":"2025-07-02T18:27:42Z","title":"Reasoning on a Budget: A Survey of Adaptive and Controllable Test-Time Compute in LLMs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:43:10.229212Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2507.02076"},"observation_digest":"sha256:5da7d5ff6dcc00fb16e23c5724ef872efad7a042e3b9085a2cc09933bae69936","observation_id":"ef5b7085-cc35-4f6c-b1f1-8f8d5fafae89","resolution":{"observed_at":"2026-08-06T20:43:10.229212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-06T19:56:08.863416Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.04348","last_updated":"2025-07-17T13:07:41Z","snapshot_observed_at":"2026-08-09T11:19:31.796880Z","submitted_at":"2025-07-06T11:21:47Z","title":"SmartThinker: Learning to Compress and Preserve Reasoning by Step-Level Length Control","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T19:56:08.863416Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2507.04348"},"observation_digest":"sha256:a94001e33deda457c632dc090a9ae373c760cd394f40d420153467c5eab01cce","observation_id":"957e12f6-f41d-494b-b36b-0271a1856491","resolution":{"observed_at":"2026-08-06T19:56:08.863416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-06T18:45:42.361717Z","title":"Efficiently serving llm reasoning programs with certaindex","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07400","last_updated":"2025-07-10T03:39:23Z","snapshot_observed_at":"2026-08-09T01:40:20.468391Z","submitted_at":"2025-07-10T03:39:23Z","title":"KVFlow: Efficient Prefix Caching for Accelerating LLM-Based Multi-Agent Workflows","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T18:45:42.361717Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2507.07400"},"observation_digest":"sha256:91392ba75a18560e6a89b55b8f6790e5909acf881627b6037a7c5a88216ed54b","observation_id":"cf829135-f430-4acc-8754-43b503bed880","resolution":{"observed_at":"2026-08-06T18:45:42.361717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-06T17:53:47.696525Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09662","last_updated":"2025-07-13T14:51:59Z","snapshot_observed_at":"2026-08-07T01:15:50.475193Z","submitted_at":"2025-07-13T14:51:59Z","title":"Towards Concise and Adaptive Thinking in Large Reasoning Models: A Survey","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-06T17:53:47.696525Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2507.09662"},"observation_digest":"sha256:fa8c2579bdf13f70de19306a4bac14c0de31e1163b46cc0c5b27721018148263","observation_id":"16b6c32b-4501-4794-b2a6-2006fb004230","resolution":{"observed_at":"2026-08-06T17:53:47.696525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-05T17:04:38.246678Z","title":"Efficiently scaling llm reasoning with certaindex, 2025","venue":null,"work_id":null,"year":2025},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-05T17:04:38.246678Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2508.17196"},"observation_digest":"sha256:0aab31ed851c594f34bba66b28a136dd839194e1cfd75fadf7825e14335c41e5","observation_id":"74cd2714-fb76-48d6-aa49-5f99cb7f7a74","resolution":{"observed_at":"2026-08-05T17:04:38.246678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":"2412.20993","doi":"10.48550/arxiv.2412.20993","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jazbec, M., Timans, A., Hadˇzi Veljkovi´c, T., Sakmann, K., Zhang, D., Andersson Naesseth, C., and Nalisnick, E","venue":"arXiv (Cornell University)","work_id":"57494d13-0d57-400a-8e38-67a61f1677d1","year":2024},"citing_paper":{"arxiv_id":"2602.03814","last_updated":"2026-05-14T02:01:19Z","snapshot_observed_at":"2026-07-06T22:44:23.981940Z","submitted_at":"2026-02-03T18:17:22Z","title":"Conformal Thinking: Risk Control for Reasoning on a Compute Budget","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T07:45:53.184670Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2602.03814"},"observation_digest":"sha256:cf155feac1d49977d3f6364f935ed7d37af68f2d850450334ee5de47232c71ba","observation_id":"557ef758-9dd1-4347-882f-d310a882cf22","resolution":{"observed_at":"2026-05-16T07:47:32.643380Z","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":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":"2412.20993","doi":"10.48550/arxiv.2412.20993","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jazbec, M., Timans, A., Hadˇzi Veljkovi´c, T., Sakmann, K., Zhang, D., Andersson Naesseth, C., and Nalisnick, E","venue":"arXiv (Cornell University)","work_id":"57494d13-0d57-400a-8e38-67a61f1677d1","year":2024},"citing_paper":{"arxiv_id":"2604.06370","last_updated":"2026-04-07T18:52:25Z","snapshot_observed_at":"2026-08-08T21:24:58.736715Z","submitted_at":"2026-04-07T18:52:25Z","title":"ForkKV: Scaling Multi-LoRA Agent Serving via Copy-on-Write Disaggregated KV Cache","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T18:16:49.292491Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2604.06370"},"observation_digest":"sha256:6a10d185148dd8fe4638ca36a1cc166eaf78af008a77ccf534b3ace656c49273","observation_id":"a86d22da-edf3-479b-910c-4d3f09035655","resolution":{"observed_at":"2026-05-11T05:10:54.958001Z","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":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":"2412.20993","doi":"10.48550/arxiv.2412.20993","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jazbec, M., Timans, A., Hadˇzi Veljkovi´c, T., Sakmann, K., Zhang, D., Andersson Naesseth, C., and Nalisnick, E","venue":"arXiv (Cornell University)","work_id":"57494d13-0d57-400a-8e38-67a61f1677d1","year":2024},"citing_paper":{"arxiv_id":"2604.17304","last_updated":"2026-04-19T07:39:40Z","snapshot_observed_at":"2026-07-31T20:48:53.964908Z","submitted_at":"2026-04-19T07:39:40Z","title":"Efficient Test-Time Scaling via Temporal Reasoning Aggregation","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-10T06:17:17.129840Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2604.17304"},"observation_digest":"sha256:2d22742a76c5dea480f33e52c0208d1c957016c20cfc713e0015fde3a0a4a56f","observation_id":"8d4a6adb-15d7-49c7-9db0-4f3de1ef9bc1","resolution":{"observed_at":"2026-05-10T06:21:26.517654Z","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":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":"2412.20993","doi":"10.48550/arxiv.2412.20993","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jazbec, M., Timans, A., Hadˇzi Veljkovi´c, T., Sakmann, K., Zhang, D., Andersson Naesseth, C., and Nalisnick, E","venue":"arXiv (Cornell University)","work_id":"57494d13-0d57-400a-8e38-67a61f1677d1","year":2024},"citing_paper":{"arxiv_id":"2605.01214","last_updated":"2026-05-02T03:06:02Z","snapshot_observed_at":"2026-08-04T03:54:47.150761Z","submitted_at":"2026-05-02T03:06:02Z","title":"Agentic AI Systems Should Be Designed as Marginal Token Allocators","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-09T15:11:41.570592Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2605.01214"},"observation_digest":"sha256:eaaa7b748a819081db2c85791dd57105849fc43c3c9ddc77b22f657ca2f266c2","observation_id":"144f14d8-65ed-459b-b16f-486ff941e6a7","resolution":{"observed_at":"2026-05-11T16:46:05.648188Z","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":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":"2412.20993","doi":"10.48550/arxiv.2412.20993","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jazbec, M., Timans, A., Hadˇzi Veljkovi´c, T., Sakmann, K., Zhang, D., Andersson Naesseth, C., and Nalisnick, E","venue":"arXiv (Cornell University)","work_id":"57494d13-0d57-400a-8e38-67a61f1677d1","year":2024},"citing_paper":{"arxiv_id":"2605.06165","last_updated":"2026-05-07T12:51:49Z","snapshot_observed_at":"2026-07-06T23:18:41.400741Z","submitted_at":"2026-05-07T12:51:49Z","title":"Post Reasoning: Improving the Performance of Non-Thinking Models at No Cost","version":1},"reference_index":104,"source":"arxiv_source","source_observed_at":"2026-05-08T10:19:08.451445Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2605.06165"},"observation_digest":"sha256:10f5a3219a59a7e70e1716e8768074dac18624643f5ed803c5e77ad29c3fb855","observation_id":"c195eeee-f61a-4458-aa65-c8b40db601fe","resolution":{"observed_at":"2026-05-11T20:06:09.038635Z","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":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":"2412.20993","doi":"10.48550/arxiv.2412.20993","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jazbec, M., Timans, A., Hadˇzi Veljkovi´c, T., Sakmann, K., Zhang, D., Andersson Naesseth, C., and Nalisnick, E","venue":"arXiv (Cornell University)","work_id":"57494d13-0d57-400a-8e38-67a61f1677d1","year":2024},"citing_paper":{"arxiv_id":"2605.10195","last_updated":"2026-05-14T07:42:56Z","snapshot_observed_at":"2026-08-03T09:42:12.047946Z","submitted_at":"2026-05-11T08:45:17Z","title":"Breaking the Reward Barrier: Accelerating Tree-of-Thought Reasoning via Speculative Exploration","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-12T03:51:52.375703Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2605.10195"},"observation_digest":"sha256:8ac3c032931195a3b78d5b918ce6b93aea79480a68a42bf1b8cd66fca468d512","observation_id":"c260c27a-a0f3-440e-8ac4-f804e5bb33b6","resolution":{"observed_at":"2026-05-12T06:51:30.161033Z","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":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":"2412.20993","doi":"10.48550/arxiv.2412.20993","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jazbec, M., Timans, A., Hadˇzi Veljkovi´c, T., Sakmann, K., Zhang, D., Andersson Naesseth, C., and Nalisnick, E","venue":"arXiv (Cornell University)","work_id":"57494d13-0d57-400a-8e38-67a61f1677d1","year":2024},"citing_paper":{"arxiv_id":"2605.10195","last_updated":"2026-05-14T07:42:56Z","snapshot_observed_at":"2026-08-03T09:42:12.047946Z","submitted_at":"2026-05-11T08:45:17Z","title":"Breaking the Reward Barrier: Accelerating Tree-of-Thought Reasoning via Speculative Exploration","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-15T05:11:32.053440Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2605.10195"},"observation_digest":"sha256:9af511ab43df3a8addeb84b320426e01cfcbebd937622bb60f135d3a08f2c16e","observation_id":"1ffb6007-add7-461b-8d80-d1c621e7db0e","resolution":{"observed_at":"2026-05-15T05:15:03.408639Z","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":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":"2412.20993","doi":"10.48550/arxiv.2412.20993","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jazbec, M., Timans, A., Hadˇzi Veljkovi´c, T., Sakmann, K., Zhang, D., Andersson Naesseth, C., and Nalisnick, E","venue":"arXiv (Cornell University)","work_id":"57494d13-0d57-400a-8e38-67a61f1677d1","year":2024},"citing_paper":{"arxiv_id":"2606.11470","last_updated":"2026-06-09T21:59:37Z","snapshot_observed_at":"2026-07-06T23:50:35.052764Z","submitted_at":"2026-06-09T21:59:37Z","title":"The Periodic Table of LLM Reasoning: A Structured Survey of Reasoning Paradigms, Methods, and Failure Modes","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-06-27T12:59:51.091008Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2606.11470"},"observation_digest":"sha256:c0366bb7596ff57ff86b924d5e1b07e4a0e54395b17608354fd5c2fc637bb8b5","observation_id":"cee36ee4-fde5-4d4b-8906-9f09f4b969b9","resolution":{"observed_at":"2026-07-03T05:57:41.631904Z","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":"2412.20993","last_updated":"2025-05-27T16:41:53Z","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20993","snapshot_observed_at":"2026-07-12T03:14:02.219678Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03333","last_updated":"2026-07-03T13:51:32Z","snapshot_observed_at":"2026-08-04T06:12:58.772470Z","submitted_at":"2026-07-03T13:51:32Z","title":"SPORK: Self-Speculative Forking to Accelerate Agentic LLM Inference","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-12T03:14:02.219678Z"},"links":{"cited_paper":"/paper/2412.20993","citing_paper":"/paper/2607.03333"},"observation_digest":"sha256:157f52f465015e0896a953c648362d2b97ee9cd14cdf2fb8dea40d4203bf4e9e","observation_id":"cbd79818-d374-45ba-a139-53d5172463d1","resolution":{"observed_at":"2026-07-12T03:14:02.219678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.20993/citation-record","integrity":"/paper/2412.20993/integrity","json":"/paper/2412.20993/citation-record.json","paper":"/paper/2412.20993"},"outbound":[],"paper":{"arxiv_id":"2412.20993","last_updated":"2025-05-27T16:41:53Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:14:40.579474Z","submitted_at":"2024-12-30T14:57:53Z","title":"Efficiently Scaling LLM Reasoning with Certaindex"},"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 23 inbound Pith citation observations for arXiv:2412.20993."}