{"as_of":"2026-08-04T20:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b47abf91459b60c7ec4e5d76b6bf39bf87e17a3c1c49812ca129ec3f499e3700","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-04T06:34:03.388597+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-04T19:45:35.273949Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-25T16:26:01.486024Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1703.01161","last_updated":"2017-03-06T18:17:18Z","snapshot_observed_at":"2026-07-06T05:32:14.353059Z","submitted_at":"2017-03-03T14:05:11Z","title":"FeUdal Networks for Hierarchical Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1703.01161","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.01161","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"FeUdal Networks for Hierarchical Reinforcement Learning","venue":"cs.AI","work_id":"bc54652f-cb93-4ec8-8060-a5fb162e4793","year":2017},"citing_paper":{"arxiv_id":"1906.10667","last_updated":"2019-06-25T17:04:48Z","snapshot_observed_at":"2026-08-03T23:56:12.795379Z","submitted_at":"2019-06-25T17:04:48Z","title":"Reinforcement Learning with Competitive Ensembles of Information-Constrained Primitives","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-25T16:22:50.877642Z"},"links":{"cited_paper":"/paper/1703.01161","citing_paper":"/paper/1906.10667"},"observation_digest":"sha256:fbecc1fa29b8f3c86ac5419f6d642e49356fbb4e7b6fafcf54280a3084ba3db1","observation_id":"188fb052-ae82-40b9-86d6-fce4d2fb3d03","resolution":{"observed_at":"2026-05-25T16:26:01.488629Z","resolver_source":"local_arxiv","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":"1703.01161","last_updated":"2017-03-06T18:17:18Z","snapshot_observed_at":"2026-07-06T05:32:14.353059Z","submitted_at":"2017-03-03T14:05:11Z","title":"FeUdal Networks for Hierarchical Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.01161","snapshot_observed_at":"2026-07-11T22:00:16.070183Z","title":"arXiv preprint arXiv:1703.01161 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04056","last_updated":"2026-07-04T23:46:08Z","snapshot_observed_at":"2026-07-11T22:00:11.885781Z","submitted_at":"2026-07-04T23:46:08Z","title":"A Policy Decomposition Framework for Dynamic Order Fulfillment Operations","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-11T22:00:16.070183Z"},"links":{"cited_paper":"/paper/1703.01161","citing_paper":"/paper/2607.04056"},"observation_digest":"sha256:25ea796e20eb27e03dca4eb2dd12082faed599f1ae91060076bde0944d38f7af","observation_id":"4bf9deed-7e16-4441-a847-d8faa093e246","resolution":{"observed_at":"2026-07-11T22:00:16.070183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.01161","last_updated":"2017-03-06T18:17:18Z","snapshot_observed_at":"2026-07-06T05:32:14.353059Z","submitted_at":"2017-03-03T14:05:11Z","title":"FeUdal Networks for Hierarchical Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.01161","snapshot_observed_at":"2026-08-04T19:45:35.273949Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.01851","last_updated":"2026-08-03T07:58:35Z","snapshot_observed_at":"2026-08-04T20:20:55.547405Z","submitted_at":"2026-08-03T07:58:35Z","title":"Weights or Skills? A Survey of Robot-Learning Techniques: from Action-Predicting Weights to Robots that Write their Own Skills","version":1},"reference_index":246,"source":"pdf_text","source_observed_at":"2026-08-04T19:45:35.273949Z"},"links":{"cited_paper":"/paper/1703.01161","citing_paper":"/paper/2608.01851"},"observation_digest":"sha256:9a1da1a2edfb00b2689c5383efdbd9e32f8ebd3a814570cd1db0a1b383212165","observation_id":"ddec96fb-169f-4af7-b17c-295cf22410d1","resolution":{"observed_at":"2026-08-04T19:45:35.273949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1703.01161/citation-record","integrity":"/paper/1703.01161/integrity","json":"/paper/1703.01161/citation-record.json","paper":"/paper/1703.01161"},"outbound":[],"paper":{"arxiv_id":"1703.01161","last_updated":"2017-03-06T18:17:18Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T05:32:14.353059Z","submitted_at":"2017-03-03T14:05:11Z","title":"FeUdal Networks for Hierarchical Reinforcement Learning"},"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 3 inbound Pith citation observations for arXiv:1703.01161."}