{"as_of":"2026-08-13T18:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d3a18916153fcd032a26e1dd4caf47d3c4095c03896083f4a1c604161ab57138","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":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-13T06:32:02.005865+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:42:59.192879Z","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-04T07:59:40.143882Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1512.02011","last_updated":"2016-01-20T10:33:00Z","snapshot_observed_at":"2026-07-06T04:38:59.730187Z","submitted_at":"2015-12-07T12:25:18Z","title":"How to Discount Deep Reinforcement Learning: Towards New Dynamic Strategies","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.02011","snapshot_observed_at":"2026-08-12T15:42:59.192879Z","title":"& Ernst, D","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14019","last_updated":"2024-11-21T11:03:07Z","snapshot_observed_at":"2026-08-12T18:37:20.729761Z","submitted_at":"2024-11-21T11:03:07Z","title":"Time-Scale Separation in Q-Learning: Extending TD($\\triangle$) for Action-Value Function Decomposition","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T15:42:59.192879Z"},"links":{"cited_paper":"/paper/1512.02011","citing_paper":"/paper/2411.14019"},"observation_digest":"sha256:553aeadadc22796ba889b59751f365e10a15d081e73d6ab189a6ad5cd62f46f5","observation_id":"4e491de7-3065-4406-9cef-a33d81355653","resolution":{"observed_at":"2026-08-12T15:42:59.192879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1512.02011","last_updated":"2016-01-20T10:33:00Z","snapshot_observed_at":"2026-07-06T04:38:59.730187Z","submitted_at":"2015-12-07T12:25:18Z","title":"How to Discount Deep Reinforcement Learning: Towards New Dynamic Strategies","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.02011","snapshot_observed_at":"2026-08-12T14:59:27.318410Z","title":"& Ernst, D","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14783","last_updated":"2025-09-04T07:01:56Z","snapshot_observed_at":"2026-08-12T14:51:42.480426Z","submitted_at":"2024-11-22T07:52:28Z","title":"Segmenting Action-Value Functions Over Time-Scales in SARSA via TD($\\Delta$)","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:27.318410Z"},"links":{"cited_paper":"/paper/1512.02011","citing_paper":"/paper/2411.14783"},"observation_digest":"sha256:2347c370fe9324dd02e4032e87c015699716373522e5e4ee22da32cea9be23a8","observation_id":"5b623dc0-70f2-4247-b409-a786b649530b","resolution":{"observed_at":"2026-08-12T14:59:27.318410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1512.02011","last_updated":"2016-01-20T10:33:00Z","snapshot_observed_at":"2026-07-06T04:38:59.730187Z","submitted_at":"2015-12-07T12:25:18Z","title":"How to Discount Deep Reinforcement Learning: Towards New Dynamic Strategies","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.02011","snapshot_observed_at":"2026-08-12T10:52:50.975419Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.10381","last_updated":"2025-05-26T03:49:37Z","snapshot_observed_at":"2026-08-13T07:21:07.679051Z","submitted_at":"2024-11-28T04:06:02Z","title":"Supervised Learning-enhanced Multi-Group Actor Critic for Live Stream Allocation in Feed","version":6},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T10:52:50.975419Z"},"links":{"cited_paper":"/paper/1512.02011","citing_paper":"/paper/2412.10381"},"observation_digest":"sha256:adb5fc850ea00a7341adbddda807eba97a4922eded29e38b7408a5f56aadc2a9","observation_id":"e87f761e-5451-4632-8dc7-05c2491bfcf2","resolution":{"observed_at":"2026-08-12T10:52:50.975419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1512.02011","last_updated":"2016-01-20T10:33:00Z","snapshot_observed_at":"2026-07-06T04:38:59.730187Z","submitted_at":"2015-12-07T12:25:18Z","title":"How to Discount Deep Reinforcement Learning: Towards New Dynamic Strategies","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.02011","snapshot_observed_at":"2026-08-04T07:17:44.600398Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.26270","last_updated":"2026-05-28T11:04:33Z","snapshot_observed_at":"2026-08-13T12:45:17.683026Z","submitted_at":"2025-10-30T08:53:41Z","title":"Graph-Enhanced Policy Optimization in LLM Agent Training","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T07:17:44.600398Z"},"links":{"cited_paper":"/paper/1512.02011","citing_paper":"/paper/2510.26270"},"observation_digest":"sha256:b91db320d8a786c1ae5ac5cec5d34f7c646e6ce0a02239b20ea270428747978f","observation_id":"9e81c2d7-32d5-4e48-9600-fe920c48e535","resolution":{"observed_at":"2026-08-04T07:17:44.600398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1512.02011","last_updated":"2016-01-20T10:33:00Z","snapshot_observed_at":"2026-07-06T04:38:59.730187Z","submitted_at":"2015-12-07T12:25:18Z","title":"How to Discount Deep Reinforcement Learning: Towards New Dynamic Strategies","version":2},"cited_work":{"arxiv_id":"1512.02011","doi":null,"metadata_source":"pith","pith_arxiv_id":"1512.02011","snapshot_observed_at":"2026-07-04T07:59:40.143882Z","title":"How to Discount Deep Reinforcement Learning: Towards New Dynamic Strategies","venue":"cs.LG","work_id":"162e25e0-1d97-4e80-9690-45fd51dc60dc","year":2015},"citing_paper":{"arxiv_id":"2606.21943","last_updated":"2026-06-20T08:20:41Z","snapshot_observed_at":"2026-07-06T23:56:54.959593Z","submitted_at":"2026-06-20T08:20:41Z","title":"Modularized Reinforcement Learning on LLMs: From MDP Creation to Exploration and Learning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-26T12:15:08.304150Z"},"links":{"cited_paper":"/paper/1512.02011","citing_paper":"/paper/2606.21943"},"observation_digest":"sha256:cc7ae11d94b0cc2172a2d6696b54fcdfbc793b65aef20fb6e58330ddc8db3893","observation_id":"2b8ecf15-d970-4ed6-975a-8360f4d5f3ae","resolution":{"observed_at":"2026-07-04T07:59:40.145194Z","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/1512.02011/citation-record","integrity":"/paper/1512.02011/integrity","json":"/paper/1512.02011/citation-record.json","paper":"/paper/1512.02011"},"outbound":[],"paper":{"arxiv_id":"1512.02011","last_updated":"2016-01-20T10:33:00Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T04:38:59.730187Z","submitted_at":"2015-12-07T12:25:18Z","title":"How to Discount Deep Reinforcement Learning: Towards New Dynamic Strategies"},"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 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1512.02011."}