{"as_of":"2026-08-09T16:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:36d744bd9b512dffbb229bcf1f398733e1e3304b694035d3c2c2ec525bc263af","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-09T06:31:02.800959+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-04T21:09:35.599124Z","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-04T15:29:55.609297Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1711.09874","last_updated":"2018-04-27T17:55:06Z","snapshot_observed_at":"2026-08-02T11:19:35.648087Z","submitted_at":"2017-11-27T18:46:00Z","title":"Divide-and-Conquer Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.09874","snapshot_observed_at":"2026-08-04T21:09:35.599124Z","title":"Divide-and-conquer reinforcement learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.08194","last_updated":"2026-05-28T03:18:21Z","snapshot_observed_at":"2026-08-09T01:15:29.708748Z","submitted_at":"2025-09-09T23:56:16Z","title":"Prescribe-then-Select: Adaptive Policy Selection for Contextual Stochastic Optimization","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T21:09:35.599124Z"},"links":{"cited_paper":"/paper/1711.09874","citing_paper":"/paper/2509.08194"},"observation_digest":"sha256:6e7581bc09fb25c207ada8b0148cd1f5a410a8ba251d48c0f3b264d00f924494","observation_id":"40021a4c-6331-4dea-b781-0e0e78e441c1","resolution":{"observed_at":"2026-08-04T21:09:35.599124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.09874","last_updated":"2018-04-27T17:55:06Z","snapshot_observed_at":"2026-08-02T11:19:35.648087Z","submitted_at":"2017-11-27T18:46:00Z","title":"Divide-and-Conquer Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1711.09874","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.09874","snapshot_observed_at":"2026-07-04T15:29:55.609297Z","title":"Divide-and-Conquer Reinforcement Learning","venue":"cs.LG","work_id":"1a1b70e0-19b2-4b7c-9830-027cfd9982b9","year":2017},"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":241,"source":"arxiv_source","source_observed_at":"2026-05-15T03:05:36.871497Z"},"links":{"cited_paper":"/paper/1711.09874","citing_paper":"/paper/2605.14350"},"observation_digest":"sha256:9527fbfb5b0e6aa3cbbc68e3597e3c4545d39bce59e2fe512fd9f695e31352c0","observation_id":"46cde392-cc1f-414e-8b1b-7e64e3dc2f2e","resolution":{"observed_at":"2026-05-15T03:08:59.526177Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.09874","last_updated":"2018-04-27T17:55:06Z","snapshot_observed_at":"2026-08-02T11:19:35.648087Z","submitted_at":"2017-11-27T18:46:00Z","title":"Divide-and-Conquer Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1711.09874","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.09874","snapshot_observed_at":"2026-07-04T15:29:55.609297Z","title":"Divide-and-Conquer Reinforcement Learning","venue":"cs.LG","work_id":"1a1b70e0-19b2-4b7c-9830-027cfd9982b9","year":2017},"citing_paper":{"arxiv_id":"2606.26333","last_updated":"2026-06-24T19:16:34Z","snapshot_observed_at":"2026-08-08T17:20:16.758054Z","submitted_at":"2026-06-24T19:16:34Z","title":"Mesh-RL: Coupled subgrid reinforcement learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T01:37:31.834106Z"},"links":{"cited_paper":"/paper/1711.09874","citing_paper":"/paper/2606.26333"},"observation_digest":"sha256:fc11a2e80df3c33064242e168048ee555714e5b4c36332ee0218f98cf57fd9f3","observation_id":"4a734384-1404-4f7f-8e03-ae4f26cc5bcd","resolution":{"observed_at":"2026-07-04T15:29:55.611156Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1711.09874/citation-record","integrity":"/paper/1711.09874/integrity","json":"/paper/1711.09874/citation-record.json","paper":"/paper/1711.09874"},"outbound":[],"paper":{"arxiv_id":"1711.09874","last_updated":"2018-04-27T17:55:06Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T11:19:35.648087Z","submitted_at":"2017-11-27T18:46:00Z","title":"Divide-and-Conquer 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1711.09874."}