{"as_of":"2026-08-10T14:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d2de34335220e4c1b98e078f5457e0c0c164f2d78c701778361c9cdb6d9fb83e","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T18:53:44.219142Z","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-03T05:57:41.442502Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.15797","last_updated":"2024-12-20T11:14:29Z","snapshot_observed_at":"2026-08-09T23:05:07.508297Z","submitted_at":"2024-12-20T11:14:29Z","title":"Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15797","snapshot_observed_at":"2026-08-09T18:53:44.219142Z","title":"Ensembling large language models with process reward-guided tree search for better complex reasoning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00511","last_updated":"2025-02-13T07:35:08Z","snapshot_observed_at":"2026-08-10T01:19:12.603891Z","submitted_at":"2025-02-01T18:09:49Z","title":"Bridging Internal Probability and Self-Consistency for Effective and Efficient LLM Reasoning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T18:53:44.219142Z"},"links":{"cited_paper":"/paper/2412.15797","citing_paper":"/paper/2502.00511"},"observation_digest":"sha256:c4a2675bfaeaa4fef6619f1abe7f57d7d790314b7e4713f9b5bae553ad5a543e","observation_id":"fd3df95f-703c-4ee3-901a-8ba0f8685769","resolution":{"observed_at":"2026-08-09T18:53:44.219142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15797","last_updated":"2024-12-20T11:14:29Z","snapshot_observed_at":"2026-08-09T23:05:07.508297Z","submitted_at":"2024-12-20T11:14:29Z","title":"Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning","version":1},"cited_work":{"arxiv_id":"2412.15797","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.15797","snapshot_observed_at":"2026-07-03T05:57:41.442502Z","title":"Ensembling large language models with process reward-guided tree search for better complex reasoning.arXiv preprint arXiv:2412.15797","venue":null,"work_id":"e0606a29-b382-4332-ad13-4c791221a0dd","year":2024},"citing_paper":{"arxiv_id":"2502.18036","last_updated":"2026-04-22T02:19:48Z","snapshot_observed_at":"2026-08-02T22:41:05.099083Z","submitted_at":"2025-02-25T09:48:53Z","title":"Harnessing Multiple Large Language Models: A Survey on LLM Ensemble","version":6},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-23T02:22:28.649071Z"},"links":{"cited_paper":"/paper/2412.15797","citing_paper":"/paper/2502.18036"},"observation_digest":"sha256:94427ac0ef1e289462735ec6fd6bdf91db11f75ccbfab7423ee165ba1b3af032","observation_id":"364b56a7-d41d-4973-9c34-1f70ed6a6dc3","resolution":{"observed_at":"2026-05-23T02:25:19.659071Z","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":"2412.15797","last_updated":"2024-12-20T11:14:29Z","snapshot_observed_at":"2026-08-09T23:05:07.508297Z","submitted_at":"2024-12-20T11:14:29Z","title":"Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15797","snapshot_observed_at":"2026-08-07T15:38:48.422552Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14391","last_updated":"2025-05-20T14:12:05Z","snapshot_observed_at":"2026-08-07T18:18:03.761893Z","submitted_at":"2025-05-20T14:12:05Z","title":"Beyond the First Error: Process Reward Models for Reflective Mathematical Reasoning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:38:48.422552Z"},"links":{"cited_paper":"/paper/2412.15797","citing_paper":"/paper/2505.14391"},"observation_digest":"sha256:cd7c9661df7b7b2bec167257e239ae6bff4253949500c10f13703f97330a64af","observation_id":"326fe5bc-3c46-494f-8c9c-400f7d0fc181","resolution":{"observed_at":"2026-08-07T15:38:48.422552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15797","last_updated":"2024-12-20T11:14:29Z","snapshot_observed_at":"2026-08-09T23:05:07.508297Z","submitted_at":"2024-12-20T11:14:29Z","title":"Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15797","snapshot_observed_at":"2026-08-07T12:11:10.351445Z","title":"Ensembling large language mod- els with process reward-guided tree search for better complex reason- ing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00309","last_updated":"2025-06-28T05:54:45Z","snapshot_observed_at":"2026-08-09T10:36:52.271268Z","submitted_at":"2025-05-30T23:37:37Z","title":"Evaluation of LLMs for mathematical problem solving","version":3},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:10.351445Z"},"links":{"cited_paper":"/paper/2412.15797","citing_paper":"/paper/2506.00309"},"observation_digest":"sha256:31cccc43fac4b7ce529c62a29f0d9c089ea54ea21dda275b12a803876507e101","observation_id":"232eaefc-3bc4-4bad-b615-876ba2ba4022","resolution":{"observed_at":"2026-08-07T12:11:10.351445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15797","last_updated":"2024-12-20T11:14:29Z","snapshot_observed_at":"2026-08-09T23:05:07.508297Z","submitted_at":"2024-12-20T11:14:29Z","title":"Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15797","snapshot_observed_at":"2026-08-06T16:32:46.143917Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.13190","last_updated":"2025-07-17T14:59:20Z","snapshot_observed_at":"2026-08-10T13:47:13.446925Z","submitted_at":"2025-07-17T14:59:20Z","title":"GEMMAS: Graph-based Evaluation Metrics for Multi Agent Systems","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T16:32:46.143917Z"},"links":{"cited_paper":"/paper/2412.15797","citing_paper":"/paper/2507.13190"},"observation_digest":"sha256:dbafbc665f887c385e5cd02f30ab7af7b0f9f87f7385b3652625ae2a5f4838fc","observation_id":"e72261ed-8f67-4ffe-93ac-33156ce75bb4","resolution":{"observed_at":"2026-08-06T16:32:46.143917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15797","last_updated":"2024-12-20T11:14:29Z","snapshot_observed_at":"2026-08-09T23:05:07.508297Z","submitted_at":"2024-12-20T11:14:29Z","title":"Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15797","snapshot_observed_at":"2026-08-04T13:15:46.204310Z","title":"Ensembling large language models with process reward-guided tree search for better complex reasoning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.01167","last_updated":"2026-05-30T06:40:26Z","snapshot_observed_at":"2026-08-09T12:10:30.690264Z","submitted_at":"2025-10-01T17:54:15Z","title":"Simultaneous Multi-objective Alignment Across Verifiable and Non-verifiable Rewards","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-04T13:15:46.204310Z"},"links":{"cited_paper":"/paper/2412.15797","citing_paper":"/paper/2510.01167"},"observation_digest":"sha256:175da0a8f369d157bc06e10cdf8a8052ef5d458f343cd37626dbff7c22c51976","observation_id":"96e80361-5fc2-444b-a199-df603dc99626","resolution":{"observed_at":"2026-08-04T13:15:46.204310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15797","last_updated":"2024-12-20T11:14:29Z","snapshot_observed_at":"2026-08-09T23:05:07.508297Z","submitted_at":"2024-12-20T11:14:29Z","title":"Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning","version":1},"cited_work":{"arxiv_id":"2412.15797","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.15797","snapshot_observed_at":"2026-07-03T05:57:41.442502Z","title":"Ensembling large language models with process reward-guided tree search for better complex reasoning.arXiv preprint arXiv:2412.15797","venue":null,"work_id":"e0606a29-b382-4332-ad13-4c791221a0dd","year":2024},"citing_paper":{"arxiv_id":"2510.08592","last_updated":"2026-05-09T15:18:45Z","snapshot_observed_at":"2026-07-06T22:32:13.055128Z","submitted_at":"2025-10-04T20:01:21Z","title":"Less Diverse, Less Safe: The Indirect But Pervasive Risk of Test-Time Scaling in Large Language Models","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-18T09:53:57.765473Z"},"links":{"cited_paper":"/paper/2412.15797","citing_paper":"/paper/2510.08592"},"observation_digest":"sha256:c737f528ccc1f5fa63450877c7ed872d96d0c443210a128ba3f4576e3a429772","observation_id":"5653e0b5-ed2c-489b-b68f-c60db92684e9","resolution":{"observed_at":"2026-05-18T09:56:13.080196Z","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":"2412.15797","last_updated":"2024-12-20T11:14:29Z","snapshot_observed_at":"2026-08-09T23:05:07.508297Z","submitted_at":"2024-12-20T11:14:29Z","title":"Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning","version":1},"cited_work":{"arxiv_id":"2412.15797","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.15797","snapshot_observed_at":"2026-07-03T05:57:41.442502Z","title":"Ensembling large language models with process reward-guided tree search for better complex reasoning.arXiv preprint arXiv:2412.15797","venue":null,"work_id":"e0606a29-b382-4332-ad13-4c791221a0dd","year":2024},"citing_paper":{"arxiv_id":"2512.23213","last_updated":"2026-04-25T15:41:44Z","snapshot_observed_at":"2026-08-02T22:41:07.172721Z","submitted_at":"2025-12-29T05:25:49Z","title":"Scoring, Reasoning, and Selecting the Best! Ensembling Large Language Models via a Peer-Review Process","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-16T19:57:03.999154Z"},"links":{"cited_paper":"/paper/2412.15797","citing_paper":"/paper/2512.23213"},"observation_digest":"sha256:2d1e56138eb7a65823b2b2895f176ad1ac001a13be3fb9e0cce2ccad990db5a1","observation_id":"a30c07b4-60c7-4ddf-bf77-59ca8f5e8d95","resolution":{"observed_at":"2026-05-16T19:58:22.734835Z","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":"2412.15797","last_updated":"2024-12-20T11:14:29Z","snapshot_observed_at":"2026-08-09T23:05:07.508297Z","submitted_at":"2024-12-20T11:14:29Z","title":"Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning","version":1},"cited_work":{"arxiv_id":"2412.15797","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.15797","snapshot_observed_at":"2026-07-03T05:57:41.442502Z","title":"Ensembling large language models with process reward-guided tree search for better complex reasoning.arXiv preprint arXiv:2412.15797","venue":null,"work_id":"e0606a29-b382-4332-ad13-4c791221a0dd","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":187,"source":"arxiv_source","source_observed_at":"2026-06-27T12:59:51.091008Z"},"links":{"cited_paper":"/paper/2412.15797","citing_paper":"/paper/2606.11470"},"observation_digest":"sha256:0ffafd882045e60ece891161b990ec55870215d0d03852a3b7cb62a527c204d2","observation_id":"4eb27ee2-b77a-4992-867f-13ebc755be51","resolution":{"observed_at":"2026-07-03T05:57:41.444027Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2412.15797/citation-record","integrity":"/paper/2412.15797/integrity","json":"/paper/2412.15797/citation-record.json","paper":"/paper/2412.15797"},"outbound":[],"paper":{"arxiv_id":"2412.15797","last_updated":"2024-12-20T11:14:29Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T23:05:07.508297Z","submitted_at":"2024-12-20T11:14:29Z","title":"Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning"},"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 9 inbound Pith citation observations for arXiv:2412.15797."}