{"as_of":"2026-08-08T17:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:41176443db445d686e9c1b67761b114e9d91a73d941f165736cdf73f1b0cdb5d","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-08T06:32:00.761636+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-07T12:05:25.878623Z","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-22T00:54:31.184459Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.11166","last_updated":"2023-03-20T14:51:10Z","snapshot_observed_at":"2026-07-06T15:05:42.338051Z","submitted_at":"2023-03-20T14:51:10Z","title":"Imitating Graph-Based Planning with Goal-Conditioned Policies","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.11166","snapshot_observed_at":"2026-08-07T12:05:25.878623Z","title":"Imitating graph-based planning with goal-conditioned policies","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00795","last_updated":"2025-09-11T03:42:40Z","snapshot_observed_at":"2026-08-07T11:55:27.735310Z","submitted_at":"2025-06-01T02:49:26Z","title":"Closing the Gap between TD Learning and Supervised Learning with $Q$-Conditioned Maximization","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T12:05:25.878623Z"},"links":{"cited_paper":"/paper/2303.11166","citing_paper":"/paper/2506.00795"},"observation_digest":"sha256:4c0b91383fb37f83b0a7d28165c5b2f5d1415378a940365b6365c8758c7a9ac5","observation_id":"7cb756c9-6bfd-4cd5-993b-d1ddc942d258","resolution":{"observed_at":"2026-08-07T12:05:25.878623Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11166","last_updated":"2023-03-20T14:51:10Z","snapshot_observed_at":"2026-07-06T15:05:42.338051Z","submitted_at":"2023-03-20T14:51:10Z","title":"Imitating Graph-Based Planning with Goal-Conditioned Policies","version":1},"cited_work":{"arxiv_id":"2303.11166","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.11166","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Imitating graph-based planning with goal-conditioned policies","venue":null,"work_id":"ddee53e2-2b7e-4e0e-8ae0-7838d0e34acd","year":2023},"citing_paper":{"arxiv_id":"2506.21039","last_updated":"2026-05-20T06:53:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-06-26T06:35:42Z","title":"Strict Subgoal Execution: Reliable Long-Horizon Planning in Hierarchical Reinforcement Learning","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-22T00:53:46.002945Z"},"links":{"cited_paper":"/paper/2303.11166","citing_paper":"/paper/2506.21039"},"observation_digest":"sha256:4dbb0b99c9cef4753146fb83dba9455a11e5ffa5d2009b0c7d2b4254c91bf5e8","observation_id":"89cadaf9-1094-48b5-a6ea-6c359cd4044d","resolution":{"observed_at":"2026-05-22T00:54:31.187464Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2303.11166/citation-record","integrity":"/paper/2303.11166/integrity","json":"/paper/2303.11166/citation-record.json","paper":"/paper/2303.11166"},"outbound":[],"paper":{"arxiv_id":"2303.11166","last_updated":"2023-03-20T14:51:10Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:05:42.338051Z","submitted_at":"2023-03-20T14:51:10Z","title":"Imitating Graph-Based Planning with Goal-Conditioned Policies"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2303.11166."}