{"as_of":"2026-08-10T23:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:abcc2e6fd826bd151a9331ec9d5b381f0bc44730b18e72979e2d3f9d1b1567f0","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":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:51:25.352807Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-09T00:45:49.072350Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-08-10T17:51:25.352807Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13122","last_updated":"2025-01-21T03:52:54Z","snapshot_observed_at":"2026-08-10T17:44:25.973061Z","submitted_at":"2025-01-21T03:52:54Z","title":"Zero-Shot Verification-guided Chain of Thoughts","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T17:51:25.352807Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2501.13122"},"observation_digest":"sha256:86f3f7704fbf8a437eaa0effb82ecad5c479daa9965f5bfc8a852d0d301461cc","observation_id":"2271c1b0-e960-4965-9c25-d1f58d8dfde8","resolution":{"observed_at":"2026-08-10T17:51:25.352807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":"2410.16033","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-07-09T00:45:49.072350Z","title":"Treebon: Enhancing inference-time alignment with speculative tree-search and best-of-n sampling","venue":"cs.CL","work_id":"52e364b7-ec29-49e0-bdd1-c4b919e4d1e6","year":2024},"citing_paper":{"arxiv_id":"2502.17419","last_updated":"2025-06-25T02:24:46Z","snapshot_observed_at":"2026-08-10T09:42:17.185681Z","submitted_at":"2025-02-24T18:50:52Z","title":"From System 1 to System 2: A Survey of Reasoning Large Language Models","version":6},"reference_index":129,"source":"pdf_text","source_observed_at":"2026-05-13T01:36:23.845366Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2502.17419"},"observation_digest":"sha256:02ebf9f21ecb928a6039586162f8ad66de96d993685fcaef81ec1c192cb20c19","observation_id":"e1f9c918-fde6-45bb-b20c-dc66ed26d1d6","resolution":{"observed_at":"2026-05-13T01:36:24.055270Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-08-07T15:15:46.338984Z","title":"Treebon: Enhancing inference-time alignment with speculative tree-search and best-of-n sampling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.17122","last_updated":"2025-05-21T17:59:02Z","snapshot_observed_at":"2026-08-08T23:38:32.695642Z","submitted_at":"2025-05-21T17:59:02Z","title":"Shallow Preference Signals: Large Language Model Aligns Even Better with Truncated Data?","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:15:46.338984Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2505.17122"},"observation_digest":"sha256:065b3ed8bdece2152fee90ca47470709357246fde9f06998cb77861a91e2819b","observation_id":"cbfe94fd-9683-4d9b-802f-3a45d98322da","resolution":{"observed_at":"2026-08-07T15:15:46.338984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-08-07T13:21:29.888336Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23829","last_updated":"2025-05-28T08:09:10Z","snapshot_observed_at":"2026-08-09T06:22:27.102400Z","submitted_at":"2025-05-28T08:09:10Z","title":"BiasFilter: An Inference-Time Debiasing Framework for Large Language Models","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T13:21:29.888336Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2505.23829"},"observation_digest":"sha256:eca752f6e9c53e11a74df254eb00137ee3439243ea40f0488783794df6fc778c","observation_id":"1ba48adb-fbe7-4abb-8354-cbc80fb8479f","resolution":{"observed_at":"2026-08-07T13:21:29.888336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-08-07T12:35:43.551478Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24863","last_updated":"2025-05-30T17:58:36Z","snapshot_observed_at":"2026-08-07T20:38:56.380571Z","submitted_at":"2025-05-30T17:58:36Z","title":"AlphaOne: Reasoning Models Thinking Slow and Fast at Test Time","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:43.551478Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2505.24863"},"observation_digest":"sha256:b1d1dd73ec15debb80901a082f732555584d55a791d6f360f1f477295e17b25b","observation_id":"98ceab6f-63fb-4f54-b4a1-9b16b5104084","resolution":{"observed_at":"2026-08-07T12:35:43.551478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-08-07T10:35:37.529991Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05295","last_updated":"2025-06-12T16:25:06Z","snapshot_observed_at":"2026-08-09T19:56:00.688282Z","submitted_at":"2025-06-05T17:48:19Z","title":"Sample Complexity and Representation Ability of Test-time Scaling Paradigms","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T10:35:37.529991Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2506.05295"},"observation_digest":"sha256:bfa1542d28b98731de15820b3ab842728709f264a3d86a20275f44a8ad29a582","observation_id":"f62bbeb3-0f23-42d8-839b-adc3b227546e","resolution":{"observed_at":"2026-08-07T10:35:37.529991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-08-07T05:14:57.313848Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.09085","last_updated":"2025-06-10T08:10:16Z","snapshot_observed_at":"2026-08-09T05:50:10.011776Z","submitted_at":"2025-06-10T08:10:16Z","title":"LLM-ML Teaming: Integrated Symbolic Decoding and Gradient Search for Valid and Stable Generative Feature Transformation","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T05:14:57.313848Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2506.09085"},"observation_digest":"sha256:965e6087c46f17edffdb78e035c48670c32944301415a3e07dd36b6f1024f09d","observation_id":"92ffa6b4-2e13-44e1-9e2f-18ea4ffd987b","resolution":{"observed_at":"2026-08-07T05:14:57.313848Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-08-06T19:28:57.548449Z","title":"Treebon: Enhancing inference-time alignment with speculative tree-search and best-of-n sampling","venue":null,"work_id":null,"year":null},"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":45,"source":"arxiv_source","source_observed_at":"2026-08-06T19:28:57.548449Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2507.05913"},"observation_digest":"sha256:e02aa6ee9c9c109f115227ee2075c1a72cad261ddd0d7fb24bbcf420321dbfb8","observation_id":"380b06d1-6599-4930-a23b-5248a0d52bd6","resolution":{"observed_at":"2026-08-06T19:28:57.548449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-08-05T21:18:45.799094Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09016","last_updated":"2025-09-10T05:08:47Z","snapshot_observed_at":"2026-08-09T06:48:43.608452Z","submitted_at":"2025-08-12T15:30:44Z","title":"A Survey on Training-free Alignment of Large Language Models","version":4},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:45.799094Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2508.09016"},"observation_digest":"sha256:d1a7466bc049fd1e6e9ef517e72ea6b9ad7fbe18503fc15f4e839bf02a47729d","observation_id":"437b1228-ae30-49a6-8ea7-f2337620eea3","resolution":{"observed_at":"2026-08-05T21:18:45.799094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-08-05T20:17:11.414943Z","title":"Treebon: Enhancing inference-time alignment with speculative tree-search and best-of-n sampling, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.10874","last_updated":"2025-08-14T17:46:01Z","snapshot_observed_at":"2026-08-06T03:19:32.559275Z","submitted_at":"2025-08-14T17:46:01Z","title":"SSRL: Self-Search Reinforcement Learning","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T20:17:11.414943Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2508.10874"},"observation_digest":"sha256:4b8fec42607a411fb3a2e03aff7f66bcd74c07cfb6363f789519a4f9f796f2fb","observation_id":"fb3313db-e19b-4ff9-b1ad-dbfe0c1f15ce","resolution":{"observed_at":"2026-08-05T20:17:11.414943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-08-05T11:57:17.198660Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02129","last_updated":"2025-09-02T09:25:13Z","snapshot_observed_at":"2026-08-10T13:43:39.475451Z","submitted_at":"2025-09-02T09:25:13Z","title":"Scale, Don't Fine-tune: Guiding Multimodal LLMs for Efficient Visual Place Recognition at Test-Time","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T11:57:17.198660Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2509.02129"},"observation_digest":"sha256:dbf9a48cd49338440195d084216e401c7f2e9daa442d24a6c9682ed9a7cfc10d","observation_id":"c266c17b-4bbe-4c14-a8b9-b450801b6029","resolution":{"observed_at":"2026-08-05T11:57:17.198660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":"2410.16033","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-07-09T00:45:49.072350Z","title":"Treebon: Enhancing inference-time alignment with speculative tree-search and best-of-n sampling","venue":"cs.CL","work_id":"52e364b7-ec29-49e0-bdd1-c4b919e4d1e6","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":47,"source":"pdf_text","source_observed_at":"2026-05-12T03:51:52.375703Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2605.10195"},"observation_digest":"sha256:87f8a907f5bdc0a926780b060a3e2681fffc1ea64d299e52b7e645b3439355f6","observation_id":"f7a4e015-5ba9-445f-9f79-93949c509827","resolution":{"observed_at":"2026-05-12T06:51:30.131878Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":"2410.16033","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-07-09T00:45:49.072350Z","title":"Treebon: Enhancing inference-time alignment with speculative tree-search and best-of-n sampling","venue":"cs.CL","work_id":"52e364b7-ec29-49e0-bdd1-c4b919e4d1e6","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":47,"source":"pdf_text","source_observed_at":"2026-05-15T05:11:32.053440Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2605.10195"},"observation_digest":"sha256:dc811b566733acc082946ad061c883f2f91f1066fca23658686e2c3f115be635","observation_id":"8ced4b51-1399-4a2b-b23e-2f5a61db087a","resolution":{"observed_at":"2026-05-15T05:15:03.231199Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling","version":4},"cited_work":{"arxiv_id":"2410.16033","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.16033","snapshot_observed_at":"2026-07-09T00:45:49.072350Z","title":"Treebon: Enhancing inference-time alignment with speculative tree-search and best-of-n sampling","venue":"cs.CL","work_id":"52e364b7-ec29-49e0-bdd1-c4b919e4d1e6","year":2024},"citing_paper":{"arxiv_id":"2607.06974","last_updated":"2026-07-08T03:51:37Z","snapshot_observed_at":"2026-08-07T21:40:41.662460Z","submitted_at":"2026-07-08T03:51:37Z","title":"MILES: Modular Instruction Memory with Learnable Selection for Self-Improving LLM Reasoning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-09T00:45:00.847714Z"},"links":{"cited_paper":"/paper/2410.16033","citing_paper":"/paper/2607.06974"},"observation_digest":"sha256:a7ea2bfb00e020a5dd859c4c0dc0d4d76caa99364b673a994cd3fb97ca2fde1a","observation_id":"81a4a1f0-366f-4eef-bed7-dfa0acd95d20","resolution":{"observed_at":"2026-07-09T00:45:49.073737Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.16033/citation-record","integrity":"/paper/2410.16033/integrity","json":"/paper/2410.16033/citation-record.json","paper":"/paper/2410.16033"},"outbound":[],"paper":{"arxiv_id":"2410.16033","last_updated":"2025-09-03T03:41:08Z","latest_version":4,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T08:34:28.320325Z","submitted_at":"2024-10-18T04:38:21Z","title":"TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 14 inbound Pith citation observations for arXiv:2410.16033."}