{"as_of":"2026-08-09T07:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:519dad1fc1d5d3ddf651ce450b889eabf0ab87cef9d1d1b650a132af23c81f9a","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":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":22,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:01:43.740595Z","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-03T17:38:43.202475Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.16838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-07-03T17:38:43.202475Z","title":"Welleck, A","venue":null,"work_id":"ae71014f-ef22-4892-8b9d-bd2be660c01b","year":2024},"citing_paper":{"arxiv_id":"2409.02813","last_updated":"2025-05-22T08:22:02Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-04T15:31:26Z","title":"MMMU-Pro: A More Robust Multi-discipline Multimodal Understanding Benchmark","version":3},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-14T00:51:48.163349Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2409.02813"},"observation_digest":"sha256:13b166f05e476781911df8ca45beaf410072dfdfb329954a5e1b00c9178fc3df","observation_id":"65a128b4-8b6f-477f-9bc6-8dd7bdcb35d4","resolution":{"observed_at":"2026-05-14T00:51:48.421321Z","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":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-08T20:01:43.740595Z","title":"From de- coding to meta-generation: Inference-time algorithms for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05234","last_updated":"2025-06-16T06:53:48Z","snapshot_observed_at":"2026-08-09T00:43:26.676197Z","submitted_at":"2025-02-07T19:35:25Z","title":"Optimizing Temperature for Language Models with Multi-Sample Inference","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:43.740595Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2502.05234"},"observation_digest":"sha256:05388b010309c982a836f3936b54f0b5fb3fbd16aedc4332f9a6635debbe9ede","observation_id":"f8f1525b-96e7-4a7c-94f0-10ed0099f340","resolution":{"observed_at":"2026-08-08T20:01:43.740595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.16838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-07-03T17:38:43.202475Z","title":"Welleck, A","venue":null,"work_id":"ae71014f-ef22-4892-8b9d-bd2be660c01b","year":2024},"citing_paper":{"arxiv_id":"2505.15134","last_updated":"2025-05-21T05:39:11Z","snapshot_observed_at":"2026-08-08T21:58:35.154185Z","submitted_at":"2025-05-21T05:39:11Z","title":"The Unreasonable Effectiveness of Entropy Minimization in LLM Reasoning","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-05-18T15:58:33.219451Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2505.15134"},"observation_digest":"sha256:2ae847cd80444ef739ccca356e8b72a60cd76b7e94f40c8aa037b05e45184fd3","observation_id":"ebabf030-ed6d-4af9-a4bf-a996a5619b65","resolution":{"observed_at":"2026-05-18T15:58:33.547937Z","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":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-07T14:40:42.375970Z","title":"Welleck, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18149","last_updated":"2025-05-23T17:57:43Z","snapshot_observed_at":"2026-08-08T15:09:49.469387Z","submitted_at":"2025-05-23T17:57:43Z","title":"First Finish Search: Efficient Test-Time Scaling in Large Language Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:40:42.375970Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2505.18149"},"observation_digest":"sha256:b53d2e9b765f4c25bfdd48ed69544afe3f5639f022dc343d336250dc95241a68","observation_id":"07e50bf0-a5c8-4ad7-ade3-bd0e2263271b","resolution":{"observed_at":"2026-08-07T14:40:42.375970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-07T11:19:48.475482Z","title":"From decoding to meta-generation: Inference-time algorithms for large language models.arXiv preprint arXiv:2406.16838, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02867","last_updated":"2025-06-04T15:00:58Z","snapshot_observed_at":"2026-08-08T18:19:35.851376Z","submitted_at":"2025-06-03T13:31:10Z","title":"Demystifying Reasoning Dynamics with Mutual Information: Thinking Tokens are Information Peaks in LLM Reasoning","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T11:19:48.475482Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2506.02867"},"observation_digest":"sha256:a93744b96f78929a170f68717822796885df04f335396c1ba8e54519a57a4efa","observation_id":"f97a9193-d96a-40c9-8361-089ac140567c","resolution":{"observed_at":"2026-08-07T11:19:48.475482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-07T10:52:49.675555Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.04205","last_updated":"2025-06-04T17:49:10Z","snapshot_observed_at":"2026-08-07T10:43:17.329577Z","submitted_at":"2025-06-04T17:49:10Z","title":"EPiC: Towards Lossless Speedup for Reasoning Training through Edge-Preserving CoT Condensation","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T10:52:49.675555Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2506.04205"},"observation_digest":"sha256:3d14484984a536bfc84ffc40e5278531b4cafc0c10227039c78631f7c0f123c7","observation_id":"4a6f70b4-328a-4871-bfd8-7e74942e7ec9","resolution":{"observed_at":"2026-08-07T10:52:49.675555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-07T10:42:41.082119Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04611","last_updated":"2025-06-05T04:02:17Z","snapshot_observed_at":"2026-08-07T13:54:09.003484Z","submitted_at":"2025-06-05T04:02:17Z","title":"Revisiting Test-Time Scaling: A Survey and a Diversity-Aware Method for Efficient Reasoning","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-07T10:42:41.082119Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2506.04611"},"observation_digest":"sha256:fc59badceb533f9c82070dcbdf1d982911f7fedeb240a40d03c972986bde06d0","observation_id":"169aae46-5f0f-469b-89dd-d35faa0f2fb6","resolution":{"observed_at":"2026-08-07T10:42:41.082119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-07T05:45:05.953393Z","title":"From decoding to meta-generation: Inference-time algorithms for large language models.arXiv preprint arXiv:2406.16838, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07240","last_updated":"2025-06-08T17:54:33Z","snapshot_observed_at":"2026-08-08T11:50:21.329290Z","submitted_at":"2025-06-08T17:54:33Z","title":"Overclocking LLM Reasoning: Monitoring and Controlling Thinking Path Lengths in LLMs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T05:45:05.953393Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2506.07240"},"observation_digest":"sha256:30eec522ab863a085173ace949e2a2bea370af0b740106c782e8b4b2b2665c89","observation_id":"c062ef60-2ff6-4845-bad7-00bc850adc90","resolution":{"observed_at":"2026-08-07T05:45:05.953393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-06T18:59:42.867863Z","title":"From decoding to meta-generation: Inference-time algorithms for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06829","last_updated":"2025-07-09T13:28:35Z","snapshot_observed_at":"2026-08-07T18:20:33.639424Z","submitted_at":"2025-07-09T13:28:35Z","title":"Adaptive Termination for Multi-round Parallel Reasoning: An Universal Semantic Entropy-Guided Framework","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:42.867863Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2507.06829"},"observation_digest":"sha256:7769fbc824f09f4ba2c4c388a7e0e4e10b5dd7f3954b030ee58e84555d3c523d","observation_id":"64a1a329-7c7c-44fc-9d7b-6257ba1da799","resolution":{"observed_at":"2026-08-06T18:59:42.867863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-06T17:41:43.281934Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10182","last_updated":"2025-07-14T11:44:04Z","snapshot_observed_at":"2026-08-08T23:20:51.475560Z","submitted_at":"2025-07-14T11:44:04Z","title":"Breaking the Myth: Can Small Models Infer Postconditions Too?","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T17:41:43.281934Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2507.10182"},"observation_digest":"sha256:58ae81551767ac7e9147e5147d48524da61001d74df1834f9249a6d9048a0ea1","observation_id":"bffdefc5-372f-4dbe-a03c-3aa5e4d5ae58","resolution":{"observed_at":"2026-08-06T17:41:43.281934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-06T15:29:43.802572Z","title":"From decoding to meta-generation: Inference-time algorithms for large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.15758","last_updated":"2025-08-14T08:13:36Z","snapshot_observed_at":"2026-08-09T00:50:41.198666Z","submitted_at":"2025-07-21T16:14:41Z","title":"LAPO: Internalizing Reasoning Efficiency via Length-Adaptive Policy Optimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T15:29:43.802572Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2507.15758"},"observation_digest":"sha256:5e2251f793d20164445bf1a6ae2893ca0d0293c38803373c34da60227e8ec566","observation_id":"88529ffc-21a4-4fa3-a5bc-debeba036124","resolution":{"observed_at":"2026-08-06T15:29:43.802572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.16838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-07-03T17:38:43.202475Z","title":"Welleck, A","venue":null,"work_id":"ae71014f-ef22-4892-8b9d-bd2be660c01b","year":2024},"citing_paper":{"arxiv_id":"2509.01728","last_updated":"2026-04-16T14:35:52Z","snapshot_observed_at":"2026-07-06T22:21:53.366107Z","submitted_at":"2025-09-01T19:17:40Z","title":"Constrained Decoding for Safe Robot Navigation Foundation Models","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T19:07:18.832187Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2509.01728"},"observation_digest":"sha256:f93a786fe5c10aa25131f5365b1ea69fd67dbec440554aadc99a683c6d0fd20e","observation_id":"5e43cafe-23dc-4a78-b566-a04e133c414e","resolution":{"observed_at":"2026-05-18T19:11:47.487030Z","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":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-03T07:05:16.731784Z","title":"emnlp-main.1112/","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.21522","last_updated":"2026-06-06T17:02:11Z","snapshot_observed_at":"2026-08-03T07:05:11.933104Z","submitted_at":"2026-01-29T10:37:32Z","title":"More Bang for the Buck: Improving the Inference of Large Language Models at a Fixed Budget using Reset and Discard (ReD)","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T07:05:16.731784Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2601.21522"},"observation_digest":"sha256:a2f259b5493bc1f2abcb6cad21a34102b9cce4863474b1a180bca58e2afe73b1","observation_id":"138070ef-4331-45e5-8e85-f6187ae41eaa","resolution":{"observed_at":"2026-08-03T07:05:16.731784Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.16838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-07-03T17:38:43.202475Z","title":"Welleck, A","venue":null,"work_id":"ae71014f-ef22-4892-8b9d-bd2be660c01b","year":2024},"citing_paper":{"arxiv_id":"2604.04944","last_updated":"2026-06-03T03:25:10Z","snapshot_observed_at":"2026-08-08T14:36:27.423833Z","submitted_at":"2026-03-15T13:13:55Z","title":"Inclusion-of-Thoughts: Mitigating Preference Instability via Purifying the Decision Space","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-15T11:31:38.301306Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2604.04944"},"observation_digest":"sha256:a1e81cfa0d10fe6589d06f9c09c66a0782f1219bcf487a39cffc51e65d566076","observation_id":"1c061466-5610-43c7-9499-b9a75e33aa87","resolution":{"observed_at":"2026-05-15T11:35:31.732550Z","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":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.16838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-07-03T17:38:43.202475Z","title":"Welleck, A","venue":null,"work_id":"ae71014f-ef22-4892-8b9d-bd2be660c01b","year":2024},"citing_paper":{"arxiv_id":"2604.10667","last_updated":"2026-04-12T14:50:03Z","snapshot_observed_at":"2026-07-06T22:59:13.936436Z","submitted_at":"2026-04-12T14:50:03Z","title":"Learning and Enforcing Context-Sensitive Control for LLMs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-10T16:30:01.340343Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2604.10667"},"observation_digest":"sha256:ccabf419443af7c7c6fb5e169892a3c8e6191f69211367389ad0060d30724ad2","observation_id":"0278de20-04f1-4f31-9b3d-e8ee64cfc822","resolution":{"observed_at":"2026-05-11T08:46:00.108565Z","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":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.16838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-07-03T17:38:43.202475Z","title":"Welleck, A","venue":null,"work_id":"ae71014f-ef22-4892-8b9d-bd2be660c01b","year":2024},"citing_paper":{"arxiv_id":"2604.10827","last_updated":"2026-04-12T21:49:13Z","snapshot_observed_at":"2026-08-05T18:01:30.449144Z","submitted_at":"2026-04-12T21:49:13Z","title":"Your Model Diversity, Not Method, Determines Reasoning Strategy","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-10T15:16:30.448400Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2604.10827"},"observation_digest":"sha256:0372333b5e460b996b8b4dda115a33702a5e49776ab358a411c6ccb7b65484fc","observation_id":"c351be8c-bc7b-45ce-b1cd-06d833d2024b","resolution":{"observed_at":"2026-05-11T10:56:02.685136Z","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":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.16838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-07-03T17:38:43.202475Z","title":"Welleck, A","venue":null,"work_id":"ae71014f-ef22-4892-8b9d-bd2be660c01b","year":2024},"citing_paper":{"arxiv_id":"2605.03356","last_updated":"2026-05-05T04:29:38Z","snapshot_observed_at":"2026-08-06T23:24:38.436110Z","submitted_at":"2026-05-05T04:29:38Z","title":"POSTCONDBENCH: Benchmarking Correctness and Completeness in Formal Postcondition Inference","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-07T16:04:48.394294Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2605.03356"},"observation_digest":"sha256:2bcf5fb4d685809ba1064cc7091e0ef5e443b406b86664a81bf3749806a1e3c1","observation_id":"442a1a53-24e4-4ae1-8553-e51dcf596288","resolution":{"observed_at":"2026-05-11T23:56:12.233653Z","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":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.16838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-07-03T17:38:43.202475Z","title":"Welleck, A","venue":null,"work_id":"ae71014f-ef22-4892-8b9d-bd2be660c01b","year":2024},"citing_paper":{"arxiv_id":"2605.04559","last_updated":"2026-05-06T07:02:57Z","snapshot_observed_at":"2026-08-08T18:36:55.802002Z","submitted_at":"2026-05-06T07:02:57Z","title":"Beyond Static Best-of-N: Bayesian List-wise Alignment for LLM-based Recommendation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-08T17:06:18.050592Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2605.04559"},"observation_digest":"sha256:20f514ca0ec36efb2f5d4484f7791ed288ca46ebeccdb5fc81252953cc4ce28b","observation_id":"f31e2c5c-606e-4b10-8d2a-b03c7cdf1c13","resolution":{"observed_at":"2026-05-11T17:51:06.535062Z","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":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.16838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-07-03T17:38:43.202475Z","title":"Welleck, A","venue":null,"work_id":"ae71014f-ef22-4892-8b9d-bd2be660c01b","year":2024},"citing_paper":{"arxiv_id":"2605.11361","last_updated":"2026-05-12T00:25:57Z","snapshot_observed_at":"2026-08-07T14:00:41.552623Z","submitted_at":"2026-05-12T00:25:57Z","title":"The tractability landscape of diffusion alignment: regularization, rewards, and computational primitives","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-13T02:49:53.547490Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2605.11361"},"observation_digest":"sha256:e0237093318ff3823b93efc73067dcb6c3c57f67f9a90df4fa9004cdeede72f6","observation_id":"fe87dc92-5570-43e1-befd-5ca5ec8e57cc","resolution":{"observed_at":"2026-05-13T02:52:08.940656Z","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":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.16838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-07-03T17:38:43.202475Z","title":"Welleck, A","venue":null,"work_id":"ae71014f-ef22-4892-8b9d-bd2be660c01b","year":2024},"citing_paper":{"arxiv_id":"2606.12384","last_updated":"2026-07-31T08:54:09Z","snapshot_observed_at":"2026-08-05T23:10:46.327902Z","submitted_at":"2026-06-10T17:47:07Z","title":"APPO: Agentic Procedural Policy Optimization","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-06-27T10:21:55.485624Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2606.12384"},"observation_digest":"sha256:17a3db51bda61431fbd4ad2fe019f4189f4df56a353d813ce6e321d36133bb3b","observation_id":"2f1b3824-3017-409d-8113-e49c85894ad8","resolution":{"observed_at":"2026-07-03T09:37:49.411484Z","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":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-03T02:12:33.576211Z","title":"Welleck, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12384","last_updated":"2026-07-31T08:54:09Z","snapshot_observed_at":"2026-08-05T23:10:46.327902Z","submitted_at":"2026-06-10T17:47:07Z","title":"APPO: Agentic Procedural Policy Optimization","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-03T02:12:33.576211Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2606.12384"},"observation_digest":"sha256:acf89b9b8d774dbe8d69760c99c112025a75cf41dfb8e55982c9c13a8c15b679","observation_id":"e5e7acfa-e40c-40f5-9e12-93afd7143104","resolution":{"observed_at":"2026-08-03T02:12:33.576211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.16838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-07-03T17:38:43.202475Z","title":"Welleck, A","venue":null,"work_id":"ae71014f-ef22-4892-8b9d-bd2be660c01b","year":2024},"citing_paper":{"arxiv_id":"2607.01571","last_updated":"2026-07-02T01:03:49Z","snapshot_observed_at":"2026-08-08T10:42:41.875393Z","submitted_at":"2026-07-02T01:03:49Z","title":"Geometric Signatures of Reasoning: A Spectral Perspective on Task Hardness","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-03T17:36:09.322804Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2607.01571"},"observation_digest":"sha256:2a760246c8e70cb5995808021a94d02a5d2df38d0bbcf7ffa62cb1c8bb4ac919","observation_id":"06c0c9b8-e752-4957-9882-95aa9834f762","resolution":{"observed_at":"2026-07-03T17:38:43.204194Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2406.16838/citation-record","integrity":"/paper/2406.16838/integrity","json":"/paper/2406.16838/citation-record.json","paper":"/paper/2406.16838"},"outbound":[],"paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T18:36:12.298104Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models"},"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 22 inbound Pith citation observations for arXiv:2406.16838."}