{"as_of":"2026-08-18T04:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c7c9a047289e9e8cdbf1236005fa9123b4deeaebc55329f3c322a41698e697e2","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:00:05.690265Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T00:07:28.184775Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.01812","last_updated":"2022-06-03T20:38:27Z","snapshot_observed_at":"2026-08-17T15:56:50.324903Z","submitted_at":"2022-06-03T20:38:27Z","title":"Challenges to Solving Combinatorially Hard Long-Horizon Deep RL Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.01812","snapshot_observed_at":"2026-08-15T22:00:05.690265Z","title":"Challenges to solving combinatorially hard long-horizon deep rl tasks,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.08382","last_updated":"2025-05-13T09:29:16Z","snapshot_observed_at":"2026-08-17T18:51:10.589807Z","submitted_at":"2025-05-13T09:29:16Z","title":"Continuous World Coverage Path Planning for Fixed-Wing UAVs using Deep Reinforcement Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T22:00:05.690265Z"},"links":{"cited_paper":"/paper/2206.01812","citing_paper":"/paper/2505.08382"},"observation_digest":"sha256:1e4670851794f7afe9f69e9df6f142f6c45ee66847873ec0ba8ab26301d6c6b5","observation_id":"629e1e0c-1794-41a9-9c89-f45ca2b7b740","resolution":{"observed_at":"2026-08-15T22:00:05.690265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.01812","last_updated":"2022-06-03T20:38:27Z","snapshot_observed_at":"2026-08-17T15:56:50.324903Z","submitted_at":"2022-06-03T20:38:27Z","title":"Challenges to Solving Combinatorially Hard Long-Horizon Deep RL Tasks","version":1},"cited_work":{"arxiv_id":"2206.01812","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.01812","snapshot_observed_at":"2026-07-03T00:07:28.184775Z","title":"Challenges to solving combinatorially hard long-horizon deep RL tasks,","venue":null,"work_id":"5677948c-0b44-4f9f-8761-3cdfa1f71b6e","year":2022},"citing_paper":{"arxiv_id":"2606.10129","last_updated":"2026-06-08T20:06:25Z","snapshot_observed_at":"2026-08-15T11:23:41.311382Z","submitted_at":"2026-06-08T20:06:25Z","title":"Discovering Interpretable Multi-Parameter Control Policies for Evolutionary Algorithms Using Deep Reinforcement Learning","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-06-27T17:29:31.604234Z"},"links":{"cited_paper":"/paper/2206.01812","citing_paper":"/paper/2606.10129"},"observation_digest":"sha256:aa9d9fab703f6b78a923e8c747213aa310b5627b9060f6449fa8d72265ba72cb","observation_id":"92668e01-f2ec-438f-a49a-5550761f0674","resolution":{"observed_at":"2026-07-03T00:07:28.186341Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2206.01812/citation-record","integrity":"/paper/2206.01812/integrity","json":"/paper/2206.01812/citation-record.json","paper":"/paper/2206.01812"},"outbound":[],"paper":{"arxiv_id":"2206.01812","last_updated":"2022-06-03T20:38:27Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T15:56:50.324903Z","submitted_at":"2022-06-03T20:38:27Z","title":"Challenges to Solving Combinatorially Hard Long-Horizon Deep RL Tasks"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2206.01812."}