{"as_of":"2026-08-21T10:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97439004ea19ab5d310c00c2d4442b9c55786d4aa7540062b1f133fe63c4bbc0","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:11:25.886360Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"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/2411.12019/citation-record","integrity":"/paper/2411.12019/integrity","json":"/paper/2411.12019/citation-record.json","paper":"/paper/2411.12019"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:11:26.527834Z","title":"Taming the monster: A fast and simple algorithm for contextual bandits","venue":null,"work_id":"2357bbf0-6b50-471d-b5dd-bd2e85ddc747","year":2014},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.761542Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:bb7e001fe96eb5f0b08b69f909f8db82482e04e651f3ec56eb39c0aa6b196e12","observation_id":"4cad7e06-13a3-4ace-b18c-94f27668089c","resolution":{"observed_at":"2026-08-12T18:11:26.533555Z","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-12T18:11:26.511774Z","title":"A framework for transforming specifications in reinforcement learning","venue":null,"work_id":"532d0850-0d34-4213-93b0-5738a1020223","year":2022},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.767066Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:72319496d206e3c47185f32fe82dc6f53df20d4d76e636105afdced6da144658","observation_id":"da52408f-d55b-4d75-9d60-afb0ef2589e6","resolution":{"observed_at":"2026-08-12T18:11:26.517076Z","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.7551/mitpress/7503.003.0011","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:11:25.946215Z","title":"and Ortner, R","venue":null,"work_id":"20e55f07-7b62-4783-9579-805ce70ee30d","year":2007},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.772701Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:73fadfbaef6f5759ff5d6552ebb079a613e9633a1dd7cd35c0069a1173e1aeee","observation_id":"e899ab06-7803-4a8a-a303-72ab7be227ac","resolution":{"observed_at":"2026-08-12T18:11:25.952024Z","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-12T18:11:25.777975Z","title":"Near-optimal regret bounds for reinforcement learning","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.777975Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:6750265d4070910bc9eb44a9c6c86039aebbfa4b4861e1e78bf6cfc1e94cb773","observation_id":"fb5b4e90-dddf-4011-bd73-d4a6084438ae","resolution":{"observed_at":"2026-08-12T18:11:25.777975Z","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-12T18:11:26.486221Z","title":"and Katoen, J.-P","venue":null,"work_id":"12f57886-e283-46c7-a2ba-f11db1557a40","year":2008},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.784145Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:3efba436fca1550fd6bb870a0670c217ca5fe2e47ce375d9b03e3711e1243216","observation_id":"63c5d959-556a-47f2-a1cd-5b55709f6a8a","resolution":{"observed_at":"2026-08-12T18:11:26.491168Z","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-12T18:11:25.789695Z","title":"K., Wang, Y., Zavlanos, M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.789695Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:3c71ee4c4727e3ea5adf6ae381cae13ed661c73fef4035ffedb97675f8210c6c","observation_id":"4de79363-ee82-4854-87d8-b782ef3112fa","resolution":{"observed_at":"2026-08-12T18:11:25.789695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.06797","last_updated":"2021-10-05T16:01:44Z","snapshot_observed_at":"2026-08-21T07:23:16.149993Z","submitted_at":"2020-10-14T03:49:16Z","title":"Reinforcement Learning Based Temporal Logic Control with Maximum Probabilistic Satisfaction","version":5},"cited_work":{"arxiv_id":"2010.06797","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.06797","snapshot_observed_at":"2026-08-12T18:11:26.198255Z","title":"Reinforcement Learning Based Temporal Logic Control with Maximum Probabilistic Satisfaction","venue":"cs.FL","work_id":"6a246745-edf2-46d3-b41f-210400c93591","year":2020},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.795258Z"},"links":{"cited_paper":"/paper/2010.06797","citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:9dc1a67587408a5821826a59a3dfc5face1ab77549a45c4c268ccdc9d0a02929","observation_id":"6139fdcf-c5c9-4ce8-a059-02feb2e107b1","resolution":{"observed_at":"2026-08-12T18:11:26.205122Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:11:26.471838Z","title":"T., Klassen, T","venue":null,"work_id":"7ebb4349-0c3c-4e41-8798-7bd03e8555c2","year":2019},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.800797Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:eda1fdf000af4a532af88a22880e4848b9f3ff9dbd05a851c94d36cfb5766bfc","observation_id":"b05bbb49-67ca-4002-b59b-c6e1f334fc9b","resolution":{"observed_at":"2026-08-12T18:11:26.476306Z","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-12T18:11:26.455470Z","title":"Unifying pac and regret: uniform pac bounds for episodic reinforcement learning","venue":null,"work_id":"5b6bdcaa-1294-4b13-a72e-b972caff7306","year":2017},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.805574Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:63e76332114d9fb998fc7e34fa1f24b47a8d0bac285d4d8c9944e456ef03c715","observation_id":"6d944c74-5ed1-4e35-8d2e-3e5569344d25","resolution":{"observed_at":"2026-08-12T18:11:26.460622Z","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-12T18:11:26.439896Z","title":"Near optimal exploration-exploitation in non-communicating markov decision processes","venue":null,"work_id":"5eb1b59e-331c-4fb2-a730-8fe04e65b36b","year":2018},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.810446Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:d9ee8aa172c1ca780142a6739a3b3a2f075d323d17e4f15d836cb171ff96e07b","observation_id":"1155769f-eb4c-4f58-a495-5a424e48f6bd","resolution":{"observed_at":"2026-08-12T18:11:26.445302Z","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-12T18:11:26.424641Z","title":"and Topcu, U","venue":null,"work_id":"7cab7cb5-3f7a-44ed-b890-851a6d58ba24","year":2014},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.815127Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:d81205621f9d8b42a7c208a7656a53ec187bf2baadb870f48e28a54c16b6683d","observation_id":"6aa1f8f0-d39b-4713-939c-249189c38b2d","resolution":{"observed_at":"2026-08-12T18:11:26.429299Z","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.1007/978-3-030-17462-0_27","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., and Wojtczak, D","venue":"Lecture notes in computer science","work_id":"9c7f2d31-b4b0-43db-8bec-d33ee425e815","year":2019},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.820694Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:82ed83f33793d481df715da68e7261e6771d5f63b2371c10d4a15019c94ff2d1","observation_id":"42252b34-5c24-49e8-b1dd-3bfb3883f655","resolution":{"observed_at":"2026-08-12T18:11:26.413468Z","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-12T18:11:25.825480Z","title":"J., and Lee, I","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.825480Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:16500d18fe0d6559085ee647a17efdc26e41f14af4d04b4680849df12377cd6d","observation_id":"bebd1680-326a-4ff1-a77e-af272783b83f","resolution":{"observed_at":"2026-08-12T18:11:25.825480Z","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-12T18:11:26.393243Z","title":"T., Klassen, T","venue":null,"work_id":"40cbe7e2-a5d9-4321-acea-1402225dac9c","year":2018},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.830789Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:62e043a3a06e75772d5cc4ceaeb71c68f0abff93beb0864baac79cd7a99d5baa","observation_id":"efc71101-f444-4b4f-9003-c4f5cf53e9ef","resolution":{"observed_at":"2026-08-12T18:11:26.397995Z","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-12T18:11:26.376762Z","title":"Translating omega-regular specifications to average objectives for model-free reinforcement learning","venue":null,"work_id":"31b22d7e-f868-40ed-b60c-a0e0fbe17a70","year":2022},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.835472Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:dd13340cde104a09e31086c2104c35fa8ae4f59a342d45437627be487ac00632","observation_id":"cadc9e27-df50-484e-ad2e-41353dbe1603","resolution":{"observed_at":"2026-08-12T18:11:26.382115Z","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-12T18:11:26.359362Z","title":"and Singh, S","venue":null,"work_id":"e193cc8f-8a43-4b2c-8a0f-cb149e906fc4","year":2002},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.840437Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:1fbc569e99b69190bff63c15dcd93bb9165dd1dd4c336bed4f05c49e39ed0075","observation_id":"6670a22c-6667-4438-a6b8-2457e1178519","resolution":{"observed_at":"2026-08-12T18:11:26.364212Z","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-12T18:11:25.846083Z","title":"and Ramaswami, V","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.846083Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:df305d819bf441319c790775d403566d2aa6b13d1342a887d81592df0c2b6edd","observation_id":"57902834-09b8-49a1-8d3d-e1cee0d0eb12","resolution":{"observed_at":"2026-08-12T18:11:25.846083Z","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-12T18:11:25.851437Z","title":"Reinforcement learning of control policy for linear temporal logic specifications using limit-deterministic generalized büchi automata","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.851437Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:ff8a9369ad14f1a5a08ccd7e73492ab3fedcff3eb957231ce7d5dbf8b845f0c6","observation_id":"95d9b663-84ad-4d35-a472-163b96dfbd24","resolution":{"observed_at":"2026-08-12T18:11:25.851437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12248","last_updated":"2024-02-21T01:43:56Z","snapshot_observed_at":"2026-08-16T14:50:56.716470Z","submitted_at":"2023-10-18T18:33:41Z","title":"A PAC Learning Algorithm for LTL and Omega-regular Objectives in MDPs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12248","snapshot_observed_at":"2026-08-12T18:11:25.856184Z","title":"A PAC learning algorithm for LTL and omega-regular objectives in mdps","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.856184Z"},"links":{"cited_paper":"/paper/2310.12248","citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:dcc0dbb2e1440e9b66147ef9ab22bb2135ace92456d81dc5cad8d3a084510670","observation_id":"733ff85b-7484-427e-b19e-699b21e122d5","resolution":{"observed_at":"2026-08-12T18:11:25.856184Z","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-12T18:11:26.342244Z","title":"Near-optimal regret bounds for stochastic shortest path","venue":null,"work_id":"1c476c26-b26f-490f-90cd-f2b9eaad8728","year":2020},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.861629Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:79acd40fa511603f8a3ca739efc86b8874a073d76aaac5232c6ab0eb5d4464d1","observation_id":"5d10f045-77f6-4e8d-82cb-bb1f7f8555ba","resolution":{"observed_at":"2026-08-12T18:11:26.348014Z","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-12T18:11:26.323530Z","title":"Limit-deterministic b \\\"u chi automata for linear temporal logic","venue":null,"work_id":"b510dd85-c02e-47be-a43d-f8cea2af8d3b","year":2016},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.866403Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:999943598d9d9fad504a62bd47ce73c229936766059b393124bc6261694b45a8","observation_id":"2d4dec8b-8d72-4ec2-8884-5879b854497f","resolution":{"observed_at":"2026-08-12T18:11:26.330019Z","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-12T18:11:25.871468Z","title":"M., and Seeger, M","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.871468Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:3085a76a93454c3f497c22e27b0f10f1b84d2d3317b460bb87b3269be06e123c","observation_id":"4f887869-2688-4c89-ad55-3d5cef78800c","resolution":{"observed_at":"2026-08-12T18:11:25.871468Z","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-12T18:11:26.306880Z","title":"No-regret exploration in goal-oriented reinforcement learning","venue":null,"work_id":"a735e2b7-a8c4-4956-9651-94146d6c3c63","year":2020},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.876502Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:ce63334902ed542cbbf82580bb5956ccdccc16e9fcebcfd8a99af49cbbb486c5","observation_id":"7522be17-1a13-4a62-8c95-2b26d4956095","resolution":{"observed_at":"2026-08-12T18:11:26.311916Z","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-12T18:11:26.290488Z","title":"M., Chaudhuri, S., and Yue, Y","venue":null,"work_id":"1bfc62e9-3a9b-4297-bc53-f0b17e7fe2e7","year":2022},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.881593Z"},"links":{"citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:d7ea3e4c439ca6e8f01f8aab681893068d6505ef75fbdcc038767cd297304d99","observation_id":"f883008f-9eef-47d2-9a33-b409923e5db3","resolution":{"observed_at":"2026-08-12T18:11:26.295449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.12679","last_updated":"2022-06-24T20:56:30Z","snapshot_observed_at":"2026-08-18T14:31:38.659009Z","submitted_at":"2021-11-24T18:26:13Z","title":"On the (In)Tractability of Reinforcement Learning for LTL Objectives","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.12679","snapshot_observed_at":"2026-08-12T18:11:25.886360Z","title":"On the (in) tractability of reinforcement learning for ltl objectives","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T18:11:25.886360Z"},"links":{"cited_paper":"/paper/2111.12679","citing_paper":"/paper/2411.12019"},"observation_digest":"sha256:f3707cf862d36f08511600e191e2478d8f6a890f561ac2fb16def393c7337168","observation_id":"6bdf0035-79a6-41a9-bf40-e429d7676c33","resolution":{"observed_at":"2026-08-12T18:11:25.886360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.12019","last_updated":"2025-06-06T14:51:04Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-21T06:38:38.515698Z","submitted_at":"2024-11-18T20:01:45Z","title":"Regret-Free Reinforcement Learning for LTL Specifications"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":3,"verified_fuzzy":14},"total_outbound_references":25},"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 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2411.12019."}