{"as_of":"2026-08-04T10:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8670fe00012a3bb735482d7e03d7f256a06b7da8dc7c8f667fa6517e4cf0f734","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:04:43.684521Z","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-05-15T05:15:03.343243Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.13575","last_updated":"2025-06-11T21:59:20Z","snapshot_observed_at":"2026-07-06T20:39:06.470648Z","submitted_at":"2025-02-19T09:30:38Z","title":"ETS: Efficient Tree Search for Inference-Time Scaling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13575","snapshot_observed_at":"2026-08-03T03:04:43.684521Z","title":"Ets: Efficient tree search for inference-time scaling.arXiv preprint arXiv:2502.13575,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.09305","last_updated":"2026-06-28T18:13:37Z","snapshot_observed_at":"2026-08-03T07:10:48.024369Z","submitted_at":"2026-02-10T00:45:24Z","title":"Reward Modeling for Reinforcement Learning-Based LLM Reasoning: Design, Challenges, and Evaluation","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T03:04:43.684521Z"},"links":{"cited_paper":"/paper/2502.13575","citing_paper":"/paper/2602.09305"},"observation_digest":"sha256:16786321327bdb291b401ff6560c5c18137eabbab9178832a76e86d7811846ed","observation_id":"2dfc0034-17d8-4290-b12c-97cb5aa6258c","resolution":{"observed_at":"2026-08-03T03:04:43.684521Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13575","last_updated":"2025-06-11T21:59:20Z","snapshot_observed_at":"2026-07-06T20:39:06.470648Z","submitted_at":"2025-02-19T09:30:38Z","title":"ETS: Efficient Tree Search for Inference-Time Scaling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13575","snapshot_observed_at":"2026-07-13T23:28:12.790404Z","title":"Ets: Efficient tree search for inference- time scaling","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.16867","last_updated":"2026-06-03T09:37:20Z","snapshot_observed_at":"2026-08-02T12:55:23.015782Z","submitted_at":"2026-03-17T17:59:51Z","title":"Efficient Reasoning on the Edge","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-07-13T23:28:12.790404Z"},"links":{"cited_paper":"/paper/2502.13575","citing_paper":"/paper/2603.16867"},"observation_digest":"sha256:c87e666adea1dfc4eb752c4f7a85a35105e970d2e1795939d5013c953842aed2","observation_id":"fd1d5b12-f903-4037-9b86-3ab0bb2e3fe5","resolution":{"observed_at":"2026-07-13T23:28:12.790404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13575","last_updated":"2025-06-11T21:59:20Z","snapshot_observed_at":"2026-07-06T20:39:06.470648Z","submitted_at":"2025-02-19T09:30:38Z","title":"ETS: Efficient Tree Search for Inference-Time Scaling","version":2},"cited_work":{"arxiv_id":"2502.13575","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13575","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ets: Efficient tree search for inference- time scaling","venue":null,"work_id":"800cbfe0-945b-4169-b70e-c190f5353728","year":2025},"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":23,"source":"pdf_text","source_observed_at":"2026-05-12T03:51:52.375703Z"},"links":{"cited_paper":"/paper/2502.13575","citing_paper":"/paper/2605.10195"},"observation_digest":"sha256:abd5000f3ced12746c29e2b9e246bb2ebbe581ed3704a8632783a29dd6d4cf40","observation_id":"0d8e684c-94f3-4c65-ab8a-75521285b9d1","resolution":{"observed_at":"2026-05-12T06:51:30.185643Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13575","last_updated":"2025-06-11T21:59:20Z","snapshot_observed_at":"2026-07-06T20:39:06.470648Z","submitted_at":"2025-02-19T09:30:38Z","title":"ETS: Efficient Tree Search for Inference-Time Scaling","version":2},"cited_work":{"arxiv_id":"2502.13575","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13575","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ets: Efficient tree search for inference- time scaling","venue":null,"work_id":"800cbfe0-945b-4169-b70e-c190f5353728","year":2025},"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":23,"source":"pdf_text","source_observed_at":"2026-05-15T05:11:32.053440Z"},"links":{"cited_paper":"/paper/2502.13575","citing_paper":"/paper/2605.10195"},"observation_digest":"sha256:a383fcdb74fb3df4443c2f9333c037ef32f63221938ec5e7930a77084d0cd17e","observation_id":"00b825eb-b736-459c-8181-7a55bef78560","resolution":{"observed_at":"2026-05-15T05:15:03.346410Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13575","last_updated":"2025-06-11T21:59:20Z","snapshot_observed_at":"2026-07-06T20:39:06.470648Z","submitted_at":"2025-02-19T09:30:38Z","title":"ETS: Efficient Tree Search for Inference-Time Scaling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13575","snapshot_observed_at":"2026-08-01T01:25:06.222272Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27788","last_updated":"2026-07-30T07:21:55Z","snapshot_observed_at":"2026-08-02T23:42:38.623888Z","submitted_at":"2026-07-30T07:21:55Z","title":"SpecCal: Ambiguity-Aware Candidate Calibration for Infrared Spectrum-Based Molecular Structure Reconstruction","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T01:25:06.222272Z"},"links":{"cited_paper":"/paper/2502.13575","citing_paper":"/paper/2607.27788"},"observation_digest":"sha256:7d9972fa7d0fea13a0aba753a94b93bb45f8090ca000eba603e63bbc5ddbc879","observation_id":"cbdb12f4-c36c-4926-a251-3b29cd73d00b","resolution":{"observed_at":"2026-08-01T01:25:06.222272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.13575/citation-record","integrity":"/paper/2502.13575/integrity","json":"/paper/2502.13575/citation-record.json","paper":"/paper/2502.13575"},"outbound":[],"paper":{"arxiv_id":"2502.13575","last_updated":"2025-06-11T21:59:20Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:39:06.470648Z","submitted_at":"2025-02-19T09:30:38Z","title":"ETS: Efficient Tree Search for Inference-Time Scaling"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2502.13575."}