{"as_of":"2026-08-17T16:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2011f992df66db7c6358f8bd0bb4b869f543db875249588771798ac2f3663aa7","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T23:46:56.674255Z","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-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2602.12753/citation-record","integrity":"/paper/2602.12753/integrity","json":"/paper/2602.12753/citation-record.json","paper":"/paper/2602.12753"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.05265","last_updated":"2021-03-18T13:58:01Z","snapshot_observed_at":"2026-08-16T18:52:29.068861Z","submitted_at":"2021-01-13T18:55:43Z","title":"Contrastive Behavioral Similarity Embeddings for Generalization in Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05265","snapshot_observed_at":"2026-08-02T23:46:56.335700Z","title":"C., Castro, P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.12753","last_updated":"2026-06-11T11:35:13Z","snapshot_observed_at":"2026-08-14T14:56:40.959040Z","submitted_at":"2026-02-13T09:32:26Z","title":"Hierarchical Successor Representation for Robust Transfer","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T23:46:56.335700Z"},"links":{"cited_paper":"/paper/2101.05265","citing_paper":"/paper/2602.12753"},"observation_digest":"sha256:4e1eb7f976de0b37adfdbbf7d3252b09a65e5640f03471019c37df1cca722f83","observation_id":"fd01fa25-acb8-42b1-8f9f-f65d81d6128d","resolution":{"observed_at":"2026-08-02T23:46:56.335700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00123","last_updated":"2020-01-17T23:25:22Z","snapshot_observed_at":"2026-08-14T18:21:49.462789Z","submitted_at":"2018-09-29T00:52:34Z","title":"Generalization and Regularization in DQN","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00123","snapshot_observed_at":"2026-08-02T23:46:56.405225Z","title":"C., and Bowling, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.12753","last_updated":"2026-06-11T11:35:13Z","snapshot_observed_at":"2026-08-14T14:56:40.959040Z","submitted_at":"2026-02-13T09:32:26Z","title":"Hierarchical Successor Representation for Robust Transfer","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-02T23:46:56.405225Z"},"links":{"cited_paper":"/paper/1810.00123","citing_paper":"/paper/2602.12753"},"observation_digest":"sha256:271bea9ef829b668627d115b595754caf63de25b68f7c6a5570aea1eb14347e6","observation_id":"91e7bc31-a76d-4b71-9efb-2ad424663a00","resolution":{"observed_at":"2026-08-02T23:46:56.405225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.05397","last_updated":"2016-11-16T18:21:29Z","snapshot_observed_at":"2026-08-17T16:01:56.839157Z","submitted_at":"2016-11-16T18:21:29Z","title":"Reinforcement Learning with Unsupervised Auxiliary Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.05397","snapshot_observed_at":"2026-08-02T23:46:56.509336Z","title":"M., Schaul, T., Leibo, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.12753","last_updated":"2026-06-11T11:35:13Z","snapshot_observed_at":"2026-08-14T14:56:40.959040Z","submitted_at":"2026-02-13T09:32:26Z","title":"Hierarchical Successor Representation for Robust Transfer","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T23:46:56.509336Z"},"links":{"cited_paper":"/paper/1611.05397","citing_paper":"/paper/2602.12753"},"observation_digest":"sha256:adbb2b6db62b4626578c5a49eec625c8ef7d97072f2a3f0f9c7f486ca665a06a","observation_id":"cbf16847-a4e2-4bc1-a597-2b1efb5174f8","resolution":{"observed_at":"2026-08-02T23:46:56.509336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:46:56.674255Z","title":"∞X t=0 γt1(st, s′)|s0 =s # = X ¯a∈¯A µ(¯a|s) Eπ¯a","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12753","last_updated":"2026-06-11T11:35:13Z","snapshot_observed_at":"2026-08-14T14:56:40.959040Z","submitted_at":"2026-02-13T09:32:26Z","title":"Hierarchical Successor Representation for Robust Transfer","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-02T23:46:56.674255Z"},"links":{"citing_paper":"/paper/2602.12753"},"observation_digest":"sha256:2ed4862d3c826791d6a78ef53b23fc155c176c8712d279e212c5f0b4c9e3070b","observation_id":"2e991cd0-c7bb-4079-a4c0-411fc5e91a45","resolution":{"observed_at":"2026-08-02T23:46:56.674255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.10742","last_updated":"2021-04-07T01:57:14Z","snapshot_observed_at":"2026-08-12T08:19:24.097653Z","submitted_at":"2020-06-18T17:59:35Z","title":"Learning Invariant Representations for Reinforcement Learning without Reconstruction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10742","snapshot_observed_at":"2026-08-02T23:46:56.591823Z","title":"Learning invariant representations for rein- forcement learning without reconstruction.arXiv preprint arXiv:2006.10742,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.12753","last_updated":"2026-06-11T11:35:13Z","snapshot_observed_at":"2026-08-14T14:56:40.959040Z","submitted_at":"2026-02-13T09:32:26Z","title":"Hierarchical Successor Representation for Robust Transfer","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T23:46:56.591823Z"},"links":{"cited_paper":"/paper/2006.10742","citing_paper":"/paper/2602.12753"},"observation_digest":"sha256:51d189186f1de00943f79dbdb4140fc8d1877a5eaf65876442e162e93168b0fe","observation_id":"8d209b51-f58e-41ea-93d7-7422cb413cbc","resolution":{"observed_at":"2026-08-02T23:46:56.591823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.12753","last_updated":"2026-06-11T11:35:13Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T14:56:40.959040Z","submitted_at":"2026-02-13T09:32:26Z","title":"Hierarchical Successor Representation for Robust Transfer"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":5},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 0 inbound Pith citation observations for arXiv:2602.12753."}