{"as_of":"2026-08-09T19:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b414f73af7e03f62c6a6ca67bbfefd494249b52e5fe603191bebba5e1d5f54bc","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T11:56:41.384176Z","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.527636Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.02213","last_updated":"2025-06-02T11:26:49Z","snapshot_observed_at":"2026-07-06T18:25:05.750197Z","submitted_at":"2024-06-04T11:11:53Z","title":"Random Policy Evaluation Uncovers Policies of Generative Flow Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02213","snapshot_observed_at":"2026-08-08T11:56:41.384176Z","title":"Random policy evaluation uncovers policies of generative flow networks","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":14,"source":"arxiv_source","source_observed_at":"2026-08-08T11:56:41.384176Z"},"links":{"cited_paper":"/paper/2406.02213","citing_paper":"/paper/2502.07735"},"observation_digest":"sha256:3482ab3bdf1ff15e7813d32ab4ce6623fd008b609c62dc374079faa9ec9c0c1d","observation_id":"4c47c1c7-7750-4377-9779-1e5685b7edb7","resolution":{"observed_at":"2026-08-08T11:56:41.384176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02213","last_updated":"2025-06-02T11:26:49Z","snapshot_observed_at":"2026-07-06T18:25:05.750197Z","submitted_at":"2024-06-04T11:11:53Z","title":"Random Policy Evaluation Uncovers Policies of Generative Flow Networks","version":3},"cited_work":{"arxiv_id":"2406.02213","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.02213","snapshot_observed_at":"2026-07-02T12:06:55.527636Z","title":"arXiv preprint arXiv:2406.02213 , year=","venue":null,"work_id":"788c6933-a1d9-40bb-8e99-471ea9a13501","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":128,"source":"arxiv_source","source_observed_at":"2026-06-28T02:35:08.323804Z"},"links":{"cited_paper":"/paper/2406.02213","citing_paper":"/paper/2606.06272"},"observation_digest":"sha256:1426011f6de38ff60e435dc141e1b8eff84e9878b697b1e05a86634bbe56e2b6","observation_id":"3f67fad7-add5-4c0c-a8ad-fd4f8d237de1","resolution":{"observed_at":"2026-07-02T12:06:55.529074Z","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.02213/citation-record","integrity":"/paper/2406.02213/integrity","json":"/paper/2406.02213/citation-record.json","paper":"/paper/2406.02213"},"outbound":[],"paper":{"arxiv_id":"2406.02213","last_updated":"2025-06-02T11:26:49Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:25:05.750197Z","submitted_at":"2024-06-04T11:11:53Z","title":"Random Policy Evaluation Uncovers Policies of Generative Flow Networks"},"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 2 inbound Pith citation observations for arXiv:2406.02213."}