{"as_of":"2026-08-17T14:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e85e42f7e40ddde4225aef5bcff2359fa802163621d757f611ecf1196ebaca5","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:06:02.936523Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.16312/citation-record","integrity":"/paper/2505.16312/integrity","json":"/paper/2505.16312/citation-record.json","paper":"/paper/2505.16312"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.05150","last_updated":"2020-12-02T17:52:35Z","snapshot_observed_at":"2026-07-31T17:17:17.205582Z","submitted_at":"2020-04-10T17:54:09Z","title":"Longformer: The Long-Document Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.05150","snapshot_observed_at":"2026-08-07T15:06:00.169798Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.169798Z"},"links":{"cited_paper":"/paper/2004.05150","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:cf7a790f9601f9bb056acdcaed18d94536844a69d653e4150065ae4b51054813","observation_id":"4bac04f4-d9c1-4053-9793-980030cea6ba","resolution":{"observed_at":"2026-08-07T15:06:00.169798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:00.231000Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.231000Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:9671879f7d24e2ea67df32e783f87f177163dc4754693a0c6dc0a776661c64d0","observation_id":"8b1ea5f5-931f-4c33-8e36-00020a2ef9fb","resolution":{"observed_at":"2026-08-07T15:06:00.231000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:00.344797Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.344797Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:03a2724909de6183c72d8b25667f724da2ecb9b346afcb09390b54e437eac9b3","observation_id":"03cdf8a6-895d-4289-9e3b-29b1c21bc425","resolution":{"observed_at":"2026-08-07T15:06:00.344797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:04.336167Z","title":null,"venue":null,"work_id":"d66e3ff3-709e-42dd-8fd9-168caf77a18b","year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.432636Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:bea60b24cf52b8ee85f57840bd8944aab72792bf2d94bd2112bcbfd30b6d5076","observation_id":"afd58930-0df5-4c69-a9df-a45b9e564ef3","resolution":{"observed_at":"2026-08-07T15:06:04.382075Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-07T15:06:00.494598Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.494598Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:854f3e32f1a58f6153c311f9630a75cd26527bc5f106ce3d232460fb79dcd0a7","observation_id":"333fd56c-bb05-4c28-993e-e84e8bef6717","resolution":{"observed_at":"2026-08-07T15:06:00.494598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:04.217033Z","title":null,"venue":null,"work_id":"bb3baadb-7aa8-4721-b211-e49bdbbc9e88","year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.556853Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:bab17c30c2befe9fcdffe06ea701b2660cc44c737f5bb6565890cf334d1856c6","observation_id":"28d4f400-0542-45d9-87b6-76f53bd6d694","resolution":{"observed_at":"2026-08-07T15:06:04.278292Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04707","last_updated":"2024-10-07T02:52:30Z","snapshot_observed_at":"2026-08-16T13:12:04.336691Z","submitted_at":"2024-10-07T02:52:30Z","title":"Learning How Hard to Think: Input-Adaptive Allocation of LM Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.04707","snapshot_observed_at":"2026-08-07T15:06:00.664496Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.664496Z"},"links":{"cited_paper":"/paper/2410.04707","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:5231a94816660ee9dd30bde1a700cd7f9b20b1602ab4d408119e2271cebda9a0","observation_id":"15aea0aa-d327-40a5-b8ae-0cf900157896","resolution":{"observed_at":"2026-08-07T15:06:00.664496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03874","last_updated":"2021-11-08T21:30:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-03-05T18:59:39Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03874","snapshot_observed_at":"2026-08-07T15:06:00.737147Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.737147Z"},"links":{"cited_paper":"/paper/2103.03874","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:8c5df3ffe2ab31c35763ac28ac9c38007c2442fb5719425b3deda57024319a98","observation_id":"f3b25275-f55d-4610-bd71-fc2f1a01acd3","resolution":{"observed_at":"2026-08-07T15:06:00.737147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21276","last_updated":"2024-10-25T17:43:01Z","snapshot_observed_at":"2026-08-15T14:02:47.366139Z","submitted_at":"2024-10-25T17:43:01Z","title":"GPT-4o System Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21276","snapshot_observed_at":"2026-08-07T15:06:00.790593Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.790593Z"},"links":{"cited_paper":"/paper/2410.21276","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:e02968fe29ccb1d7051bd08733520b4d60f3c3a35496e8bb655b813b275a343f","observation_id":"165693ec-2d06-46e1-bf07-24e2b7dc0b05","resolution":{"observed_at":"2026-08-07T15:06:00.790593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-08-13T10:27:01.324745Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-07T15:06:00.892822Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.892822Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:c1fc19c115f234bc367bd24c4779db6bfb145056495e160f914afbbcc055d134","observation_id":"a80ca779-edbd-4c3a-80ff-78034a3c8734","resolution":{"observed_at":"2026-08-07T15:06:00.892822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16265","last_updated":"2024-06-26T14:01:15Z","snapshot_observed_at":"2026-08-16T13:49:27.658035Z","submitted_at":"2024-05-25T15:07:33Z","title":"MindStar: Enhancing Math Reasoning in Pre-trained LLMs at Inference Time","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16265","snapshot_observed_at":"2026-08-07T15:06:00.966760Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.966760Z"},"links":{"cited_paper":"/paper/2405.16265","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:d34db01ea9716cc70ae803acff42e667ffb7c5a63f00e6fd13c682de7bb4de24","observation_id":"fb87154d-ccb3-4aa8-8dda-36f691e3ac8e","resolution":{"observed_at":"2026-08-07T15:06:00.966760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:01.046649Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.046649Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:c931491988bd34fd6da2c92daff3128108e9b49fd790d27a72e687bfb7345334","observation_id":"3fa21872-8e9b-4f01-9e01-259bb8e85781","resolution":{"observed_at":"2026-08-07T15:06:01.046649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:01.098298Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.098298Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:9026b63b8542532164432e3401cef8098df29ced2b3fa9ab606c46a620a47ca8","observation_id":"e080776d-63db-4626-9ca2-d9ae7f50e2ac","resolution":{"observed_at":"2026-08-07T15:06:01.098298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.08291","last_updated":"2023-05-15T01:18:23Z","snapshot_observed_at":"2026-08-16T15:33:12.206226Z","submitted_at":"2023-05-15T01:18:23Z","title":"Large Language Model Guided Tree-of-Thought","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.08291","snapshot_observed_at":"2026-08-07T15:06:01.149295Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.149295Z"},"links":{"cited_paper":"/paper/2305.08291","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:e8c82d0d28b8bcc3200930b6ebcc03f4eb04e5dae919280e133ce276794f4220","observation_id":"8e5022e6-83a3-4d63-be2b-680207c6a4d2","resolution":{"observed_at":"2026-08-07T15:06:01.149295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06592","last_updated":"2024-12-11T22:59:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-06-05T19:25:40Z","title":"Improve Mathematical Reasoning in Language Models by Automated Process Supervision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06592","snapshot_observed_at":"2026-08-07T15:06:01.199202Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.199202Z"},"links":{"cited_paper":"/paper/2406.06592","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:7f6d95ec1358cc4152b9575d04e0f7df1ba6f344cf203645c9d33f0438a1d74c","observation_id":"170e5667-1e97-4f83-ae01-9e166356dde0","resolution":{"observed_at":"2026-08-07T15:06:01.199202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:04.055840Z","title":null,"venue":null,"work_id":"0312b784-a6db-4aa3-8ef3-3718a836bd60","year":2016},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.246237Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:13258476acb727fd8b2acba944dd6db47cf9c96f4b8633a56ab0655df2c4bf46","observation_id":"b976abed-df55-44ce-98a8-8e73efa259a1","resolution":{"observed_at":"2026-08-07T15:06:04.097565Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.00377","last_updated":"2021-05-02T02:10:31Z","snapshot_observed_at":"2026-08-16T18:27:37.670568Z","submitted_at":"2021-05-02T02:10:31Z","title":"MathBERT: A Pre-Trained Model for Mathematical Formula Understanding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.00377","snapshot_observed_at":"2026-08-07T15:06:01.290862Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.290862Z"},"links":{"cited_paper":"/paper/2105.00377","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:5f705890bf7f47db563b31dcf1c6f7c1c50821b13e45965439df9bc424cb4c44","observation_id":"b149c76d-8f40-4a21-b935-a60d1a12a47d","resolution":{"observed_at":"2026-08-07T15:06:01.290862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:01.330051Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.330051Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:8e22ce4b068c6b5eebf55b47c9ccb5ba71be4adaf94b3f850d5be5346b736832","observation_id":"51ef124e-1669-4ed4-a6c5-6596c68b28b8","resolution":{"observed_at":"2026-08-07T15:06:01.330051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-07T15:06:01.395899Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.395899Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:928c557ee2161bd771ab9a5e90a6412ad607b1cc1c196fce1248dc8cc1123c2c","observation_id":"1b4b7feb-7bd1-49ac-98af-c6652b3f5eae","resolution":{"observed_at":"2026-08-07T15:06:01.395899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-07T15:06:01.506314Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.506314Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:ebc7dd9c4caa7ea550e7e9309074250e0514f6e9bf7310e7a6d399375b938eb7","observation_id":"ec1658da-06df-4ea4-9cda-22c6194fe792","resolution":{"observed_at":"2026-08-07T15:06:01.506314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:03.916868Z","title":null,"venue":null,"work_id":"d06739ad-0ea4-49bb-89ab-59d6f33de8e3","year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.611699Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:4096516029830d11cbc5313493e2a0f33be45d9449785019999c28a77fcfcef6","observation_id":"fdf1c9a9-d35c-4ccf-94c9-46dd440cadb5","resolution":{"observed_at":"2026-08-07T15:06:03.961909Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:01.724372Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.724372Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:7dcda6f4a2bdea2faf18eb08f3fe882a23976bca0a91d289dbe78e3ed4f610b5","observation_id":"d4a1cbce-f089-480a-967e-0e9a36b4ea16","resolution":{"observed_at":"2026-08-07T15:06:01.724372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.00451","last_updated":"2024-06-17T22:11:49Z","snapshot_observed_at":"2026-08-16T13:56:19.546679Z","submitted_at":"2024-05-01T11:10:24Z","title":"Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.00451","snapshot_observed_at":"2026-08-07T15:06:01.832895Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.832895Z"},"links":{"cited_paper":"/paper/2405.00451","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:6683e62a8398c27cfa500a257e74562e92f3f006b12c91ea32953c0b11614c7c","observation_id":"3996829b-ccc4-498e-994f-8efd91710467","resolution":{"observed_at":"2026-08-07T15:06:01.832895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-07T15:06:01.922439Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:01.922439Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:aafddd79a180018db227e1802dcc030950025f69d86bc1cf1626c20d0881b458","observation_id":"05a49a99-8b54-407f-94ce-a9c86e9a26d3","resolution":{"observed_at":"2026-08-07T15:06:01.922439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:02.037227Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:02.037227Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:785ad56e367f6d007cb002130f23ce529624c22ed24cf1bd177452da20de3232","observation_id":"55751ffd-c5cb-48a6-a87c-e63ba47c68b9","resolution":{"observed_at":"2026-08-07T15:06:02.037227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:03.754002Z","title":null,"venue":null,"work_id":"561be838-5810-47ea-b414-5a2286c090a5","year":2007},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:02.195248Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:800245f2460d6f41fd34f5a03f81e60154fd64cf819ae6d9679a4e13a0c6b2b9","observation_id":"52423769-dd6f-49b7-ab8d-a796611ab521","resolution":{"observed_at":"2026-08-07T15:06:03.818010Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:03.613761Z","title":null,"venue":null,"work_id":"58f10c50-75d6-4391-a5d8-d678ce9f67f7","year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:02.372630Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:3756ae7e225ab9408e3cbefb1802f6a408bb7b6f6074cb4cbd1ad18370e85898","observation_id":"f0f688d7-5396-4423-a1cc-23aab8e7eb62","resolution":{"observed_at":"2026-08-07T15:06:03.683452Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02884","last_updated":"2024-11-21T07:07:59Z","snapshot_observed_at":"2026-08-16T13:12:50.131108Z","submitted_at":"2024-10-03T18:12:29Z","title":"LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02884","snapshot_observed_at":"2026-08-07T15:06:02.552762Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:02.552762Z"},"links":{"cited_paper":"/paper/2410.02884","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:fb20d62a258bed297a794fcaae75960debe42f6f4340579d511980f20349f820","observation_id":"3dc80ecb-14b2-40a2-a3be-0fd6924aef7c","resolution":{"observed_at":"2026-08-07T15:06:02.552762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:03.458599Z","title":null,"venue":null,"work_id":"6abab77d-0fe7-4428-be33-1ddf676aacb6","year":2023},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:02.694169Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:e9d0048efd427c65bfc7f56737e874bce436349792506aea56921834d3f36e97","observation_id":"be3ee6e6-ff67-4855-8833-8eb528b9351b","resolution":{"observed_at":"2026-08-07T15:06:03.532587Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:02.824737Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:02.824737Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:eac5e12989db54d537198d96bb2bed2e1fcff7a5ae6d9de532d80cc1106fad5b","observation_id":"48df969a-e970-42ac-ae90-0225b8bd5200","resolution":{"observed_at":"2026-08-07T15:06:02.824737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:06:02.936523Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:02.936523Z"},"links":{"citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:a8ae60dc7e688fb4eb81c1f7d82cb135fc9e06b706cd3f9133defe4ca2e783b2","observation_id":"c8211d67-eb79-469b-a077-f15760781aa4","resolution":{"observed_at":"2026-08-07T15:06:02.936523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-13T16:41:49.447843Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":31},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2505.16312."}