{"as_of":"2026-08-05T21:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:66bc63625aeb7f03a5776691bc1470f777c2f9a24a4797c5555ce0591577c983","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:32:07.414703Z","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-07-03T02:07:34.154221Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.01257","last_updated":"2019-01-09T16:00:49Z","snapshot_observed_at":"2026-07-06T07:05:38.801141Z","submitted_at":"2018-10-02T14:00:14Z","title":"Near-Optimal Representation Learning for Hierarchical Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1810.01257","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.01257","snapshot_observed_at":"2026-07-03T02:07:34.154221Z","title":"Near-Optimal Representation Learning for Hierarchical Reinforcement Learning","venue":"cs.AI","work_id":"571a74da-b89e-4c95-b8d0-f091097e623b","year":2018},"citing_paper":{"arxiv_id":"1907.00664","last_updated":"2019-07-01T11:22:52Z","snapshot_observed_at":"2026-07-06T08:04:02.269421Z","submitted_at":"2019-07-01T11:22:52Z","title":"Learning World Graphs to Accelerate Hierarchical Reinforcement Learning","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-05-25T12:31:38.848720Z"},"links":{"cited_paper":"/paper/1810.01257","citing_paper":"/paper/1907.00664"},"observation_digest":"sha256:51c1185f2bd862047884b29a5a8ab48ac4570e71ac33281c2b96d5a0e1c7eb6a","observation_id":"d3043600-40b5-4318-bc7b-4fbaf87c57d0","resolution":{"observed_at":"2026-05-25T12:35:49.122041Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.01257","last_updated":"2019-01-09T16:00:49Z","snapshot_observed_at":"2026-07-06T07:05:38.801141Z","submitted_at":"2018-10-02T14:00:14Z","title":"Near-Optimal Representation Learning for Hierarchical Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1810.01257","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.01257","snapshot_observed_at":"2026-07-03T02:07:34.154221Z","title":"Near-Optimal Representation Learning for Hierarchical Reinforcement Learning","venue":"cs.AI","work_id":"571a74da-b89e-4c95-b8d0-f091097e623b","year":2018},"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":9,"source":"pdf_text","source_observed_at":"2026-05-22T00:53:46.002945Z"},"links":{"cited_paper":"/paper/1810.01257","citing_paper":"/paper/2506.21039"},"observation_digest":"sha256:936d463b3016c7c407ba77419188fd369bd925924e3c956335e1cafb355dc8db","observation_id":"90065b4b-8239-4149-9b0b-9d022a425215","resolution":{"observed_at":"2026-05-22T00:54:31.191823Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.01257","last_updated":"2019-01-09T16:00:49Z","snapshot_observed_at":"2026-07-06T07:05:38.801141Z","submitted_at":"2018-10-02T14:00:14Z","title":"Near-Optimal Representation Learning for Hierarchical Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.01257","snapshot_observed_at":"2026-08-05T14:32:07.414703Z","title":"Near-optimal represen- tation learning for hierarchical reinforcement learning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.21272","last_updated":"2025-08-29T00:27:03Z","snapshot_observed_at":"2026-08-05T14:32:05.610595Z","submitted_at":"2025-08-29T00:27:03Z","title":"Learning to Assemble the Soma Cube with Legal-Action Masked DQN and Safe ZYZ Regrasp on a Doosan M0609","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T14:32:07.414703Z"},"links":{"cited_paper":"/paper/1810.01257","citing_paper":"/paper/2508.21272"},"observation_digest":"sha256:49110aa752a55496e23f6fbd744e86e304d35885b0bce4343cef366cc408552f","observation_id":"8bea5021-f2fb-4f02-b013-26b8ab47c227","resolution":{"observed_at":"2026-08-05T14:32:07.414703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.01257","last_updated":"2019-01-09T16:00:49Z","snapshot_observed_at":"2026-07-06T07:05:38.801141Z","submitted_at":"2018-10-02T14:00:14Z","title":"Near-Optimal Representation Learning for Hierarchical Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1810.01257","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.01257","snapshot_observed_at":"2026-07-03T02:07:34.154221Z","title":"Near-Optimal Representation Learning for Hierarchical Reinforcement Learning","venue":"cs.AI","work_id":"571a74da-b89e-4c95-b8d0-f091097e623b","year":2018},"citing_paper":{"arxiv_id":"2605.22711","last_updated":"2026-05-21T16:50:26Z","snapshot_observed_at":"2026-07-06T23:32:59.663926Z","submitted_at":"2026-05-21T16:50:26Z","title":"Abstraction for Offline Goal-Conditioned Reinforcement Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-22T07:46:20.289421Z"},"links":{"cited_paper":"/paper/1810.01257","citing_paper":"/paper/2605.22711"},"observation_digest":"sha256:80c83333ef2b83274550aeabd059e52a210f70871a6a0370c17104b39d08aa1d","observation_id":"c2946719-8979-4fb7-b88f-b90275c49b94","resolution":{"observed_at":"2026-05-22T07:51:16.529792Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.01257","last_updated":"2019-01-09T16:00:49Z","snapshot_observed_at":"2026-07-06T07:05:38.801141Z","submitted_at":"2018-10-02T14:00:14Z","title":"Near-Optimal Representation Learning for Hierarchical Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1810.01257","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.01257","snapshot_observed_at":"2026-07-03T02:07:34.154221Z","title":"Near-Optimal Representation Learning for Hierarchical Reinforcement Learning","venue":"cs.AI","work_id":"571a74da-b89e-4c95-b8d0-f091097e623b","year":2018},"citing_paper":{"arxiv_id":"2606.09476","last_updated":"2026-06-08T13:35:22Z","snapshot_observed_at":"2026-08-01T13:38:00.934917Z","submitted_at":"2026-06-08T13:35:22Z","title":"Goal Sets, Not Goal States: Queryable Robot Goals through Goal-Set Hindsight Relabeling","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T16:07:28.361043Z"},"links":{"cited_paper":"/paper/1810.01257","citing_paper":"/paper/2606.09476"},"observation_digest":"sha256:7e544d0359b3bb20aa4e6dfe2db1e79ec8162dc6b868522e99d1f222c033a2f7","observation_id":"04423fca-ce66-4b38-b5a1-67a0d9cc076b","resolution":{"observed_at":"2026-07-03T02:07:34.155589Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1810.01257/citation-record","integrity":"/paper/1810.01257/integrity","json":"/paper/1810.01257/citation-record.json","paper":"/paper/1810.01257"},"outbound":[],"paper":{"arxiv_id":"1810.01257","last_updated":"2019-01-09T16:00:49Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T07:05:38.801141Z","submitted_at":"2018-10-02T14:00:14Z","title":"Near-Optimal Representation Learning 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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1810.01257."}