{"as_of":"2026-08-08T21:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1ba3fffb337ea381df83841df8158541ea568dca5e9d248b9858b51abe86e577","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T10:27:13.896754Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.04990/citation-record","integrity":"/paper/2607.04990/integrity","json":"/paper/2607.04990/citation-record.json","paper":"/paper/2607.04990"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:2b82aef63fd112a207a9e42cbf713063ca22fbc6fbad63c6b693cedef618f04c","observation_id":"5c30c569-1894-4257-b707-dd0090cd6681","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Bertsekas,Reinforcement Learning and Optimal Control","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:fae188315685d76ad3aba8ebbb909d41a5d84cb85e8fe946c5a2c7ed19251a4a","observation_id":"b10cb44c-89d7-4156-b330-af44953a9587","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Deep reinforcement learning: A brief survey,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:b4e61ca722ff72248e6020fbd7c778e98e21a2ab0923e44de64b0b10a10f90bc","observation_id":"664a0594-eb84-49ee-b5c1-ec6cd234b41d","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.01643","last_updated":"2020-11-01T23:50:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-04T17:00:15Z","title":"Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.01643","snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Offline reinforcement learning: Tutorial, review, and perspectives on open problems,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"cited_paper":"/paper/2005.01643","citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:da8a44c0006246af7cd62e0ca3415e648d44b49b1047128e62f6084b6dc76df9","observation_id":"36cf6291-4c2d-453a-b932-97df15d70527","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Regularization and feature selection in least- squares temporal difference learning,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:0c272a96fff9a1c91be3071480ac80671c35b1c4711719f8493a58d690e5e051","observation_id":"c115dc6b-36e3-4e70-af34-55bf038b52e7","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"ℓ 1-penalized projected Bellman residual,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:924ebb67a7fdb2f5d6109436cb3900ab597aa29649759c7ad244cc3e9571fbbf","observation_id":"5dbe6636-40fd-46f7-a386-4ad5f4ddaff7","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Sparse reinforcement learning via convex optimization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:334f27c0e18157d79fb068a4eadabea7801263512e077025cf4ebf8be53e06ec","observation_id":"833b7633-3e51-4ec8-a664-b7bfe4de3f64","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Feature selection and feature learning for high-dimensional batch reinforcement learning: A survey,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:019311ed13885a549d993f6359a58663c6f50cc8216e121d92f070b8fc33d34c","observation_id":"22406af2-b2af-44ef-b028-41f530c3261a","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Sparse Q-learning with mirror descent,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:3db59e261f50a1bf2921947cbea2f77154caab798ba45d054239eb04a71e0982","observation_id":"23eb2217-1341-43e3-b531-7a2230d19a4f","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Sparse proximal reinforcement learning via nested optimization,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:fe752a065971c396e9d58035cdfa08aea8983abfbaa017e925fb9a701671a32d","observation_id":"56767f9c-b5cf-49ff-acb6-7feb6468ca16","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Online sparse temporal difference learning based on nested optimization and regularized dual averaging,","venue":null,"work_id":null,"year":2042},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:eca59bf48146361003b7f1821166ef179c259edd9c787f4b83c67f1bac89dd95","observation_id":"35e7c4c1-2802-42ea-b1f4-257468bad035","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"L1 regularized linear temporal difference learning,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:adcd5a74e2d267ce765e8ee6f4213e6ef8f3289d45da5ef667bd0a735cbf4783","observation_id":"12f9c38d-76ef-4ebf-bb92-dec8cf671740","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Least-squares policy iteration,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:bbb8baa4412cbcbf6f50e4472168d398996cc11240f22d750dc50a5a96bca689","observation_id":"a2a7e7ac-432c-42a3-9948-5d7b0079ff0e","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Regression shrinkage and selection via the lasso,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:bab3c8d2dbc482504488fb2adb03e87345d4c70a4b8b169dbe685790c6fdf820","observation_id":"735090c1-9e2c-48d7-8831-c03e68c75fbf","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Hastie, R","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:ac4d94ffc5ea7614e3b18275a0ff262d42c8d378dcbd56ba6cd816fab2d9253b","observation_id":"f945b3e4-15a0-4913-b708-b84feaca8efd","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:a02119c36300e5fb396a799b55c7d24ff47be3c3a44384a45ddc41cdebae7d8e","observation_id":"d41acd89-6307-4d6e-a47e-3b398c946f9d","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Variable selection via nonconcave penalized likelihood and its oracle properties,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:4a30a4971efafebbd1bf1793765e1d5dbeb02865930fa3c51c935dab356a2e87","observation_id":"179d6b7f-975e-4cae-a7b7-56396faf0b4e","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Sparse recovery via differential inclusions,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:d96d8a4134a8003bf27b5d4c0cc4663bc33f8e928357b80632c7a4d9be3e40b0","observation_id":"3aa819ab-3be4-4082-bfee-b69f0e65b733","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Nearly unbiased variable selection under minimax con- cave penalty,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:7ba48e1ffc194646f65a6978a4cdf04107e06d83633656d52b18a56bcb1a6a8c","observation_id":"ab8cb240-6ea0-4e82-8e5b-8ed268aaee43","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Exact reconstruction of sparse signals via nonconvex minimization,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:93b9a282aefc6bba2bd6ce879697e8689e9dfdbaa0c8aeacb568ddcab2b0ceb3","observation_id":"e1469106-3e8f-403d-9331-fa25bcb77cfc","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Sparse regularization via convex analysis,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:de9096f03e226b24b5520bb6344b1ed28775cddc6dca42eec1925f3696a8dcc5","observation_id":"193e56f6-8062-400a-aa52-1b320c98d96f","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"On the convergence of the iterative shrinkage/thresholding algorithm with a weakly convex penalty,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:40057af365e926eee872caf6f0347101f4600bd83a5c0e1b54ca0f153202230c","observation_id":"be866919-e624-4094-857c-9b956682de68","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:900b680400d77e412e59fa82d6ae547ba303e724c88e313e2aa6861dc27c6222","observation_id":"d19525f4-91f7-4d03-bb42-322733484cd0","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Linearly-involved Moreau-enhanced-over-subspace model: Debiased sparse modeling and stable outlier-robust regression,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:ca1aa4127284f68d6f56181ffb75b7b2954ed7ae5961ac13c4320d501e51e7be","observation_id":"9aef21e5-2f39-474c-887f-94b8867bd919","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Linear least-squares algorithms for temporal difference learning,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:41191ac0c0f92a425a8cbdc98b024d0f9ae0e15c6855f1d5b146e6c1635fcd4c","observation_id":"d5d42cb7-0d8a-424e-b48d-f01f444d517b","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"A forward-backward splitting method for monotone inclusions without cocoercivity,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:02f6fe7464baeb93af161eea570af3f6f57cecc964f807bfacbb428cf205fcb3","observation_id":"ebde34af-d410-44c7-ade5-110cb06208c0","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Efficient methods for structured nonconvex-nonconcave min-max optimization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:f77b6b1e4b95663bd30ef8f63be45fa69be04d42cf54d24b92893b65dca68c40","observation_id":"bf79c22e-be22-40f1-baac-cce764a3a7a8","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05071","last_updated":"2024-08-12T23:43:59Z","snapshot_observed_at":"2026-07-06T17:26:59.606509Z","submitted_at":"2024-02-07T18:22:41Z","title":"Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05071","snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Extending the reach of first- order algorithms for nonconvex min-max problems with cohypomono- tonicity,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"cited_paper":"/paper/2402.05071","citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:9bb1c0cbfc127a5f8fe00ff5ed8f8b6fbe002dda4c4078930b8b1968570fc2ff","observation_id":"c6dbe29c-24ea-42e7-bd1e-1c4ee8562172","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Beyond the golden ratio for variational inequality algorithms,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:2bb9ca252466fa2adeaa9c7c49de732837cac08f0ac5960a71069b46a1d6f2d2","observation_id":"8f526370-a146-4b2f-8acc-2f972e7b064b","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.12247","last_updated":"2023-06-19T09:33:19Z","snapshot_observed_at":"2026-08-07T15:05:39.118797Z","submitted_at":"2022-01-28T17:01:26Z","title":"Solving Nonconvex-Nonconcave Min-Max Problems exhibiting Weak Minty Solutions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.12247","snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Solving nonconvex-nonconcave min-max problems exhibit- ing weak minty solutions,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"cited_paper":"/paper/2201.12247","citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:d636204d303c3ace7ea233ee77f79d1e5b22237f2c9a049c73e7fba82e949e09","observation_id":"c6d0af85-f1aa-4441-b8b0-731f6402b94a","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"On the convergence properties of non- euclidean extragradient methods for variational inequalities with gen- eralized monotone operators,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:0b731614e114889a086feae1da4a6e5f20507ccc3f44bee09abf6c77e5c69b9a","observation_id":"17f2407b-f3d0-4573-8481-fafbbaf1645e","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Douglas-rachford algorithm for nonmonotone multioperator inclusion problems,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:603df4514e579cd8fdbd1c462fd6ec3faa22d720f0f5603df89a78a90da597c7","observation_id":"c1fbd0be-909e-4fae-bf4b-b5d80d937c6a","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Convergence of the preconditioned proximal point method and douglas–rachford splitting in the absence of monotonicity,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:c3bfe61030afbf15769265b0fa26a149c6560f05bf839061d50a5e0687849354","observation_id":"519adcb5-ab8b-42e7-a164-ce3a43ff9023","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Variance-reduced forward-reflected-backward splitting methods for nonmonotone generalized equations,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:0e4fccfd97294180b023a188e0b457bd118ed37e24d4f1072b96328be8d9fb2d","observation_id":"4f87b3af-c864-42e9-941c-d0f68f331da3","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.08432","last_updated":"2025-03-11T13:47:43Z","snapshot_observed_at":"2026-08-07T17:12:58.314529Z","submitted_at":"2025-03-11T13:47:43Z","title":"A forward-reflected-anchored-backward splitting algorithm with double inertial effects for solving non-monotone inclusion problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.08432","snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"A forward-reflected-anchored-backward splitting algo- rithm with double inertial effects for solving non-monotone inclusion problems,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"cited_paper":"/paper/2503.08432","citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:b385836dcab850b4e1d593b3b8f23a14f7a133bb81f422a31b8b1897d29c5d90","observation_id":"fada5a93-250f-4b36-86c5-e28aefe29966","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Nonconvex regularization for feature selection in reinforcement learning,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:5c53a94b169d827f04228406af7312ffa02c8dc1d1e37d63e1994d5095f3105d","observation_id":"f1010a27-3466-4941-8695-03d284728d09","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:529298fdbe750e5079b5c37c6d1cf72b2ba1aae28aa5cdf977a33225030309d4","observation_id":"89730bf8-708a-41e9-bca4-c17890a2a6a4","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Convergence results for some temporal difference methods based on least squares,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:05ff8e64b68a46883160dc2d36ecba1c1bb8b891cd9661b8090898df58b6df3c","observation_id":"77dc97dc-0284-44d4-9c9a-05f4b91c158d","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Monotone Lipschitz-gradient denoiser: Explainability of operator regularization approaches free from Lipschitz constant control,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:e36eba5675eac5123a8862b896a0157bb582030e2f9616928f4bca04523e7f2f","observation_id":"7e58aa71-363e-4e0c-afa3-68bf2e14c879","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"D ´ecomposition orthogonale d’un espace Hilbertien selon deux c ˆones mutuellement polaires,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:e37fda83c7fac2c201f026208f92c0bc10fed39de25ff7c5ebb8041d7ae45fb4","observation_id":"55133ea6-40db-4489-907a-d7d19b3c0f46","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Fonctions convexes duales et points proximaux dans un espace Hilbertien,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:4e0246dda63a4c6aca5dd75f60590d578ca178773263f71d442ea3e5c43dffe4","observation_id":"6113f3b0-359c-4ef6-8dee-2be62376a5f9","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:60fbf21deaea3ebe45a1fe5df22627cd712c70e0bb4852c81871024e3407941d","observation_id":"71063841-5f43-4f0b-b8e3-01c5764cdcec","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Generalized monotone operators and their averaged resolvents,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:a58b6ee029d16306e79793856d658cab896d72fccfc1f4fa7f66a3aeaab4eda8","observation_id":"7d633af3-a376-4ded-a118-799290893946","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:5445109af95530b9c2abefd78d1f2e2001f6d5a4c407f93d64b02e376da8651e","observation_id":"3afe5d70-460a-4d5d-b2cb-b306c1d49a98","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Mercier,Lectures on Topics in Finite Element Solution of Elliptic Problems","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:f2400902aa45e14e59db436beb36e708356ee22d993537ebeee9607d1fc59c83","observation_id":"5e0f24c4-16b1-4c1c-8669-8060d73e81eb","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Solving monotone inclusions via compositions of nonexpansive averaged operators,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:3686dbe64140c9f30d2e522717b885ba9ac9bd200dc2bbcccfdbe7cdda631c7e","observation_id":"52f8685f-1135-404f-8a4b-9862572f88dc","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Splitting algorithms for the sum of two nonlinear operators,","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:5492287daad49b26399b6c16b632ee3402d59c9dc7e5d7c11c147ee99e944c7f","observation_id":"f59554f0-69ae-4a9d-a9fa-134217785039","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone oper- ators,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:5a8d050b3a1d2e76fb59bb59e9fc6f11eda5fcecc4e50d906ba3db18a2c0a129","observation_id":"727be80b-6da1-43bc-a211-4618065e689e","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:40fd800caa0e20177aa75ee8bb440b8832043f518b92bd9e5b3c547ef2e81c1a","observation_id":"8b36fcb9-5a01-4d21-a640-f952e8697ae4","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Rockafellar and R","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:04f301dd810ab2ddb8466eccd7ff8c5b8c6f5cebb986fe2845740a5e8b1d84cd","observation_id":"48bab1d0-a5d7-468a-8464-a8f0800e8573","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:03308e1671612435d2e709a881ad638b98cd531860417562f16eaddcf2074b2c","observation_id":"97345b5c-cfab-4db7-90dc-d12957253c93","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"A method for finding the zeros of polynomi- als using a companion matrix,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:73821a70764203a89f619695e1b63787984dbf9fd6b517becbb1f485b5c65158","observation_id":"d0ec210f-838c-40a9-bc76-044ff987bc20","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Nonparametric Bellman mappings for reinforcement learning: Application to robust adaptive filtering,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:6abbc84c78d0f398c32a57148cb1991790acd8fe63753918ab6189ac8ec97b94","observation_id":"d3f9f99e-0797-430d-8aa1-7321bf9ba48d","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Finite- sample analysis of Lasso-TD,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:25122a7ef7589a49328f02c8bde14a24a7824a72002b1400deb2d6f27b7eeb8c","observation_id":"aec54d5a-e6bc-4163-8919-dc037dff6d05","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:1f1047bb0dc18baae8f706e8edabba497f3481f94be472cdca12e2ee9bbac062","observation_id":"6df1a1b3-930f-4756-aabf-464166546dba","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:e23ce25ec944267c07f964e0af529f6b31115ff7453195c710d383bd1f85150a","observation_id":"ccedb484-197a-44e0-a7a0-06ff6dcb3bf1","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T10:27:13.896754Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-11T10:27:13.896754Z"},"links":{"citing_paper":"/paper/2607.04990"},"observation_digest":"sha256:a60772ebda664eda21026de082d625792b28b3ebef4ab0fb4032ae2bcb13f23b","observation_id":"f79e714b-0d72-470b-9559-93487d46e17a","resolution":{"observed_at":"2026-07-11T10:27:13.896754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04990","last_updated":"2026-07-07T05:16:42Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T04:46:39.653134Z","submitted_at":"2026-07-06T12:25:47Z","title":"Non-Convex Sparse Reinforcement Learning via Non-Monotone Inclusions"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":57,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":57},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2607.04990."}