{"as_of":"2026-08-21T20:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:93a6eca4d822e79589c372aab6f695d264e66001dd67d8d67caaa3f30ba8d2c1","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:16:05.614245Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:32:44.606265Z","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-05-20T23:09:12.779933Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"cited_work":{"arxiv_id":"2508.14881","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14881","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Compute-optimal scaling for value-based deep rl","venue":null,"work_id":"b5c1a21a-c316-4024-8ce9-c6108e5b5c50","year":2025},"citing_paper":{"arxiv_id":"2605.05812","last_updated":"2026-05-11T14:20:38Z","snapshot_observed_at":"2026-08-11T13:36:41.746341Z","submitted_at":"2026-05-07T07:47:55Z","title":"Long-Horizon Q-Learning: Accurate Value Learning via n-Step Inequalities","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-08T11:20:19.749415Z"},"links":{"cited_paper":"/paper/2508.14881","citing_paper":"/paper/2605.05812"},"observation_digest":"sha256:771915b27ca475e07a239769986fdb88a9c8b8682dab20b7a275b0969ba5805b","observation_id":"f5882310-8b74-4c2e-9fd0-4d303900a6ea","resolution":{"observed_at":"2026-05-11T19:41:08.015781Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"cited_work":{"arxiv_id":"2508.14881","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14881","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Compute-optimal scaling for value-based deep rl","venue":null,"work_id":"b5c1a21a-c316-4024-8ce9-c6108e5b5c50","year":2025},"citing_paper":{"arxiv_id":"2605.05812","last_updated":"2026-05-11T14:20:38Z","snapshot_observed_at":"2026-08-11T13:36:41.746341Z","submitted_at":"2026-05-07T07:47:55Z","title":"Long-Horizon Q-Learning: Accurate Value Learning via n-Step Inequalities","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-12T05:05:29.984355Z"},"links":{"cited_paper":"/paper/2508.14881","citing_paper":"/paper/2605.05812"},"observation_digest":"sha256:c30bc92d030c1fe5392de60e11bd8e397e5120719d9ccd741bb3796c7fa53cdd","observation_id":"6fd23155-1fce-4dde-b624-2185433e6559","resolution":{"observed_at":"2026-05-12T05:41:24.416657Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"cited_work":{"arxiv_id":"2508.14881","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14881","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Compute-optimal scaling for value-based deep rl","venue":null,"work_id":"b5c1a21a-c316-4024-8ce9-c6108e5b5c50","year":2025},"citing_paper":{"arxiv_id":"2605.10236","last_updated":"2026-05-17T21:09:20Z","snapshot_observed_at":"2026-08-16T00:35:49.068855Z","submitted_at":"2026-05-11T09:11:05Z","title":"When Does Non-Uniform Replay Matter in Reinforcement Learning?","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-12T05:33:19.038889Z"},"links":{"cited_paper":"/paper/2508.14881","citing_paper":"/paper/2605.10236"},"observation_digest":"sha256:a10e98157f73f6fb35e5ae5721d58dd205d6b9e099489964e27ebb02bd7cb6a0","observation_id":"543dd4ce-ed1a-4216-a681-0da75e26635b","resolution":{"observed_at":"2026-05-12T05:36:24.634953Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"cited_work":{"arxiv_id":"2508.14881","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14881","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Compute-optimal scaling for value-based deep rl","venue":null,"work_id":"b5c1a21a-c316-4024-8ce9-c6108e5b5c50","year":2025},"citing_paper":{"arxiv_id":"2605.10236","last_updated":"2026-05-17T21:09:20Z","snapshot_observed_at":"2026-08-16T00:35:49.068855Z","submitted_at":"2026-05-11T09:11:05Z","title":"When Does Non-Uniform Replay Matter in Reinforcement Learning?","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-13T06:27:38.643667Z"},"links":{"cited_paper":"/paper/2508.14881","citing_paper":"/paper/2605.10236"},"observation_digest":"sha256:a2899a3be1165c6facb17db3335d1df50bd759280130d8711646c9c41c4e058b","observation_id":"d904dbee-d795-4951-9703-540da200e088","resolution":{"observed_at":"2026-05-13T06:32:24.820119Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"cited_work":{"arxiv_id":"2508.14881","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14881","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Compute-optimal scaling for value-based deep rl","venue":null,"work_id":"b5c1a21a-c316-4024-8ce9-c6108e5b5c50","year":2025},"citing_paper":{"arxiv_id":"2605.10236","last_updated":"2026-05-17T21:09:20Z","snapshot_observed_at":"2026-08-16T00:35:49.068855Z","submitted_at":"2026-05-11T09:11:05Z","title":"When Does Non-Uniform Replay Matter in Reinforcement Learning?","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T23:04:12.943222Z"},"links":{"cited_paper":"/paper/2508.14881","citing_paper":"/paper/2605.10236"},"observation_digest":"sha256:bf4ce78578268b34adbc8144efeb3cefd5038bcb8c03422845654126249a8e77","observation_id":"761007f4-19f8-40aa-b515-f01edcfb3cc0","resolution":{"observed_at":"2026-05-20T23:09:12.784033Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.14881","snapshot_observed_at":"2026-08-06T00:32:44.606265Z","title":"arXiv preprint arXiv:2508.14881 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01205","last_updated":"2026-08-02T12:42:20Z","snapshot_observed_at":"2026-08-18T10:35:26.273590Z","submitted_at":"2026-08-02T12:42:20Z","title":"ReBRAC-v2: The Return of the King","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-06T00:32:44.606265Z"},"links":{"cited_paper":"/paper/2508.14881","citing_paper":"/paper/2608.01205"},"observation_digest":"sha256:f4b8610a8a73bb36a11f7d8230b60c1592c4f6daa6077ba345323a5b3aa248bb","observation_id":"a7e7be37-cb70-45f3-9d66-f0ccdbc0c06b","resolution":{"observed_at":"2026-08-06T00:32:44.606265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.14881/citation-record","integrity":"/paper/2508.14881/integrity","json":"/paper/2508.14881/citation-record.json","paper":"/paper/2508.14881"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.06985","last_updated":"2024-09-22T23:18:59Z","snapshot_observed_at":"2026-08-16T17:42:09.836698Z","submitted_at":"2021-11-12T23:42:12Z","title":"Nonparametric Bayesian Knockoff Generators for Feature Selection Under Complex Data Structure","version":2},"cited_work":{"arxiv_id":"2111.06985","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.06985","snapshot_observed_at":"2026-08-05T18:16:06.097779Z","title":"Nonparametric Bayesian Knockoff Generators for Feature Selection Under Complex Data Structure","venue":"stat.ME","work_id":"9d8ed997-59f0-466b-ad6c-3ba694a3376f","year":2021},"citing_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T18:16:05.148287Z"},"links":{"cited_paper":"/paper/2111.06985","citing_paper":"/paper/2508.14881"},"observation_digest":"sha256:e0315b9cc52f47d3a0e23b26071cde9c24191dc9be5a0d60bce81296270dbaeb","observation_id":"1ccfd86b-4a57-46d6-87c7-972f8059a92b","resolution":{"observed_at":"2026-08-05T18:16:06.182081Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:16:06.662997Z","title":"Proof of Theorem 1 Theorem 2 (Exchangeability of Conditional Residual Knockoffs) Let X = (X1,","venue":null,"work_id":"532397b9-ea76-4956-afe1-31c5d0e7fb27","year":2021},"citing_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T18:16:05.614245Z"},"links":{"citing_paper":"/paper/2508.14881"},"observation_digest":"sha256:2c48344687beae84805ce48da2ff0cdfa269fe27bac0253f50040c125ae1863e","observation_id":"213a2820-3ec5-4580-934e-372aebbdae81","resolution":{"observed_at":"2026-08-05T18:16:06.771155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.06465","last_updated":"2017-12-18T15:21:28Z","snapshot_observed_at":"2026-08-19T13:47:12.616577Z","submitted_at":"2017-12-18T15:21:28Z","title":"A Power and Prediction Analysis for Knockoffs with Lasso Statistics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.06465","snapshot_observed_at":"2026-08-05T18:16:05.443053Z","title":"A power and prediction analysis for knockoffs with lasso statistics","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-05T18:16:05.443053Z"},"links":{"cited_paper":"/paper/1712.06465","citing_paper":"/paper/2508.14881"},"observation_digest":"sha256:9cb39cdbbccf8cf3090c9543e004ede9871baa83c05229983836e2b61a7bfec9","observation_id":"bdcb4d25-f2ad-4d3d-b940-632c9298a143","resolution":{"observed_at":"2026-08-05T18:16:05.443053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.11641","last_updated":"2019-07-08T05:18:40Z","snapshot_observed_at":"2026-08-14T18:46:08.602959Z","submitted_at":"2018-07-31T02:50:47Z","title":"Adaptive Non-Parametric Regression With the $K$-NN Fused Lasso","version":4},"cited_work":{"arxiv_id":"1807.11641","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.11641","snapshot_observed_at":"2026-08-05T18:16:05.877228Z","title":"Adaptive Non-Parametric Regression With the $K$-NN Fused Lasso","venue":"stat.ME","work_id":"6f60ea46-4454-4d79-9ae3-a58dc65eff74","year":2018},"citing_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-05T18:16:05.334795Z"},"links":{"cited_paper":"/paper/1807.11641","citing_paper":"/paper/2508.14881"},"observation_digest":"sha256:c58d59cd03f1790b48534ccd645f8512e70c5cfdee15655d53b7a4072d6ff12b","observation_id":"11cbf698-0a70-49a4-951f-fa47767e5274","resolution":{"observed_at":"2026-08-05T18:16:05.975435Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.15346","last_updated":"2022-04-27T16:13:40Z","snapshot_observed_at":"2026-08-17T06:29:35.315181Z","submitted_at":"2020-07-30T09:50:43Z","title":"A Power Analysis for Model-X Knockoffs with $\\ell_{p}$-Regularized Statistics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.15346","snapshot_observed_at":"2026-08-05T18:16:05.528758Z","title":"A power analysis for knockoffs with the lasso coefficient-difference statistic","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-05T18:16:05.528758Z"},"links":{"cited_paper":"/paper/2007.15346","citing_paper":"/paper/2508.14881"},"observation_digest":"sha256:286a0180f4f71f7b24b59844414ee5ba4af6dd018af3c181e0f2a334fbd3231e","observation_id":"3484e5c6-17a5-4457-a2f8-1c6ae62b6061","resolution":{"observed_at":"2026-08-05T18:16:05.528758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.10765","last_updated":"2018-09-27T21:05:19Z","snapshot_observed_at":"2026-08-19T13:48:21.297640Z","submitted_at":"2018-09-27T21:05:19Z","title":"Auto-Encoding Knockoff Generator for FDR Controlled Variable Selection","version":1},"cited_work":{"arxiv_id":"1809.10765","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.10765","snapshot_observed_at":"2026-08-05T18:16:06.262276Z","title":"Auto-Encoding Knockoff Generator for FDR Controlled Variable Selection","venue":"stat.ME","work_id":"8fbba8df-431d-48a0-a5ca-d3981ecc9a31","year":2018},"citing_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T18:16:05.030866Z"},"links":{"cited_paper":"/paper/1809.10765","citing_paper":"/paper/2508.14881"},"observation_digest":"sha256:b30451866bf36932bb7c940ee9f5cdfe5394365c37ebd6a42cbfc19f006f4f6a","observation_id":"a5aba586-eb82-4c99-acf9-2cd645148e6d","resolution":{"observed_at":"2026-08-05T18:16:06.368355Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7554/elife.75244","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"doi: 10.7554/eLife.75244","venue":"eLife","work_id":"d440a84c-9ac4-496e-8428-ca73f53834f8","year":2050},"citing_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T18:16:05.253242Z"},"links":{"citing_paper":"/paper/2508.14881"},"observation_digest":"sha256:e91191b632d0181edcd8ff902ff026cb6c5458fbe3e4003f7fa076740a6ccbed","observation_id":"e89ab147-a948-4324-ab13-7a1a9194ff83","resolution":{"observed_at":"2026-08-05T18:16:05.756036Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:16:06.862614Z","title":"Updated 2023 Mar","venue":null,"work_id":"10bdef2b-29c5-4fb1-a98d-ed84c0096361","year":2023},"citing_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T18:16:04.806004Z"},"links":{"citing_paper":"/paper/2508.14881"},"observation_digest":"sha256:4ea027c1d2c1665c6ae291360bff5df0e3d58bc81b86600ba6f819c57e4e337b","observation_id":"546c1c5c-786e-4f15-abe2-b88b3828186a","resolution":{"observed_at":"2026-08-05T18:16:06.959300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.14026","last_updated":"2020-10-27T03:11:24Z","snapshot_observed_at":"2026-08-18T03:58:31.197790Z","submitted_at":"2020-10-27T03:11:24Z","title":"Sequential knockoffs for continuous and categorical predictors: with application to a large Psoriatic Arthritis clinical trial pool","version":1},"cited_work":{"arxiv_id":"2010.14026","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.14026","snapshot_observed_at":"2026-08-05T18:16:06.479932Z","title":"Sequential knockoffs for continuous and categorical predictors: with application to a large Psoriatic Arthritis clinical trial pool","venue":"stat.ME","work_id":"b2ff12bb-2ba9-4525-9749-730436225198","year":2020},"citing_paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T18:16:04.904514Z"},"links":{"cited_paper":"/paper/2010.14026","citing_paper":"/paper/2508.14881"},"observation_digest":"sha256:e7e30e6038c51a51ecc3dd6ddad8e40d0dea97c6c501cf0434d7fc346792ffff","observation_id":"dbf59edd-40d9-4dc9-95fc-137caed5c5ed","resolution":{"observed_at":"2026-08-05T18:16:06.561699Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.14881","last_updated":"2025-08-25T05:37:55Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T13:47:43.478170Z","submitted_at":"2025-08-20T17:54:21Z","title":"Compute-Optimal Scaling for Value-Based Deep RL"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":2,"verified_exact":4,"verified_fuzzy":2},"total_outbound_references":9},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 6 inbound Pith citation observations for arXiv:2508.14881."}