{"as_of":"2026-08-08T02:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1196d0a8f4b5a5afb48ed2622207f3075dba6cdc59506bb7c3d9271db42f2596","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:05:25.785189Z","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-25T05:00:21.586357Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.08909","last_updated":"2021-04-19T18:33:47Z","snapshot_observed_at":"2026-07-06T10:15:31.432847Z","submitted_at":"2020-11-17T19:58:56Z","title":"C-Learning: Learning to Achieve Goals via Recursive Classification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.08909","snapshot_observed_at":"2026-08-07T12:05:25.785189Z","title":"C-learning: Learning to achieve goals via recursive classification","venue":null,"work_id":null,"year":2011},"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":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:05:25.785189Z"},"links":{"cited_paper":"/paper/2011.08909","citing_paper":"/paper/2506.00795"},"observation_digest":"sha256:3e5564a2e56618b7ed0940c7f5959e4affa0ad408fa7fdc7e2fca21c2fdcaf55","observation_id":"bbad15d8-706f-4444-9661-dcec1aa5946d","resolution":{"observed_at":"2026-08-07T12:05:25.785189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.08909","last_updated":"2021-04-19T18:33:47Z","snapshot_observed_at":"2026-07-06T10:15:31.432847Z","submitted_at":"2020-11-17T19:58:56Z","title":"C-Learning: Learning to Achieve Goals via Recursive Classification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.08909","snapshot_observed_at":"2026-08-07T11:24:59.107111Z","title":"C-learning: Learning to achieve goals via recursive classification.arXiv preprint arXiv:2011.08909,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.02577","last_updated":"2025-06-03T07:55:57Z","snapshot_observed_at":"2026-08-07T13:50:57.173766Z","submitted_at":"2025-06-03T07:55:57Z","title":"Reachability Weighted Offline Goal-conditioned Resampling","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-07T11:24:59.107111Z"},"links":{"cited_paper":"/paper/2011.08909","citing_paper":"/paper/2506.02577"},"observation_digest":"sha256:855df6a12c72adf0be96a88506e3fefe807ea9cefb79481e497abdf6269a007d","observation_id":"bd193dd9-e705-4492-b848-f8bb6d6216f2","resolution":{"observed_at":"2026-08-07T11:24:59.107111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.08909","last_updated":"2021-04-19T18:33:47Z","snapshot_observed_at":"2026-07-06T10:15:31.432847Z","submitted_at":"2020-11-17T19:58:56Z","title":"C-Learning: Learning to Achieve Goals via Recursive Classification","version":2},"cited_work":{"arxiv_id":"2011.08909","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.08909","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2011.08909 , year=","venue":null,"work_id":"90cf7c98-c699-4a9a-ae4a-862e17a18ba7","year":2011},"citing_paper":{"arxiv_id":"2506.08902","last_updated":"2026-05-11T20:21:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-06-10T15:27:46Z","title":"Intention-Conditioned Flow Occupancy Models","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-19T10:24:52.160209Z"},"links":{"cited_paper":"/paper/2011.08909","citing_paper":"/paper/2506.08902"},"observation_digest":"sha256:5632ea7c06329ee9ba5ce31fbb0a3fe2ba43cc1fac6eeb206f93911ca34118af","observation_id":"339dd619-0061-4f9f-91e8-6787088718c0","resolution":{"observed_at":"2026-05-19T10:27:14.523004Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.08909","last_updated":"2021-04-19T18:33:47Z","snapshot_observed_at":"2026-07-06T10:15:31.432847Z","submitted_at":"2020-11-17T19:58:56Z","title":"C-Learning: Learning to Achieve Goals via Recursive Classification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.08909","snapshot_observed_at":"2026-08-06T22:41:34.332286Z","title":"C-learning: Learning to achieve goals via recursive classification","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.21044","last_updated":"2025-06-26T06:45:59Z","snapshot_observed_at":"2026-08-06T22:32:27.284523Z","submitted_at":"2025-06-26T06:45:59Z","title":"Efficient Skill Discovery via Regret-Aware Optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T22:41:34.332286Z"},"links":{"cited_paper":"/paper/2011.08909","citing_paper":"/paper/2506.21044"},"observation_digest":"sha256:743f80b03d8207eaf868fc66cc96dc7abb1b71fd5875ec2ac16e85fc72011071","observation_id":"143187d5-3f4d-4258-9ef2-695f91139aa3","resolution":{"observed_at":"2026-08-06T22:41:34.332286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.08909","last_updated":"2021-04-19T18:33:47Z","snapshot_observed_at":"2026-07-06T10:15:31.432847Z","submitted_at":"2020-11-17T19:58:56Z","title":"C-Learning: Learning to Achieve Goals via Recursive Classification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.08909","snapshot_observed_at":"2026-08-06T15:26:24.548727Z","title":"Eysenbach, R","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.16139","last_updated":"2025-07-22T01:13:45Z","snapshot_observed_at":"2026-08-06T18:14:52.248033Z","submitted_at":"2025-07-22T01:13:45Z","title":"Equivariant Goal Conditioned Contrastive Reinforcement Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T15:26:24.548727Z"},"links":{"cited_paper":"/paper/2011.08909","citing_paper":"/paper/2507.16139"},"observation_digest":"sha256:92422ccdbd22af83779b44c62465117b8f6175326a9c659d97f645d1f5f117ee","observation_id":"ef2efce0-091c-4477-86b0-e7611fc75cc7","resolution":{"observed_at":"2026-08-06T15:26:24.548727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.08909","last_updated":"2021-04-19T18:33:47Z","snapshot_observed_at":"2026-07-06T10:15:31.432847Z","submitted_at":"2020-11-17T19:58:56Z","title":"C-Learning: Learning to Achieve Goals via Recursive Classification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.08909","snapshot_observed_at":"2026-08-05T23:01:48.924790Z","title":"Eysenbach, B.; Salakhutdinov, R.; and Levine, S","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.06108","last_updated":"2025-08-08T08:12:14Z","snapshot_observed_at":"2026-08-06T12:47:54.663245Z","submitted_at":"2025-08-08T08:12:14Z","title":"GCHR : Goal-Conditioned Hindsight Regularization for Sample-Efficient Reinforcement Learning","version":1},"reference_index":1440,"source":"pdf_text","source_observed_at":"2026-08-05T23:01:48.924790Z"},"links":{"cited_paper":"/paper/2011.08909","citing_paper":"/paper/2508.06108"},"observation_digest":"sha256:1eb0f18d61941e1cb481e8f65625af18999ea5df3b8cb31135491af363d51aaa","observation_id":"af3ab3c5-8365-410c-be41-b8e59a22cd42","resolution":{"observed_at":"2026-08-05T23:01:48.924790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.08909","last_updated":"2021-04-19T18:33:47Z","snapshot_observed_at":"2026-07-06T10:15:31.432847Z","submitted_at":"2020-11-17T19:58:56Z","title":"C-Learning: Learning to Achieve Goals via Recursive Classification","version":2},"cited_work":{"arxiv_id":"2011.08909","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.08909","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2011.08909 , year=","venue":null,"work_id":"90cf7c98-c699-4a9a-ae4a-862e17a18ba7","year":2011},"citing_paper":{"arxiv_id":"2605.01862","last_updated":"2026-05-08T03:23:44Z","snapshot_observed_at":"2026-07-06T23:15:01.968194Z","submitted_at":"2026-05-03T13:11:28Z","title":"QHyer: Q-conditioned Hybrid Attention-mamba Transformer for Offline Goal-conditioned RL","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-11T01:17:48.643521Z"},"links":{"cited_paper":"/paper/2011.08909","citing_paper":"/paper/2605.01862"},"observation_digest":"sha256:42f7e66d317210aa0cd7a042c64e87a57c558dab3f3ff3c77a8d399f1c743339","observation_id":"4cab83a9-a888-481b-810b-ce7e14f3dfd6","resolution":{"observed_at":"2026-05-11T04:30:58.615800Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.08909","last_updated":"2021-04-19T18:33:47Z","snapshot_observed_at":"2026-07-06T10:15:31.432847Z","submitted_at":"2020-11-17T19:58:56Z","title":"C-Learning: Learning to Achieve Goals via Recursive Classification","version":2},"cited_work":{"arxiv_id":"2011.08909","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.08909","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2011.08909 , year=","venue":null,"work_id":"90cf7c98-c699-4a9a-ae4a-862e17a18ba7","year":2011},"citing_paper":{"arxiv_id":"2605.14350","last_updated":"2026-05-14T04:22:24Z","snapshot_observed_at":"2026-07-06T23:25:49.545418Z","submitted_at":"2026-05-14T04:22:24Z","title":"Distributionally Robust Multi-Task Reinforcement Learning via Adaptive Task Sampling","version":1},"reference_index":276,"source":"arxiv_source","source_observed_at":"2026-05-15T03:05:36.871497Z"},"links":{"cited_paper":"/paper/2011.08909","citing_paper":"/paper/2605.14350"},"observation_digest":"sha256:35c64c2b1b711c3d275bcf7d7d3aea0781d2f55d0933f484d18109aeaa51af6a","observation_id":"01337bf5-734c-45f0-a265-4ad306b63061","resolution":{"observed_at":"2026-05-15T03:08:59.707624Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.08909","last_updated":"2021-04-19T18:33:47Z","snapshot_observed_at":"2026-07-06T10:15:31.432847Z","submitted_at":"2020-11-17T19:58:56Z","title":"C-Learning: Learning to Achieve Goals via Recursive Classification","version":2},"cited_work":{"arxiv_id":"2011.08909","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.08909","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2011.08909 , year=","venue":null,"work_id":"90cf7c98-c699-4a9a-ae4a-862e17a18ba7","year":2011},"citing_paper":{"arxiv_id":"2605.23551","last_updated":"2026-05-22T12:17:09Z","snapshot_observed_at":"2026-07-06T23:33:44.335185Z","submitted_at":"2026-05-22T12:17:09Z","title":"Goal-Conditioned Agents that Learn Everything All at Once","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-25T04:59:48.867927Z"},"links":{"cited_paper":"/paper/2011.08909","citing_paper":"/paper/2605.23551"},"observation_digest":"sha256:50f9b4ff0198b0a43bb5efc542fbcbbc1756e58a4816c6e920a60bee50409f1e","observation_id":"846e3748-e828-486b-83c9-29c33591af77","resolution":{"observed_at":"2026-05-25T05:00:21.589341Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2011.08909/citation-record","integrity":"/paper/2011.08909/integrity","json":"/paper/2011.08909/citation-record.json","paper":"/paper/2011.08909"},"outbound":[],"paper":{"arxiv_id":"2011.08909","last_updated":"2021-04-19T18:33:47Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:15:31.432847Z","submitted_at":"2020-11-17T19:58:56Z","title":"C-Learning: Learning to Achieve Goals via Recursive Classification"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2011.08909."}