{"as_of":"2026-08-14T02:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a3e298e7b7a9acc5a9ef42a76c0cc421200a24b031781ceb6c58a878441faa4","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:35:45.040132Z","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-08-12T15:35:45.428347Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.07607","last_updated":"2021-03-19T01:44:03Z","snapshot_observed_at":"2026-08-13T19:58:57.311582Z","submitted_at":"2021-03-13T03:26:33Z","title":"Solving Compositional Reinforcement Learning Problems via Task Reduction","version":2},"cited_work":{"arxiv_id":"2103.07607","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.07607","snapshot_observed_at":"2026-08-12T15:35:45.428347Z","title":"Solving Compositional Reinforcement Learning Problems via Task Reduction","venue":"cs.LG","work_id":"1fbe8172-c4bc-4322-936c-2f050cd49a15","year":2021},"citing_paper":{"arxiv_id":"2411.14117","last_updated":"2024-11-21T13:34:36Z","snapshot_observed_at":"2026-08-14T00:37:06.454952Z","submitted_at":"2024-11-21T13:34:36Z","title":"Umbrella Reinforcement Learning -- computationally efficient tool for hard non-linear problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T15:35:45.040132Z"},"links":{"cited_paper":"/paper/2103.07607","citing_paper":"/paper/2411.14117"},"observation_digest":"sha256:86d75fa4b1e84832ee83a9a5ad1f2d53ac979e64140f22d4cbb18c9ea01c57c2","observation_id":"c338e191-d828-4787-af7d-8d646381f06a","resolution":{"observed_at":"2026-08-12T15:35:45.434144Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2103.07607/citation-record","integrity":"/paper/2103.07607/integrity","json":"/paper/2103.07607/citation-record.json","paper":"/paper/2103.07607"},"outbound":[],"paper":{"arxiv_id":"2103.07607","last_updated":"2021-03-19T01:44:03Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T19:58:57.311582Z","submitted_at":"2021-03-13T03:26:33Z","title":"Solving Compositional Reinforcement Learning Problems via Task Reduction"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2103.07607."}