{"as_of":"2026-08-06T08:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e767cb821eb994019bb0e630b5a840930c98fc1d7df981713500df4fb3ecab23","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-06T06:34:29.942622+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-06-30T21:45:43.298829Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":6,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1704.05495","last_updated":"2017-04-18T18:46:12Z","snapshot_observed_at":"2026-08-05T02:52:15.893258Z","submitted_at":"2017-04-18T18:46:12Z","title":"Investigating Recurrence and Eligibility Traces in Deep Q-Networks","version":1},"cited_work":{"arxiv_id":"1704.05495","doi":"10.48550/arxiv.1704.05495","metadata_source":"pith","pith_arxiv_id":"1704.05495","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Investigating Recurrence and Eligibility Traces in Deep Q-Networks","venue":"cs.AI","work_id":"3c4404e8-3bda-4223-92f4-78fadcb34d9e","year":2017},"citing_paper":{"arxiv_id":"2605.14779","last_updated":"2026-05-14T12:48:44Z","snapshot_observed_at":"2026-07-06T23:26:09.066863Z","submitted_at":"2026-05-14T12:48:44Z","title":"Peng's Q($\\lambda$) for Conservative Value Estimation in Offline Reinforcement Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T21:45:43.298829Z"},"links":{"cited_paper":"/paper/1704.05495","citing_paper":"/paper/2605.14779"},"observation_digest":"sha256:e10f56c81cf49432477edf8fbba57337ec3096b0d3d969c263f00e691158b8cb","observation_id":"6aa40849-180f-49ba-a9ad-3d22da974035","resolution":{"observed_at":"2026-07-01T14:25:45.855564Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.05495","last_updated":"2017-04-18T18:46:12Z","snapshot_observed_at":"2026-08-05T02:52:15.893258Z","submitted_at":"2017-04-18T18:46:12Z","title":"Investigating Recurrence and Eligibility Traces in Deep Q-Networks","version":1},"cited_work":{"arxiv_id":"1704.05495","doi":"10.48550/arxiv.1704.05495","metadata_source":"pith","pith_arxiv_id":"1704.05495","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Investigating Recurrence and Eligibility Traces in Deep Q-Networks","venue":"cs.AI","work_id":"3c4404e8-3bda-4223-92f4-78fadcb34d9e","year":2017},"citing_paper":{"arxiv_id":"2606.04735","last_updated":"2026-06-03T11:19:29Z","snapshot_observed_at":"2026-07-06T23:44:47.848374Z","submitted_at":"2026-06-03T11:19:29Z","title":"Trace-Mediated Peak Bias: Bridging Temporal Credit Assignment and Cognitive Heuristics in Deep Reinforcement Learning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-28T07:37:08.423086Z"},"links":{"cited_paper":"/paper/1704.05495","citing_paper":"/paper/2606.04735"},"observation_digest":"sha256:df6547a39f412186d6904fd07fc721a0b424af4e31308f41ab50a851b52a08df","observation_id":"5399b261-9c58-4bd8-ab45-c87706d8d9df","resolution":{"observed_at":"2026-06-28T07:41:45.473692Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1704.05495/citation-record","integrity":"/paper/1704.05495/integrity","json":"/paper/1704.05495/citation-record.json","paper":"/paper/1704.05495"},"outbound":[],"paper":{"arxiv_id":"1704.05495","last_updated":"2017-04-18T18:46:12Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-05T02:52:15.893258Z","submitted_at":"2017-04-18T18:46:12Z","title":"Investigating Recurrence and Eligibility Traces in Deep Q-Networks"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1704.05495."}