{"as_of":"2026-08-09T08:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fe4ae3c00cf3ed162fca07f20a17cb751f1e2473bc859d3e9074f7fe23b3bd01","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-09T06:31:02.800959+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-08T11:36:10.552164Z","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:484371fa3ec6ff444460bc7672ec63c33aba63a59e865e4aa06f4ddbd630ed3a","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-08T11:36:10.552164Z","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:fe2d49c2aa4d1ed6dd7000509e677eedb71f562e798539852211f8fefea578de","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":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.856353Z","title":null,"venue":null,"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-08T11:36:10.552164Z","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:af87f19eac55de27237bdc604542e235129a15c7ee904f0abd0b889dbced79ec","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:a46bdfefcb0956d1ed2a15f583f225102aeb2986d335b2286b38d50113258f73","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/icaps.v29i1.3528","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.845361Z","title":"Bhatia, P","venue":null,"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-08T11:36:10.552164Z","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:5a624bba65f4e3e92d737d1ae19631acaaf91b4c0331389f620042e87b638dbc","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.834535Z","title":null,"venue":null,"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-08T11:36:10.552164Z","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:1381d13d4d3ceca952fdc009128c98f5862b1aecfc338aa493e71936bc6c4c25","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.822654Z","title":null,"venue":null,"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-08T11:36:10.552164Z","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:f35455244d0744e7fce60d7508bb100360e832e4c7f658b4e08942d9ca332cf5","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:8f3fffcc0562f20388eda08bf00959a1e47016a3892fc96f74b891b86ab32e4d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:adf6d8f4f64d635d2a1aca36c6ee30d86cdf70efa9b1285fc84453c3351ad9ed","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:06dae76cd4ad96e6d8cf6537b6fb813d507928a73d878a8d4c8176f26ab98e0d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:bb20039a4a64c3e5b76d94819eff80b96ca3f4ad6524b028e60f71c858bdfa5f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:a28192fd1d85ea04c3d394b4cbbd84d25a1bf118f20a9c4eb28989ad32c46aea","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:14d3c334ee9a851b92d3de45dbcd41f89aabc7e6335d36cd7aa2e55d644fec05","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-08T11:36:10.552164Z","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:99ecc9a59d46624267f36b0e9b010029ec1da20c23ffd209d1fa538e75f413cc","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:77711c0fd64012c2aaf7b01b7f1cd89aca044805225db6c3edf235ebfba13eb6","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-08T11:36:10.552164Z","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:f47e7d084e0df0958494ebe5c8fd770da43118e57e9ac42b0fe0951bfc923470","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:3d4f732d5def4979cfd06a01346c3c90e0b483280477223e8f1d0f4ab901d2d1","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.793292Z","title":null,"venue":null,"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-08T11:36:10.552164Z","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:a4057e7d2bda97f09d0d18d72626cf4bcb5a838c9263d89da6e25a52563312c2","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T09:15:33.903637Z","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-08T11:36:10.552164Z","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:76aa4cc25b2f91eb8b4ef8d9befe48395fa786a22b0005d554881d537fd20cfe","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-08T11:36:10.552164Z","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:0924f1bf4e3f1d38678e04ff946e7ebdef64676430fe4b4b7dfec3c7c55e724c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:cae75c5b60b258a7b7ffaac55ddfc69b9f26d4c095b07fd2bbbd2e89ffb907ec","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-08T11:36:10.552164Z","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:40f46418bd9eaac9ade427fab043891eb2859cf0c38a49b407cc3573a48a354d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:427e05e55bdda9b0b087c735de8f62aa2855c45dfeca237fda4334c8fc3d6adf","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-08T11:36:10.552164Z","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:2d8cb8db57ab19f4dae0334b651c9556fdb5ec52c74c6754a23fd77368efd1a6","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:9920cff48e2bead5cc378520682c1f494d40db812f5bbd54859048ba820c37cc","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-03T20:15:43.364817Z","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-08T11:36:10.552164Z","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:eaecc092b59a589beacdcc602e9518b5d3a7abaaf4587e1605f7bc77917f0db4","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2019/775","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.772942Z","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-08T11:36:10.552164Z","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:d55142dfebde94522f08246576e0cbd69485d70622fd765a0f86638916b7fc54","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:2bb2d64967d4d3dd831371e47a0828d7ce0a23ab8ce7dabf5e8260e146696143","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:cffdf96644c5e51ffeb80a83919b67a512c1290dc19dc988ee03ca407f7bb23a","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-08T11:36:10.552164Z","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:b03d23d10084e2307a00c2124c3ad068db1a5864a7fdfd81d28ce320d4635d6c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:d87fed861479aff432ec64a5668c9c5ae4407d9be44dddc7a714ac54a235ea4f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:dfb1b6246f849992e9f4dfef741f24b6d368b4c834f639b6389714eb2b4f9d1a","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:a69f6bc405f1d646ee0c3a51929755df0d146977c689b2a45cc31de7aec04b48","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:fe2775c6966280feb3a6eab21060e8f481d4b8298fe4150c5cade4505afead15","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:1fca1dcd606b01e9eeb557f7ec452625fcd246be67ee31920112344fa88c766a","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:26f46b9b5da65accd27e5b4ee0fc616fc26647c4b3cd6b3eb3da19284cb377d8","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:1c88e6ffb54719dc117ffbbebdb1e6d8a5db301bbba98700cf8272e3ecf88a30","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:bf30e88e5ce0d458f6d08eae44601bc5aa4509cf39875dce90f9b4610be33088","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-08T11:36:10.552164Z","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:1f6e08d3cafcf01ee4a819f96f029779c0c6268306479c9e1b969175ddf853d7","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:339cc340d4791171713e05aa6334ad8220d9f8500d1d35764871b08be7091454","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:8bbc0f2b8449adb32ef999db91ab916b568122f659d7ba66aff04c28ee8c9621","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:40ce69a940b01ec520dfaf07f7277e883a4117132e43b844bb71cb8fd490d641","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-08T11:36:10.552164Z","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:4abd4fd8bdfeaa43269f28375247ffff4eba53221ae350748c98ad52d1a53f68","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:f062f5477290562a3d053930cd3f6f98254f18cca7ee2acb0e5c66df28de8660","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v33i01.33013387","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T11:45:35.810930Z","title":"URLhttps://ojs.aaai.org/index.php/ AAAI/article/view/4213","venue":null,"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-08T11:36:10.552164Z","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:f8e6742ea77948b71b900d56da3e7cad8e4852b41b19cf41bc13558e6a9936b6","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:d6333f69978036378e0defc2141c17a9a10a565d59b056477d7704251ad15056","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-08T11:36:10.552164Z","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:64bf80f3320e4e6f6a7aa0d6e9c08b14b9998518fba856aab15c828c09aa32ff","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-06T19:42:42.901684Z","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-08T11:36:10.552164Z","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:02b9940c4089fbfef4b26c12cdc30afdecbb44945cd236067df24f7f274e3f0d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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:acb3979a639b3161da463dd80fff6115133125ad2575da6f1313f3e457560766","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T11:36:10.552164Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2502.07764."}