{"as_of":"2026-08-09T09:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b6d98bd40e3ea19f7b9231f619f159f31e3c881e7ef8b046c38206f5b9c13c26","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-07T11:04:06.872561Z","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-02T05:16:38.985376Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-08-07T11:04:06.872561Z","title":"Is best-of-n the best of them? coverage, scaling, and optimality in inference-time alignment,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03637","last_updated":"2025-07-07T09:53:22Z","snapshot_observed_at":"2026-08-08T03:23:19.289933Z","submitted_at":"2025-06-04T07:30:16Z","title":"RewardAnything: Generalizable Principle-Following Reward Models","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:06.872561Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2506.03637"},"observation_digest":"sha256:0d2982d2a5cd61ef014acabf4d290b3400fd16997ce323c28544842cdd8182f2","observation_id":"036900c6-a90b-497d-a489-085704e09552","resolution":{"observed_at":"2026-08-07T11:04:06.872561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-08-07T10:42:39.725868Z","title":null,"venue":null,"work_id":null,"year":2025},"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":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:42:39.725868Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2506.04611"},"observation_digest":"sha256:18efd2faf89ae7af52a97ed124352a3cba1e0dd70067a39e8f3b03cf26ede0a4","observation_id":"3c06fc9b-2a05-402e-82ec-78bfa3c8caf7","resolution":{"observed_at":"2026-08-07T10:42:39.725868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-08-06T20:42:38.428205Z","title":"Is best-of-n the best of them? coverage, scaling, and optimality in inference-time alignment","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.02092","last_updated":"2025-07-02T19:17:29Z","snapshot_observed_at":"2026-08-08T04:36:50.019846Z","submitted_at":"2025-07-02T19:17:29Z","title":"Energy-Based Transformers are Scalable Learners and Thinkers","version":1},"reference_index":124,"source":"pdf_text","source_observed_at":"2026-08-06T20:42:38.428205Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2507.02092"},"observation_digest":"sha256:7b86202569e2ac22509af519f94b1301c1229956aa7e800324360ff119af21e7","observation_id":"a5f4c55d-e11d-40d3-aec0-7855044b2693","resolution":{"observed_at":"2026-08-06T20:42:38.428205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-08-06T19:28:55.252415Z","title":"Is best-of-n the best of them? coverage, scaling, and optimality in inference-time alignment","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.05913","last_updated":"2025-07-08T11:59:48Z","snapshot_observed_at":"2026-08-09T02:51:17.508221Z","submitted_at":"2025-07-08T11:59:48Z","title":"Best-of-N through the Smoothing Lens: KL Divergence and Regret Analysis","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T19:28:55.252415Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2507.05913"},"observation_digest":"sha256:7728470123577ef7e01d4be1151317cdc58b763fa286e53566fd25683b53287e","observation_id":"c363c589-ea24-4b53-b71c-b72722679d1d","resolution":{"observed_at":"2026-08-06T19:28:55.252415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-08-04T12:27:28.677111Z","title":"Is best-of-n the best of them? coverage, scaling, and optimality in inference-time alignment","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.03520","last_updated":"2026-06-10T17:21:57Z","snapshot_observed_at":"2026-08-07T07:08:30.567791Z","submitted_at":"2025-10-03T21:24:41Z","title":"Certifiable Safe RLHF: Semantic Grounding and Fixed Penalty Constraint Optimization for Safer LLM Alignment","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T12:27:28.677111Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2510.03520"},"observation_digest":"sha256:0e9137285224dca4184adb696a4849cbbf876ed47d75c7d93632a230005fbf7e","observation_id":"b1eedb84-d2c5-426a-9e33-912863c3482f","resolution":{"observed_at":"2026-08-04T12:27:28.677111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-08-04T07:23:56.445972Z","title":"Is best-of-n the best of them? coverage, scaling, and optimality in inference-time alignment.arXiv preprint arXiv:2503.21878,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.26219","last_updated":"2026-06-03T00:59:51Z","snapshot_observed_at":"2026-08-04T07:23:55.106713Z","submitted_at":"2025-10-30T07:52:14Z","title":"Test-time reward-guided alignment of language models by importance sampling on pre-logit space","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T07:23:56.445972Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2510.26219"},"observation_digest":"sha256:fd5f2e8e03544021f6e7adc450f0031fecf4cf9eda9f5b30c35f2f773b62c777","observation_id":"e1f1d9af-ee3b-4ba9-8fc0-b67dd614abff","resolution":{"observed_at":"2026-08-04T07:23:56.445972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":"2503.21878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-07-02T05:16:38.985376Z","title":"arXiv preprint arXiv:2503.21878 , year=","venue":null,"work_id":"a609293c-a7fe-4aab-a912-90348355a2f5","year":2025},"citing_paper":{"arxiv_id":"2603.27098","last_updated":"2026-04-04T02:18:57Z","snapshot_observed_at":"2026-08-02T12:17:19.632566Z","submitted_at":"2026-03-28T02:37:36Z","title":"Ensemble-Based Uncertainty Estimation for Code Correctness Estimation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-14T22:52:58.524934Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2603.27098"},"observation_digest":"sha256:1c90cd571215d0b869a2ed16abac4dec344f11ddd9d5c0a66186f1c8326213fc","observation_id":"d26b59bd-b657-4a4a-8397-00f7e03f55b9","resolution":{"observed_at":"2026-05-14T22:53:14.199688Z","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":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":"2503.21878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-07-02T05:16:38.985376Z","title":"arXiv preprint arXiv:2503.21878 , year=","venue":null,"work_id":"a609293c-a7fe-4aab-a912-90348355a2f5","year":2025},"citing_paper":{"arxiv_id":"2604.16453","last_updated":"2026-04-07T21:48:04Z","snapshot_observed_at":"2026-08-09T06:15:24.614401Z","submitted_at":"2026-04-07T21:48:04Z","title":"Sampling for Quality: Training-Free Reward-Guided LLM Decoding via Sequential Monte Carlo","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T19:01:57.854016Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2604.16453"},"observation_digest":"sha256:f3a108481979ee0a999a5b264bbf80a139aa8e1f8f67066cafd5b59bd08aef26","observation_id":"6c42e32f-8c99-4d6e-b3fe-1f5d39d854ac","resolution":{"observed_at":"2026-05-10T23:35:50.372813Z","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":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":"2503.21878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-07-02T05:16:38.985376Z","title":"arXiv preprint arXiv:2503.21878 , year=","venue":null,"work_id":"a609293c-a7fe-4aab-a912-90348355a2f5","year":2025},"citing_paper":{"arxiv_id":"2605.09214","last_updated":"2026-05-09T23:17:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-09T23:17:46Z","title":"Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-12T03:47:14.379908Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2605.09214"},"observation_digest":"sha256:8d1b637f02db6ab2d65b58e6b8fa6d94e0a778f8d990f4b85cbcb1a5a3ebc261","observation_id":"8718ff47-ecad-4236-a059-64cff8b34601","resolution":{"observed_at":"2026-05-12T06:56:31.035673Z","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":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":"2503.21878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-07-02T05:16:38.985376Z","title":"arXiv preprint arXiv:2503.21878 , year=","venue":null,"work_id":"a609293c-a7fe-4aab-a912-90348355a2f5","year":2025},"citing_paper":{"arxiv_id":"2605.31561","last_updated":"2026-05-29T17:27:07Z","snapshot_observed_at":"2026-08-08T11:03:12.261641Z","submitted_at":"2026-05-29T17:27:07Z","title":"What Am I Missing? Question-Answering as Hidden State Probing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T22:17:50.790267Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2605.31561"},"observation_digest":"sha256:fc3aa25310319f63e47e62a2deb1207e48e48561aa536162785b0915250817bb","observation_id":"c997471f-9e60-469e-a18a-2d7bd4083bc1","resolution":{"observed_at":"2026-07-01T19:36:08.895554Z","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":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":"2503.21878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-07-02T05:16:38.985376Z","title":"arXiv preprint arXiv:2503.21878 , year=","venue":null,"work_id":"a609293c-a7fe-4aab-a912-90348355a2f5","year":2025},"citing_paper":{"arxiv_id":"2606.01075","last_updated":"2026-06-02T05:50:15Z","snapshot_observed_at":"2026-08-08T11:14:54.052517Z","submitted_at":"2026-05-31T07:43:19Z","title":"On the Generalization Gap in Self-Evolving Language Model Reasoning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T17:18:37.671369Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2606.01075"},"observation_digest":"sha256:e3931e67352b0a819d43164deb86327b77d758947ccd9c0e4e1169bc37bfccfd","observation_id":"5aa575b6-57f0-4a85-9993-76f83eeccc51","resolution":{"observed_at":"2026-06-28T17:22:24.893889Z","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":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":"2503.21878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-07-02T05:16:38.985376Z","title":"arXiv preprint arXiv:2503.21878 , year=","venue":null,"work_id":"a609293c-a7fe-4aab-a912-90348355a2f5","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":18,"source":"pdf_text","source_observed_at":"2026-06-28T15:27:28.290178Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2606.01667"},"observation_digest":"sha256:27cf6e8a743d3b27068050a9cadafa6004bbd1d5e8e1e73d557ba58ba5a0ddbb","observation_id":"99329a7c-d196-4f49-bd70-f68613a58d9d","resolution":{"observed_at":"2026-07-01T22:26:17.054209Z","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":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":"2503.21878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-07-02T05:16:38.985376Z","title":"arXiv preprint arXiv:2503.21878 , year=","venue":null,"work_id":"a609293c-a7fe-4aab-a912-90348355a2f5","year":2025},"citing_paper":{"arxiv_id":"2606.03102","last_updated":"2026-06-02T03:42:04Z","snapshot_observed_at":"2026-08-03T04:21:57.609394Z","submitted_at":"2026-06-02T03:42:04Z","title":"Small RL Controller, Large Language Model: RL-Guided Adaptive Sampling for Test-Time Scaling","version":1},"reference_index":123,"source":"arxiv_source","source_observed_at":"2026-06-28T10:25:10.559953Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2606.03102"},"observation_digest":"sha256:6d25db88a8d86ea61027a4e240879539a8eccb028ea697f9d539e01051372512","observation_id":"26386fdd-bba5-421a-b344-95a61648d0a0","resolution":{"observed_at":"2026-07-02T02:56:30.056279Z","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":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":"2503.21878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-07-02T05:16:38.985376Z","title":"arXiv preprint arXiv:2503.21878 , year=","venue":null,"work_id":"a609293c-a7fe-4aab-a912-90348355a2f5","year":2025},"citing_paper":{"arxiv_id":"2606.03217","last_updated":"2026-06-02T06:23:31Z","snapshot_observed_at":"2026-07-06T23:43:31.629075Z","submitted_at":"2026-06-02T06:23:31Z","title":"An Asymptotic Theory of Chain-of-Thought in In-Context Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T08:25:37.421049Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2606.03217"},"observation_digest":"sha256:502880a749604858000cd68328af55125bc5017afdd3114002a5ddb87fe0aa5b","observation_id":"5dae0ac5-7871-4b81-9c96-f26ec72ceac8","resolution":{"observed_at":"2026-07-02T05:16:38.987559Z","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":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":"2503.21878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-07-02T05:16:38.985376Z","title":"arXiv preprint arXiv:2503.21878 , year=","venue":null,"work_id":"a609293c-a7fe-4aab-a912-90348355a2f5","year":2025},"citing_paper":{"arxiv_id":"2606.28301","last_updated":"2026-06-26T17:47:09Z","snapshot_observed_at":"2026-08-02T02:03:31.342808Z","submitted_at":"2026-06-26T17:47:09Z","title":"VGB for Masked Diffusion Model: Efficient Test-time Scaling for Reward Satisfaction and Sample Editing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T04:06:13.157976Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2606.28301"},"observation_digest":"sha256:f9b5f16140618cc188d0ca02aa5e98fa0e518e9541be38de209feb8dafe8dd18","observation_id":"e06b7dac-188f-49af-9687-e60345fbd318","resolution":{"observed_at":"2026-07-01T17:15:50.717883Z","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":"2503.21878","last_updated":"2025-04-07T17:44:38Z","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.21878","snapshot_observed_at":"2026-08-01T21:26:34.271964Z","title":"arXiv preprint arXiv:2503.21878 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16097","last_updated":"2026-07-17T16:31:58Z","snapshot_observed_at":"2026-08-06T17:15:55.816920Z","submitted_at":"2026-07-17T16:31:58Z","title":"Understanding Reasoning from Pretraining to Post-Training","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T21:26:34.271964Z"},"links":{"cited_paper":"/paper/2503.21878","citing_paper":"/paper/2607.16097"},"observation_digest":"sha256:d2f92c4aabdcc1a2018fc0f4d9280effcd85be1714cf427fc11828eb9c42ba3b","observation_id":"77660dd6-614d-41b8-b6d4-c78b36dbc429","resolution":{"observed_at":"2026-08-01T21:26:34.271964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.21878/citation-record","integrity":"/paper/2503.21878/integrity","json":"/paper/2503.21878/citation-record.json","paper":"/paper/2503.21878"},"outbound":[],"paper":{"arxiv_id":"2503.21878","last_updated":"2025-04-07T17:44:38Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T16:31:54.737337Z","submitted_at":"2025-03-27T18:00:08Z","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment"},"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:2503.21878."}