{"as_of":"2026-08-09T22:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:09c03db2e3614bee9e2a3737ce4cc36bb9a05cc5fb80baa67314fbee4c3e1e46","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T11:56:41.462659Z","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-02T12:06:55.519808Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.13655","last_updated":"2024-06-19T15:58:35Z","snapshot_observed_at":"2026-08-04T19:28:22.751662Z","submitted_at":"2024-06-19T15:58:35Z","title":"Improving GFlowNets with Monte Carlo Tree Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13655","snapshot_observed_at":"2026-08-08T11:56:41.462659Z","title":"Improving gflownets with monte carlo tree search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.07735","last_updated":"2025-09-11T14:32:19Z","snapshot_observed_at":"2026-08-08T11:42:32.276078Z","submitted_at":"2025-02-11T17:55:03Z","title":"Revisiting Non-Acyclic GFlowNets in Discrete Environments","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T11:56:41.462659Z"},"links":{"cited_paper":"/paper/2406.13655","citing_paper":"/paper/2502.07735"},"observation_digest":"sha256:c85c434f348ce8c7af370df22bc1d0ceb3c04305cd1e3d5fb39372df21d5ab5b","observation_id":"cc677d75-65f4-4862-885f-389f38683a00","resolution":{"observed_at":"2026-08-08T11:56:41.462659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13655","last_updated":"2024-06-19T15:58:35Z","snapshot_observed_at":"2026-08-04T19:28:22.751662Z","submitted_at":"2024-06-19T15:58:35Z","title":"Improving GFlowNets with Monte Carlo Tree Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13655","snapshot_observed_at":"2026-08-06T22:59:48.052578Z","title":"Im- proving gflownets with monte carlo tree search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20701","last_updated":"2025-06-25T17:59:10Z","snapshot_observed_at":"2026-08-07T23:07:43.219360Z","submitted_at":"2025-06-25T17:59:10Z","title":"Diffusion Tree Sampling: Scalable inference-time alignment of diffusion models","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:48.052578Z"},"links":{"cited_paper":"/paper/2406.13655","citing_paper":"/paper/2506.20701"},"observation_digest":"sha256:88c21fb9f412d72e5bac0c197942b9ad73e531a263a0b9d3501f1e980974009a","observation_id":"d91904a8-0678-4e21-804d-f61815387110","resolution":{"observed_at":"2026-08-06T22:59:48.052578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13655","last_updated":"2024-06-19T15:58:35Z","snapshot_observed_at":"2026-08-04T19:28:22.751662Z","submitted_at":"2024-06-19T15:58:35Z","title":"Improving GFlowNets with Monte Carlo Tree Search","version":1},"cited_work":{"arxiv_id":"2406.13655","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.13655","snapshot_observed_at":"2026-07-02T12:06:55.519808Z","title":"arXiv preprint arXiv:2406.13655 , year=","venue":null,"work_id":"639b12d0-144b-4cb0-b25d-98dba35bc66b","year":null},"citing_paper":{"arxiv_id":"2606.06272","last_updated":"2026-06-04T15:14:24Z","snapshot_observed_at":"2026-08-05T16:40:32.420875Z","submitted_at":"2026-06-04T15:14:24Z","title":"Your GFlowNet Secretly Learns an Optimal Transport Plan","version":1},"reference_index":131,"source":"arxiv_source","source_observed_at":"2026-06-28T02:35:08.323804Z"},"links":{"cited_paper":"/paper/2406.13655","citing_paper":"/paper/2606.06272"},"observation_digest":"sha256:cfed44b4de9736953e23320290abdad7eb9821d8707db0c8191d5cdfd6aecbd9","observation_id":"5c544b32-7af4-45cb-9988-2ea0331c36bd","resolution":{"observed_at":"2026-07-02T12:06:55.521390Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2406.13655/citation-record","integrity":"/paper/2406.13655/integrity","json":"/paper/2406.13655/citation-record.json","paper":"/paper/2406.13655"},"outbound":[],"paper":{"arxiv_id":"2406.13655","last_updated":"2024-06-19T15:58:35Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T19:28:22.751662Z","submitted_at":"2024-06-19T15:58:35Z","title":"Improving GFlowNets with Monte Carlo Tree Search"},"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 3 inbound Pith citation observations for arXiv:2406.13655."}