{"as_of":"2026-08-09T22:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4c28ec6ed822539cb3a68985c219f097008e27a977536d1d044b80da0db3096e","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:27:39.037172Z","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-03T04:17:37.363909Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.11476","last_updated":"2025-07-21T07:06:53Z","snapshot_observed_at":"2026-08-07T18:13:36.278405Z","submitted_at":"2025-02-17T06:27:57Z","title":"FastMCTS: A Simple Sampling Strategy for Data Synthesis","version":2},"cited_work":{"arxiv_id":"2502.11476","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.11476","snapshot_observed_at":"2026-07-03T04:17:37.363909Z","title":"Fastmcts: A simple sampling strategy for data synthesis","venue":null,"work_id":"858f3251-b203-49c4-8b6f-75bdfdb65a1f","year":2025},"citing_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-07T04:27:23.738927Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-05-14T01:29:56.480020Z"},"links":{"cited_paper":"/paper/2502.11476","citing_paper":"/paper/2503.16419"},"observation_digest":"sha256:190789df3c0070dbe8af80405ffc9edc7717d5e26cec7e04cea15319c842dbae","observation_id":"481bcb0d-806e-4366-a4a8-547e50726184","resolution":{"observed_at":"2026-05-14T01:29:57.064543Z","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":"2502.11476","last_updated":"2025-07-21T07:06:53Z","snapshot_observed_at":"2026-08-07T18:13:36.278405Z","submitted_at":"2025-02-17T06:27:57Z","title":"FastMCTS: A Simple Sampling Strategy for Data Synthesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11476","snapshot_observed_at":"2026-08-07T14:27:39.037172Z","title":"doi: 10.18653/v1/2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.18962","last_updated":"2025-05-31T15:08:41Z","snapshot_observed_at":"2026-08-09T13:11:14.871776Z","submitted_at":"2025-05-25T03:35:49Z","title":"System-1.5 Reasoning: Traversal in Language and Latent Spaces with Dynamic Shortcuts","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:39.037172Z"},"links":{"cited_paper":"/paper/2502.11476","citing_paper":"/paper/2505.18962"},"observation_digest":"sha256:84d3f530eb48e3aadd44001a12ad851348600a6292ec9856fbf849ea2a7fae89","observation_id":"62f8d6db-6fe2-40e3-9deb-8086f15748cc","resolution":{"observed_at":"2026-08-07T14:27:39.037172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11476","last_updated":"2025-07-21T07:06:53Z","snapshot_observed_at":"2026-08-07T18:13:36.278405Z","submitted_at":"2025-02-17T06:27:57Z","title":"FastMCTS: A Simple Sampling Strategy for Data Synthesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11476","snapshot_observed_at":"2026-08-06T20:43:09.074721Z","title":"Fastmcts: A simple sampling strategy for data synthesis.arXiv preprint arXiv:2502.11476, 2025a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.02076","last_updated":"2025-07-02T18:27:42Z","snapshot_observed_at":"2026-08-08T01:09:25.758170Z","submitted_at":"2025-07-02T18:27:42Z","title":"Reasoning on a Budget: A Survey of Adaptive and Controllable Test-Time Compute in LLMs","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T20:43:09.074721Z"},"links":{"cited_paper":"/paper/2502.11476","citing_paper":"/paper/2507.02076"},"observation_digest":"sha256:5bea2cd0f96f9020ff84999686f7dca54428fe9a46392165f56554c9f1b3229c","observation_id":"712c1d75-968f-4bef-8ca5-3a0ee74d6cfa","resolution":{"observed_at":"2026-08-06T20:43:09.074721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11476","last_updated":"2025-07-21T07:06:53Z","snapshot_observed_at":"2026-08-07T18:13:36.278405Z","submitted_at":"2025-02-17T06:27:57Z","title":"FastMCTS: A Simple Sampling Strategy for Data Synthesis","version":2},"cited_work":{"arxiv_id":"2502.11476","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.11476","snapshot_observed_at":"2026-07-03T04:17:37.363909Z","title":"Fastmcts: A simple sampling strategy for data synthesis","venue":null,"work_id":"858f3251-b203-49c4-8b6f-75bdfdb65a1f","year":2025},"citing_paper":{"arxiv_id":"2508.08636","last_updated":"2026-05-20T08:06:05Z","snapshot_observed_at":"2026-08-04T03:35:42.053775Z","submitted_at":"2025-08-12T05:00:00Z","title":"InternBootcamp Technical Report: Boosting LLM Reasoning with Verifiable Task Scaling","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-21T22:33:09.674822Z"},"links":{"cited_paper":"/paper/2502.11476","citing_paper":"/paper/2508.08636"},"observation_digest":"sha256:d8fc3366d91d7cdc1c4db05a5bd620ef9860c55a4065f782d519bdbc50ec246b","observation_id":"381cf0ea-397c-4750-846f-0949d209de3b","resolution":{"observed_at":"2026-05-21T22:34:24.021179Z","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":"2502.11476","last_updated":"2025-07-21T07:06:53Z","snapshot_observed_at":"2026-08-07T18:13:36.278405Z","submitted_at":"2025-02-17T06:27:57Z","title":"FastMCTS: A Simple Sampling Strategy for Data Synthesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11476","snapshot_observed_at":"2026-08-05T00:06:08.463389Z","title":"Fastmcts: A simple sampling strategy for data synthesis.arXiv preprint arXiv:2502.11476, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.06160","last_updated":"2025-09-07T18:07:58Z","snapshot_observed_at":"2026-08-08T05:58:57.881178Z","submitted_at":"2025-09-07T18:07:58Z","title":"Reverse-Engineered Reasoning for Open-Ended Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T00:06:08.463389Z"},"links":{"cited_paper":"/paper/2502.11476","citing_paper":"/paper/2509.06160"},"observation_digest":"sha256:fabd398debf8d2fb7a7c5cd626186169a2b295126bdf90d2f92bdd5706b9a1c3","observation_id":"11d49861-9f76-4973-aa0e-249a485f28f1","resolution":{"observed_at":"2026-08-05T00:06:08.463389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11476","last_updated":"2025-07-21T07:06:53Z","snapshot_observed_at":"2026-08-07T18:13:36.278405Z","submitted_at":"2025-02-17T06:27:57Z","title":"FastMCTS: A Simple Sampling Strategy for Data Synthesis","version":2},"cited_work":{"arxiv_id":"2502.11476","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.11476","snapshot_observed_at":"2026-07-03T04:17:37.363909Z","title":"Fastmcts: A simple sampling strategy for data synthesis","venue":null,"work_id":"858f3251-b203-49c4-8b6f-75bdfdb65a1f","year":2025},"citing_paper":{"arxiv_id":"2605.06165","last_updated":"2026-05-07T12:51:49Z","snapshot_observed_at":"2026-07-06T23:18:41.400741Z","submitted_at":"2026-05-07T12:51:49Z","title":"Post Reasoning: Improving the Performance of Non-Thinking Models at No Cost","version":1},"reference_index":134,"source":"arxiv_source","source_observed_at":"2026-05-08T10:19:08.451445Z"},"links":{"cited_paper":"/paper/2502.11476","citing_paper":"/paper/2605.06165"},"observation_digest":"sha256:0b8cec53f8fd87840e2bee0620503dbb152208afcbc7786a724a4340c9093d78","observation_id":"3fcbca7f-a61f-482a-a821-dc01265a62af","resolution":{"observed_at":"2026-05-11T20:06:10.031501Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11476","last_updated":"2025-07-21T07:06:53Z","snapshot_observed_at":"2026-08-07T18:13:36.278405Z","submitted_at":"2025-02-17T06:27:57Z","title":"FastMCTS: A Simple Sampling Strategy for Data Synthesis","version":2},"cited_work":{"arxiv_id":"2502.11476","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.11476","snapshot_observed_at":"2026-07-03T04:17:37.363909Z","title":"Fastmcts: A simple sampling strategy for data synthesis","venue":null,"work_id":"858f3251-b203-49c4-8b6f-75bdfdb65a1f","year":2025},"citing_paper":{"arxiv_id":"2606.10768","last_updated":"2026-06-09T12:21:27Z","snapshot_observed_at":"2026-08-08T12:03:53.959178Z","submitted_at":"2026-06-09T12:21:27Z","title":"N-GRPO: Embedding-Level Neighbor Mixing for Enhanced Policy Optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-27T14:02:05.833651Z"},"links":{"cited_paper":"/paper/2502.11476","citing_paper":"/paper/2606.10768"},"observation_digest":"sha256:1a43148e9a7e833fb2b1c3ba2df42dcb1efb86c8ac9ad45c50dc25395fc9a181","observation_id":"c9a19b62-4bbf-47c7-8c3b-3e279899156b","resolution":{"observed_at":"2026-07-03T04:17:37.365557Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.11476/citation-record","integrity":"/paper/2502.11476/integrity","json":"/paper/2502.11476/citation-record.json","paper":"/paper/2502.11476"},"outbound":[],"paper":{"arxiv_id":"2502.11476","last_updated":"2025-07-21T07:06:53Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T18:13:36.278405Z","submitted_at":"2025-02-17T06:27:57Z","title":"FastMCTS: A Simple Sampling Strategy for Data Synthesis"},"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 7 inbound Pith citation observations for arXiv:2502.11476."}