{"as_of":"2026-08-21T22:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d839f8bc23aedffbfee60387137ec7c89f7c674880f81c5740546d8052cbb938","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T11:45:35.736879Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2502.07764/citation-record","integrity":"/paper/2502.07764/integrity","json":"/paper/2502.07764/citation-record.json","paper":"/paper/2502.07764"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.552771Z","title":"Alshiekh, R","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.552771Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:004bcfa49786f50fa01c8a5042de9751b694522d9e0659af23da80e0b4b191ae","observation_id":"eab1be12-8018-4175-b117-6911b6acfe38","resolution":{"observed_at":"2026-08-08T11:45:35.552771Z","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-08-08T11:45:35.557278Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.557278Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:0c76558af61ae9288ea312684c8409f59d4f7a52b5c6234181cd31c82e2f2a08","observation_id":"9ba37d1e-dd7f-4c0f-85a2-33b89a81b768","resolution":{"observed_at":"2026-08-08T11:45:35.557278Z","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":"10.1609/aaai.v37i6.25826","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"4ca1f1ba-589f-4287-9bde-c682d1fbf669","year":2023},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.561232Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:73cb2158b74d677cae4637b31baf0684a63aaac13bd5cc50301b8aba6eb85f23","observation_id":"e55d0d40-5612-48e9-80c6-268f38ecb0cd","resolution":{"observed_at":"2026-08-08T11:45:35.859943Z","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-08T11:45:36.809645Z","title":"Berkenkamp, M","venue":null,"work_id":"859a732e-7464-44c4-8b49-a2bcfa02c4ce","year":null},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.565362Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:76f1baeb8395cfd875654c666b523dc7a5ab5dfcd7e71177609fb2d604b84837","observation_id":"f21d38ab-d347-42df-a252-e55c75760292","resolution":{"observed_at":"2026-08-08T11:45:36.812784Z","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/icaps.v29i1.3528","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Bhatia, P","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","work_id":"ce5dfc0a-8dce-4797-8d33-eba927ac31d0","year":2021},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.572996Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:254dcf3f26005bb0e7a7d9b001a7e0318e88efd821fc7a148d203d58d484f3f0","observation_id":"70c68c8e-4598-4bbf-b06a-a1fda067008e","resolution":{"observed_at":"2026-08-08T11:45:35.849479Z","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":"10.1016/j.sysconle.2004.08.007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Systems & Control Letters","work_id":"14b794b0-bb7e-46a9-a740-d1eb1a2ce7e3","year":2005},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.577120Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:52ed24da266dea9c9a3d3e26843072ccbf4de4490c091382e65e22d0b11ad216","observation_id":"30f08ff0-c1de-41ae-a497-3789d65b616b","resolution":{"observed_at":"2026-08-08T11:45:35.838203Z","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":"10.1007/s10994-022-06201-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":null,"venue":"Machine Learning","work_id":"ebb32ae8-a556-400c-ab82-908ace0a2b2e","year":2022},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.581397Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:06b3970ab91fd4d2ad1054828e944a32d9c49c26f744e6d95924604789609a83","observation_id":"adfe9afb-f0e3-469d-aa7f-5223d33b5848","resolution":{"observed_at":"2026-08-08T11:45:35.826865Z","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-08T11:45:36.790825Z","title":"Brantley, M","venue":null,"work_id":"a7ca215e-c469-4db5-8d87-65b3c76a20aa","year":2020},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.585064Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:a0385bdd98b473f40955ff5e3a2747a1670d3d11992c2a121405bfa89c2bf640","observation_id":"730eab3d-7ce8-46a8-8534-770a6a6930d1","resolution":{"observed_at":"2026-08-08T11:45:36.794043Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.781689Z","title":"Castellano, H","venue":null,"work_id":"25659497-013e-4a18-a3df-e60a3ebd81ee","year":2022},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.588783Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:bdb4a078e4fc533748bd9fca62711013fa345bac66054a93444378c80f40db42","observation_id":"bb09f6eb-3ef9-422a-a784-361ec8ba8c6a","resolution":{"observed_at":"2026-08-08T11:45:36.784936Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.772075Z","title":"Cheng, G","venue":null,"work_id":"c4c2476d-e11d-4fd7-a2a3-900aa8d8ea8e","year":null},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.592742Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:97488b4f5a8b78b7e20fb5f804a0ed039fc1cb70a2870d5f6d11264b0eed350c","observation_id":"561eb152-af0a-4c9c-ab13-4be523b1b285","resolution":{"observed_at":"2026-08-08T11:45:36.775488Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.762550Z","title":null,"venue":null,"work_id":"fa95d3b0-a465-4af9-810e-b68c3a4e4bfd","year":2019},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.600730Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:ca8a468db10bcc4c219e8c60808800634ab0983f34444bab1444bd59918fb9dc","observation_id":"b2c7fece-6343-4adb-b981-0e086a27de95","resolution":{"observed_at":"2026-08-08T11:45:36.765430Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08T11:45:36.753659Z","title":null,"venue":null,"work_id":"1ea15288-6376-480c-ad81-485f6cb81ecf","year":null},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.604210Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:f6d85ffb2a2e826d858f3d6a7135c212f8c8b4330cc08eacb900e1379546edd3","observation_id":"4e9e09ca-d151-4b4e-b5c0-d6b889544060","resolution":{"observed_at":"2026-08-08T11:45:36.756745Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.611301Z","title":"Coronato, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.611301Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:7ad266f4319929e97ef9137668743c84382512aa6726f7b6d424f670feaa3350","observation_id":"7e86caf6-b3f4-4cb1-ba84-417414ed3ca7","resolution":{"observed_at":"2026-08-08T11:45:35.611301Z","resolver_source":null,"status":"malformed_identifier"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.736214Z","title":null,"venue":null,"work_id":"bea16415-6d58-439c-87b9-2d21c2fa433d","year":2021},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.614743Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:33d71156d189a35869285feb81e3943cf908549976efe46e42af3dea263d3ee6","observation_id":"39d1ced3-ba1c-4d4e-b714-94f6f36950fe","resolution":{"observed_at":"2026-08-08T11:45:36.739208Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.621537Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.621537Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:b647a50f3f9d47eac9eac755ffab0a4d18bf76f5825384a281b063dc75158bba","observation_id":"7b5be5e0-f682-4d1b-a83e-59b09ddae56b","resolution":{"observed_at":"2026-08-08T11:45:35.621537Z","resolver_source":null,"status":"malformed_identifier"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.727383Z","title":null,"venue":null,"work_id":"1a76cf7b-62b3-44ce-8efe-211081875ca7","year":null},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.625302Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:5e94ff2fc93b2f53a719c05d9d9e1f7796ec0de75f974bc43cbfe4deae23d3c0","observation_id":"95e1907d-4754-4b79-9779-ad7dabbd5216","resolution":{"observed_at":"2026-08-08T11:45:36.730401Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08T11:45:36.718676Z","title":"García, Fern, and o Fernández","venue":null,"work_id":"7523d6ec-ada7-4eb8-8864-4d4f8415c404","year":2015},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.632577Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:b25b2c468e30cdb5501274a4a287ca4dd4acfcb63844115172907ae35e78cc12","observation_id":"fccfb0c1-edf2-4cc3-ba20-cb47cc3bd913","resolution":{"observed_at":"2026-08-08T11:45:36.721453Z","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ifacol.2020.12.2276","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"IFAC-PapersOnLine","work_id":"6bc7f53b-e88f-4faa-be47-3c808f2676b6","year":2020},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.636630Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:7b161f2e2d44a8fcc7dc921cd68e2d142494ad9b2e0ee3ba7d3475c77183b59b","observation_id":"3f7c5dfd-7769-4ac8-9f79-714fcc911629","resolution":{"observed_at":"2026-08-08T11:45:35.797013Z","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":{"arxiv_id":"2205.10330","last_updated":"2024-05-24T22:33:04Z","snapshot_observed_at":"2026-08-20T13:48:07.834342Z","submitted_at":"2022-05-20T17:42:38Z","title":"A Review of Safe Reinforcement Learning: Methods, Theory and Applications","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.10330","snapshot_observed_at":"2026-08-08T11:45:35.640679Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.640679Z"},"links":{"cited_paper":"/paper/2205.10330","citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:0888dacda2ba03cf2422ee557bbbe3a349b9e6b98e74f4b5902e480892a51990","observation_id":"c7a6292d-cbc7-42ba-a476-38ad1ea73534","resolution":{"observed_at":"2026-08-08T11:45:35.640679Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.710253Z","title":"HasanzadeZonuzy, A","venue":null,"work_id":"0a36c148-be4a-4a05-b845-553c0e66b7ce","year":null},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.644634Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:03483b80be11835115eab5ee3839e4ea7ee3897785a48c1d0fc109256befdcc9","observation_id":"fd5bbb6f-4cd6-4f12-84e9-47bb81d35f58","resolution":{"observed_at":"2026-08-08T11:45:36.713215Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.629126Z","title":"URL https://doi.org/10.1109/ICRA","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.629126Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:bff4386db4626ea97ec153742c073d20737e09310da6399b7f36c7ccaaca17d8","observation_id":"5037cd8c-f5c4-49b3-b309-51ef66af8fdb","resolution":{"observed_at":"2026-08-08T11:45:35.629126Z","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":"stable/2628725","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.357521Z","title":null,"venue":null,"work_id":"9ad00dbf-8ee2-4700-8a23-d8df2616934b","year":1970},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.656270Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:aec4a5575eac8197f6fc391bd5b8ec26e490de14060c4fab9f9da177a8bcb672","observation_id":"be2d668c-0a41-4630-9920-3712aa1210a2","resolution":{"observed_at":"2026-08-08T11:45:36.363011Z","resolver_source":"raw_fallback","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.659818Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.659818Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:0bf57edb264bcff88cef483bddeb554f0d89d31535cd5694824843381dd31a46","observation_id":"e3068a04-62ab-4097-8b1e-deecfc9f125a","resolution":{"observed_at":"2026-08-08T11:45:35.659818Z","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":"2018.28819","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.224128Z","title":null,"venue":null,"work_id":"8b64679d-f182-4293-9be5-91f003a4044e","year":2018},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.663218Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:ac245ea91a1a99c2bff35fb68d768131800ac196d00f8a11ac1c35fe90a11faa","observation_id":"1565ca32-4021-48eb-b012-2df3076d34c1","resolution":{"observed_at":"2026-08-08T11:45:36.229293Z","resolver_source":"raw_fallback","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.667676Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.667676Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:422aed741493714923b82852141d51b81f47f20c7457b0cb71dcf53ce746481a","observation_id":"893dccb1-24de-4c9e-b2c9-495e20226cfa","resolution":{"observed_at":"2026-08-08T11:45:35.667676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14183","last_updated":"2024-10-30T22:58:51Z","snapshot_observed_at":"2026-08-18T08:27:32.452313Z","submitted_at":"2024-05-23T05:27:51Z","title":"Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time","version":2},"cited_work":{"arxiv_id":"2405.14183","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.14183","snapshot_observed_at":"2026-08-08T11:45:36.091036Z","title":"Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time","venue":"cs.LG","work_id":"a4dec072-3f3a-496f-bfae-5ad524b11f1b","year":2024},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.671359Z"},"links":{"cited_paper":"/paper/2405.14183","citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:6bc0267b619b8806d45f62486a8f2d2ddf4af01c244ad169df41990988798441","observation_id":"e08598d7-e897-4fdc-9236-6ab7b1143200","resolution":{"observed_at":"2026-08-08T11:45:36.094985Z","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.24963/ijcai.2019/775","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Khonji, A","venue":null,"work_id":"cc20dbeb-fddf-4eae-902f-5df3ed7a9d4b","year":2019},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.652518Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:a553a881bb01eee31cdcc78def0a45c0970c67c3cb2a7cc2e04ac0c65b5b5211","observation_id":"15bb8e58-6fed-41e8-a6d0-5e6db27277b7","resolution":{"observed_at":"2026-08-08T11:45:35.778329Z","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-08T11:45:36.692359Z","title":"McMahan and X","venue":null,"work_id":"36e36349-14b1-43cd-aab6-f5d51ee81976","year":2024},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.683149Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:24e59587fc3280d5968a16dc4931555b131f72545881723ffaf6002a17a2822b","observation_id":"7af7895d-0fd9-411c-91bf-6278a1b8e1a9","resolution":{"observed_at":"2026-08-08T11:45:36.695342Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.687590Z","title":"Paragliola, A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.687590Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:1ba5c0af86ed3c4755b3e27fc60aeea8f391e38fafd12a061506dceb130500df","observation_id":"d587ea42-2467-4012-968e-edcde24841bf","resolution":{"observed_at":"2026-08-08T11:45:35.687590Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.683174Z","title":"Paternain, L","venue":null,"work_id":"11883d64-1de4-41ca-baaa-9dbe563fd8e1","year":2019},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.691249Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:98d625a929473b7cc6de666599af4f7461e46e0062da6587ff061ef8d2c0d853","observation_id":"87638e6e-c08a-4df1-842c-187420625eef","resolution":{"observed_at":"2026-08-08T11:45:36.686188Z","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":null,"cited_work":{"arxiv_id":"2020.30369","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.997288Z","title":"Peng and X","venue":null,"work_id":"0bde4afd-9920-4ae8-bd4a-387d976aec60","year":2021},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.695167Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:82ee18bf2b0b19f5dad573d36a7faba937d903993f35947f8c4ab42b6c5209c2","observation_id":"6e64f311-e0f2-427f-b825-fc1fb9fbc4bf","resolution":{"observed_at":"2026-08-08T11:45:36.003033Z","resolver_source":"raw_fallback","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-08T11:45:36.673824Z","title":"Roderick, V","venue":null,"work_id":"d685ddfe-88f4-4226-ac12-c00cff4b2b0a","year":2021},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.699031Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:245c0eb39d3e572e8a73cc414c5927e04b249b828671917c60b4047ab9f071e8","observation_id":"049accd0-781f-4be1-833e-3888998892d5","resolution":{"observed_at":"2026-08-08T11:45:36.676649Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.701355Z","title":"McMahan and X","venue":null,"work_id":"5af2327f-bcd4-4370-8e71-c97fd9b127e6","year":null},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.675454Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:5782b6b669d875c942fae3e2e36b921b0df653328226844c391cd34607554a8d","observation_id":"2093c857-6bf5-4203-8fbb-c09faf9d8e7e","resolution":{"observed_at":"2026-08-08T11:45:36.704573Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.645897Z","title":null,"venue":null,"work_id":"93eef635-bc97-4f8f-85f3-a4af84376886","year":2019},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.710014Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:6926cf2fc8092a41c29d11fbe4db46409b21004367d009a6e0bd5417bd2f8615","observation_id":"d6c13d2c-f587-4caa-84cc-5f25f288a49a","resolution":{"observed_at":"2026-08-08T11:45:36.648951Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08T11:45:36.635476Z","title":"Vaswani, L","venue":null,"work_id":"75c6ae30-7030-4a25-a9d6-212696ac5044","year":null},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.713656Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:9aacd9fc6691bfd71229f5fddd0a601ba661f3601dc264aae23adfabedc3fbc2","observation_id":"584875ec-7efd-4ba9-89e8-cc476c9ca027","resolution":{"observed_at":"2026-08-08T11:45:36.638682Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.615801Z","title":null,"venue":null,"work_id":"e91048f2-4f56-42e7-8ed4-588c6133d202","year":2023},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.721611Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:ba5dc1ad49255d692bc9a5f1891160cb58b2f82ea21f1d3e6b54476a1a03f3be","observation_id":"c008dd60-1951-4bc5-9991-d121667ef860","resolution":{"observed_at":"2026-08-08T11:45:36.618805Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08T11:45:36.605873Z","title":null,"venue":null,"work_id":"b147c654-27fe-4acc-a1a0-ca1756536084","year":2022},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.725268Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:3423b1961271edf934d9b947d1256ae9ff28c07e2859906a2f9f272e8d6cdfb2","observation_id":"943ce8b0-28c6-45f7-8605-8638a28b1c72","resolution":{"observed_at":"2026-08-08T11:45:36.609005Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.729326Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.729326Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:511e8fbad9c3872ede40dbf2868e9c53510a6160d848e845b4280b81f6e11bd2","observation_id":"ffa5ba89-be0c-4e29-97b6-bbbec03b54c1","resolution":{"observed_at":"2026-08-08T11:45:35.729326Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.593807Z","title":"Xu and S","venue":null,"work_id":"fe3f5c1d-9ada-4d8e-be4c-01feeba6c3c9","year":2011},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.733174Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:cf0099a9f0453e1600e47751dfa1fa4ebc8db96bd198a681e73041c60fa6b7d9","observation_id":"135b7a33-eeef-46e2-a89c-be9e2a61d0dd","resolution":{"observed_at":"2026-08-08T11:45:36.597233Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.664753Z","title":"Thomas, Y","venue":null,"work_id":"3b020572-ea8c-405f-9ebe-c986ba74d478","year":null},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.702746Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:e037696e9e6778ea76443b418467f5c56496527d5e66bf8761b166b9d90e58e8","observation_id":"7fe4a462-4c24-402b-8afb-233c4bf969f5","resolution":{"observed_at":"2026-08-08T11:45:36.667746Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.655406Z","title":null,"venue":null,"work_id":"5e345eb5-3963-4f11-b5d2-b5761ff4e51a","year":2021},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.706316Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:321d652bc6b743cb178dede22450acc6d14f3ef5037559595864774cd2c6691f","observation_id":"9edbb1fd-b0e6-4968-8091-8cdd9719fd9a","resolution":{"observed_at":"2026-08-08T11:45:36.658664Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.736879Z","title":"Infeasible","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.736879Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:8dc695be0659765d852db7ac87c63abab2d95ffa0ca4a61504b2a1eb75745bfa","observation_id":"33e35dc6-c9aa-4345-a87a-af4fde656f89","resolution":{"observed_at":"2026-08-08T11:45:35.736879Z","resolver_source":null,"status":"malformed_identifier"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.800473Z","title":null,"venue":null,"work_id":"d6a25467-3371-4400-8861-d8127084e55a","year":2017},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.569291Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:d15d488e39075b540b1d1ef413c3aff1d61287b9e2046f1ce4cc22656c19606b","observation_id":"e66f7d68-6b5d-4343-a802-e5cfddd2cf2a","resolution":{"observed_at":"2026-08-08T11:45:36.803484Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08T11:45:36.744840Z","title":null,"venue":null,"work_id":"09f6b878-25a9-4a4a-9d8b-3b00e7deec26","year":2018},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.607799Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:7f452dddacbdb31da47041b121ae563a651c032b65ca8efe1580607955d0f9d2","observation_id":"bbeb7032-507d-4059-978c-131a12341beb","resolution":{"observed_at":"2026-08-08T11:45:36.747660Z","resolver_source":"raw_fallback","status":"unresolved"},"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.1609/aaai.v33i01.33013387","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"URLhttps://ojs.aaai.org/index.php/ AAAI/article/view/4213","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"754f3b8c-101f-44b2-89ba-4d788b5c59a3","year":null},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.596778Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:81418b9144418df70a4d61fe1737193f1ebbcffe8dae6f3bc613a2744cf25e8e","observation_id":"9919fd17-bb1d-431d-806f-c26f345d71d5","resolution":{"observed_at":"2026-08-08T11:45:35.815621Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.648654Z","title":"URL https://ojs.aaai.org/index.php/ AAAI/article/view/16937","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.648654Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:40820793505dd00b2cce08649b94f00e046b3c72f2060361a1c4d05fae844c47","observation_id":"0084868d-1d92-4177-aa48-a1f0bb2ebf12","resolution":{"observed_at":"2026-08-08T11:45:35.648654Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.625351Z","title":null,"venue":null,"work_id":"f1cae31b-805b-4abd-8771-4a65d2a280f9","year":2022},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.717727Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:9c203d3afb4e1652be1c3a827b8cdae06ebeb2ef23fe1814145937ea9fefcbd0","observation_id":"c9755813-844e-404e-9ee4-8d69ddbdbf7f","resolution":{"observed_at":"2026-08-08T11:45:36.629104Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2410.23637","last_updated":"2025-03-04T18:40:33Z","snapshot_observed_at":"2026-08-19T10:12:49.248492Z","submitted_at":"2024-10-31T05:07:01Z","title":"Anytime-Constrained Equilibria in Polynomial Time","version":2},"cited_work":{"arxiv_id":"2410.23637","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.23637","snapshot_observed_at":"2026-08-08T11:45:36.075887Z","title":"Anytime-Constrained Equilibria in Polynomial Time","venue":"cs.LG","work_id":"6b5a0d48-eb8c-4156-a7a5-607790c62cea","year":2024},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.679203Z"},"links":{"cited_paper":"/paper/2410.23637","citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:9c1c9a5caabb0d71a99769f2fe427950b7cbc52028c2540bb4996627880f5d14","observation_id":"c0e657af-8890-4991-8664-e17a2caa7e45","resolution":{"observed_at":"2026-08-08T11:45:36.080155Z","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":"2019.10204","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:36.511527Z","title":"URL https://www","venue":null,"work_id":"862cc6db-4a98-4580-952c-dc1eefaa834f","year":2019},"citing_paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning","version":1},"reference_index":4012,"source":"pdf_text","source_observed_at":"2026-08-08T11:45:35.618241Z"},"links":{"citing_paper":"/paper/2502.07764"},"observation_digest":"sha256:8a5cb254c693d1193e2e5f153e4219888d42a0c8c3e10584071b532035f88712","observation_id":"fd9acdcf-3a37-4c8f-b8ec-add0e49684ec","resolution":{"observed_at":"2026-08-08T11:45:36.520361Z","resolver_source":"raw_fallback","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"}}],"paper":{"arxiv_id":"2502.07764","last_updated":"2025-02-11T18:47:53Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T14:58:50.540723Z","submitted_at":"2025-02-11T18:47:53Z","title":"Polynomial-Time Approximability of Constrained Reinforcement Learning"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":3,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":20,"verified_exact":10,"verified_fuzzy":13},"total_outbound_references":49},"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 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2502.07764."}