{"as_of":"2026-08-06T18:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:842e1e385485f38d3264731637d80a261aa060696db1d9ea7bed6dbee76c3338","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T04:22:37.919106Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2605.10169/citation-record","integrity":"/paper/2605.10169/integrity","json":"/paper/2605.10169/citation-record.json","paper":"/paper/2605.10169"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2021 , doi =","venue":null,"work_id":"45a55931-e27d-45fa-9fad-5e00cc05f525","year":2021},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:4b1c2585f6a2da879d878d390b9d1bf5217ee0fdcf270b3de124a14f8f508bd6","observation_id":"8673e2b2-c9e3-4449-ae9b-595f7b281d16","resolution":{"observed_at":"2026-05-12T15:21:39.643661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2021 , doi =","venue":null,"work_id":"757e2dcf-af54-48cd-90dc-29063d871353","year":2021},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:9b310056f343a06b97009062c3b731a363d5e33ba1c5812edd15fdf11736aec7","observation_id":"4dac4c8d-6fd7-43e6-9f08-a9598ac43e19","resolution":{"observed_at":"2026-05-12T15:21:39.669993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e1e8dd73-8d5d-4e70-b844-dbcd9afd443f","year":2018},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:cdc96bff65fc1154a56ef62a2c0873c95d30978a6f9b63cf9d14eaf12e1a82e7","observation_id":"82924f92-ca59-45de-8be0-4c25db521a53","resolution":{"observed_at":"2026-05-12T15:21:39.640058Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Synthesis of Linear Ranking Functions , booktitle =","venue":null,"work_id":"399eb6a8-2445-4122-96bc-6ae136cdd880","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:46b24a3fb9c40b7f6b4ca62a3e9ac8e58bd798e640d6aff81c8fb50612ffbf01","observation_id":"3a13de99-bddf-4f6a-a44e-004535bfe7e7","resolution":{"observed_at":"2026-05-12T15:21:39.638236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2004 , doi =","venue":null,"work_id":"b1647382-dbc6-4e52-aa1e-bd745d806dcc","year":2004},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:d5ebdfe67a4727a1c38677ced19ee2da492f1858c37246012d331f93f529eb9c","observation_id":"116c5773-6d72-4a03-9ee9-07a52979c66a","resolution":{"observed_at":"2026-05-12T15:21:39.636099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"ATVA , year=","venue":null,"work_id":"6f1425f5-8ff6-4050-8e65-8cf9f5e82e8d","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:e70a2e92e637947135585d5988773ac6fae7b168f1e65421483b24ebd82112dc","observation_id":"b63e9e32-ff83-483b-9947-fc106c7d79bb","resolution":{"observed_at":"2026-05-12T15:21:39.634331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Infinite Games , booktitle =","venue":null,"work_id":"16bafb5a-adcd-40c5-a252-2d0883023f6a","year":2001},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:69df714805c4db0a15d1570e174e5d8a650a18c5d7549205aacd3466b7db8f01","observation_id":"f4f64a75-c579-427c-abe5-49f43e291ef0","resolution":{"observed_at":"2026-05-12T15:21:39.681854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Chandra and Dexter Kozen and Larry J","venue":null,"work_id":"60f7f91c-9732-4b03-8e7a-128c07d86cb3","year":1981},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:8c0bb81b0d99073efdf4d5d6c914cdf7fb386bc647d43b86e8daf60e35f9d612","observation_id":"a6896a22-145c-4072-a5d5-73108e193ce0","resolution":{"observed_at":"2026-05-12T15:21:39.671812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"NeurIPS , year =","venue":null,"work_id":"249ea66e-b649-49ca-940a-02cff0d778fa","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:aee30dfbc1f3409893871951ff50f6ce15aee7086bd5fa398ffeddb74ddcdd43","observation_id":"861b2ce0-2556-4e67-8c11-8b54d6cc6d8a","resolution":{"observed_at":"2026-05-12T15:21:39.630022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"IJCAI , year =","venue":null,"work_id":"00ec3374-c0b5-4b52-929a-7b71e54f8898","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:917e0131df74e97ea0db06f078643ec2190efbd0eee8bcd78d871022e1f0b515","observation_id":"c524e4d1-3e2e-4156-9bcb-2a08cfbadc29","resolution":{"observed_at":"2026-05-12T15:21:39.675355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"AAAI , year=","venue":null,"work_id":"dbe7b633-91c7-4980-bc7b-69cdf0c04a7c","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:304b1cff7c84c760ac5dbcbf25e6475e741aac012cb1f5db45e5788a5a4af530","observation_id":"b37a05b8-1d7c-4462-8ee8-543fc3c059b9","resolution":{"observed_at":"2026-05-12T15:21:39.673460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"AAAI , year=","venue":null,"work_id":"6e4ae394-bef2-46a5-adc4-2982c9af3d9e","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:22ac200646fc172905b0b36683489c66152c6bbfd4a13c794d01dba93c1ac728","observation_id":"6884aa14-acd3-4687-ab7b-e75c4bc0a97b","resolution":{"observed_at":"2026-05-12T15:21:39.668051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems , year=","venue":null,"work_id":"18bcd3bc-079c-4513-a60d-44eaef2af75d","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:861dff44c6782ed45792be0cbe9ba0dcd7af908ee88bb3ddf170225a2f428e15","observation_id":"bffd35a2-ed28-4bed-af22-29c6e444d7e6","resolution":{"observed_at":"2026-05-12T15:21:39.650136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"AAAI , year=","venue":null,"work_id":"4f6a5dd1-6fc0-45e4-a425-6816cafcbb31","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:cecff8753d17543c4f8aa5349c575eb5e6438559c9cccfb24ab3446f2e9ebc2c","observation_id":"5686737a-6ebb-457b-a19a-38d4bc28f6be","resolution":{"observed_at":"2026-05-12T15:21:39.606763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a5e01f29-e9d0-4f72-9c63-ad3ee8b4ff63","year":2024},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:de06d6f6ba19a4f080646eaf8c81ff0f570e0d2db350e31570716660c1d2eabd","observation_id":"364aaf01-ba0e-455a-8d3d-bbec3b8e6531","resolution":{"observed_at":"2026-05-12T15:21:39.594052Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Localized Attractor Computations for Infinite-State Games , booktitle =","venue":null,"work_id":"b09ce7b9-e37a-447f-b3f3-f43696045e6b","year":2024},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:f9bc9a8fdd92430ee902aeb9db162cb161d64e774e8636e2c72a438af9b89deb","observation_id":"a1145e78-4904-41fe-93df-75359347d544","resolution":{"observed_at":"2026-05-12T15:21:39.679101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Beyene and Swarat Chaudhuri and Corneliu Popeea and Andrey Rybalchenko , title =","venue":null,"work_id":"b16310a5-6a1b-4f96-8f5e-4b7c7083671b","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:30f09ab81b5e008dcbf0e39702f00214a08808231c5b652eaaedbe63c02b2b70","observation_id":"c4546ec9-b142-4d67-9371-99c180539189","resolution":{"observed_at":"2026-05-12T15:21:39.660164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"AAAI , year =","venue":null,"work_id":"06a65826-ca30-4f60-ae32-7295f3e7e31e","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:cee0e3caa97068cca773c89853182fae890c5f81df0357b1ffa0c1e625480760","observation_id":"6e744437-1687-48f5-ba01-7404ae069da3","resolution":{"observed_at":"2026-05-12T15:21:39.677276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Henzinger and Orna Kupferman , title =","venue":null,"work_id":"c8e4cd55-ceb7-4c5d-aee1-f5c87e5f14ab","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:e2f094073ae9f7ba8c178b64728c5ccc4e849f484bac66cbaf926e8cdd71d800","observation_id":"efdf2a27-f7b9-435f-b28d-b156391873fc","resolution":{"observed_at":"2026-05-12T15:21:39.652119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Wooldridge , title =","venue":null,"work_id":"5edc16a0-21a8-4b92-95b8-32caec83f852","year":2021},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:5356c63960458044da186e8778677e2a30c0dc01181bc9983af46cc7b06046a8","observation_id":"d776eb71-bac2-4df5-b07a-c852d5ee28f7","resolution":{"observed_at":"2026-05-12T15:21:39.584370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"AAAI , year =","venue":null,"work_id":"fc25ddc2-a897-40a8-b89f-255706939d8b","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:8835c526eb38dd579ef632a383cfa278b0ce1486e1d455be2437eb29d840bc49","observation_id":"2645bab6-876b-487a-ad3f-69d6bb31b438","resolution":{"observed_at":"2026-05-12T15:21:39.661937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"AAAI , year =","venue":null,"work_id":"920b278c-5a15-49fd-a877-f79d442e5622","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:bfa84c1431ca81b0a1af214833f174daacab9a9875741a3bc6a7704505902ebc","observation_id":"d501d69a-fb1b-4238-8a65-a0ed52880818","resolution":{"observed_at":"2026-05-12T15:21:39.586630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e02d057c-c94c-4a32-a5d0-4d47404356b7","year":2014},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:eca939e3698e3ba200e16a98aefe65f09d6cef782278b70a6296d93f2e5c6360","observation_id":"a51f3a5f-4c70-44ed-9060-2cd7cfec58bc","resolution":{"observed_at":"2026-05-12T15:21:39.582068Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Solving Long-run Average Reward Robust MDPs via Stochastic Games , booktitle =","venue":null,"work_id":"42664c19-67b8-4c25-9405-506f90c34853","year":2024},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:bd1b48258ded0a0c46243a719e92f3e07821e5d1ee782daf7f8da38e5780aa33","observation_id":"eb4f16ff-8d9c-48e9-ab99-9855e91cf8a4","resolution":{"observed_at":"2026-05-12T15:21:39.588991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Annals of Mathematics , year=","venue":null,"work_id":"7f0065e4-1be4-4e61-9a28-3b0a511f7554","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:1f1093c9074dbf0e441e2ef915788fc261d7e0b4dc0b8ef6c3a91c018c142f8a","observation_id":"b3ce7834-0bae-4bf9-9f88-ef28d2d36557","resolution":{"observed_at":"2026-05-12T15:21:39.600720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Transactions of the American Mathematical society , year=","venue":null,"work_id":"ce6d29a6-715c-4a02-9218-a8bd61084537","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:7c0f8c8d7921e1423e8b188fc0f69619e42eb8d7c049df5c1de5f9bca7a96bfd","observation_id":"9128de7c-60a6-4080-afe2-43b85c35c5b5","resolution":{"observed_at":"2026-05-12T15:21:39.602610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Henzinger and Peter W","venue":null,"work_id":"91b2e916-8213-4211-9669-d9704d2ef941","year":1995},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:d2e65535e6a866e2f029ab40b1f894579192a5e10c9d43c3a660d1e052165363","observation_id":"e2b14732-7e2c-4695-9f80-3662ed9ecf22","resolution":{"observed_at":"2026-05-12T15:21:39.632480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"1997 , doi =","venue":null,"work_id":"de9e2a07-c3ee-422a-9ec1-870f13dab212","year":1997},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:41db1503396ff38df90f0ff0b81b1c3d86fe7f7ce77bc61adae04d7f7547a903","observation_id":"2ba8e331-28ff-45e9-b437-d7103d9d8186","resolution":{"observed_at":"2026-05-12T15:21:39.683901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Dill , title =","venue":null,"work_id":"3b6430ef-92f6-4346-9c4f-941d9f08fdbb","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:beeaa66ccef77b94095bb55b094acc670ca18ec5f2c3774b728a6dbec51bd716","observation_id":"c23e1413-d606-42ce-9b37-f227fe63d1a4","resolution":{"observed_at":"2026-05-12T15:21:39.686142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9fee705c-c63d-4ca2-8b49-d9fa02cf9aed","year":2012},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:21f9deec00dbe9a0051483445f82d4a5ab710a437b3d7f92fb5043fea675dc8d","observation_id":"97eb703a-89f3-4b68-b9f1-88dde853b150","resolution":{"observed_at":"2026-05-12T15:21:39.690383Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2024 , doi =","venue":null,"work_id":"3df5a1aa-c62b-46a9-bee2-0baf2b250309","year":2024},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:7e23fac7d2bff9382c0bb10d26ee062deebab33355aa7d19b8daa3874506b054","observation_id":"60a01d8c-a3e9-4fd3-aae1-91ea2577cb00","resolution":{"observed_at":"2026-05-12T15:21:39.624097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2021 , doi =","venue":null,"work_id":"55b3b4fd-1eb1-4bd9-892b-919eec046ee3","year":2021},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:e300c5ba543d6b880b5f563c4c7a30c47d7655eab778fd1fd004d22cf6fc0233","observation_id":"e809574e-c3fe-4ab9-b970-3d3825554cb1","resolution":{"observed_at":"2026-05-12T15:21:39.616449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"journal =","venue":null,"work_id":"0cc17961-cf0c-4cee-a5d2-a76c24f3372d","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:a93356f2050174ee933a52316247e81a4741735024822e5d5a840df7a69db451","observation_id":"c4ab03fb-c237-4ee9-8c1b-9f7f795d49de","resolution":{"observed_at":"2026-05-12T15:21:39.618385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Hybrid Systems , year =","venue":null,"work_id":"9d9fc9ac-1193-4b4d-b0ff-09da67ecf2e1","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:a431d3dea91d7e1f036c01511ef4f162c3cc52fca0260c2ae809e6ee6ad2be4d","observation_id":"8d42e2ab-6d73-4508-93f6-2f22b70b33dd","resolution":{"observed_at":"2026-05-12T15:21:39.620205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Henzinger and Orna Kupferman , title =","venue":null,"work_id":"f1e05230-e257-4912-86b9-680a2fc75db9","year":1997},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:9bf1ee1db5073eae1e5b7db1fe85e74f0e28c95bd8d35f95ad8aaaeafd826cc0","observation_id":"bcec3d52-7714-40b7-bc94-8d237fc694de","resolution":{"observed_at":"2026-05-12T15:21:39.622208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2008 , doi =","venue":null,"work_id":"716d8297-0058-4746-8487-40eceabdafbb","year":2008},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:39124406134f25dc1ebe2379d748246b2d96a9b1f663d578fdb629d9769801d2","observation_id":"7155dd9f-9a89-4e6e-95a2-63c2347b9d81","resolution":{"observed_at":"2026-05-12T15:21:39.641798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"TACAS , year =","venue":null,"work_id":"a0b6d1ec-82cd-4e33-b980-a400d3ab1881","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:2d01866ca3c7a11291dd5518fbb12a69b0f3e023397dea7ae9c43f36df5afccf","observation_id":"02f20567-e2df-4431-97ad-db39ecf4a853","resolution":{"observed_at":"2026-05-12T15:21:39.628123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"2006 , doi =","venue":null,"work_id":"1cd4bdbe-30b1-4dda-8ed9-0af6a2c0a3ad","year":2006},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:99e8d224c906311a5aab383e244cc58c743b765a030c09c420bb7c548cbd1f9a","observation_id":"80ac0a18-2ffa-4ef2-9671-0f04953d4e1a","resolution":{"observed_at":"2026-05-12T15:21:39.648025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b0865405-96be-4fd5-82de-bb6c239b3524","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:94b26cf2357d1bd5d7b4e2f90dcbf49fdf6279f4efbc2d1076a776e5b094d834","observation_id":"42e91eab-fcc0-4770-873f-35c946e4d3ce","resolution":{"observed_at":"2026-05-12T15:21:39.591600Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Henzinger and Ranjit Jhala and Rupak Majumdar , title =","venue":null,"work_id":"5891b9c9-3a63-4391-ab68-8dc535f9f828","year":2003},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:2a06106a7fe18ee02c1d1b757b98d92598a9cb877d35f6726d5b6a8dc0470586","observation_id":"5f323703-80e1-42d7-a447-be2d68ba9c4a","resolution":{"observed_at":"2026-05-12T15:21:39.658129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c185e2e5-08b4-47bf-8d2a-67be5adb6dbf","year":2023},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:13b9540cecab2a3b40cb6a9fb0076f9256c0c9680b90a705a23abb3ae33522fe","observation_id":"9188fdd2-2e6d-4312-9632-97d2419864a3","resolution":{"observed_at":"2026-05-12T15:21:39.595964Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Parameterized Synthesis with Safety Properties , booktitle =","venue":null,"work_id":"066b7a3a-1c80-431a-9833-89abbcefce74","year":2020},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:fbe75d9acf3985131089706af8e3f993054a0ccedf6e854f2a07279904451b14","observation_id":"c785e641-3961-44f3-88d0-dde6323b10dc","resolution":{"observed_at":"2026-05-12T15:21:39.608925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Whalen , title =","venue":null,"work_id":"4b4d9fd5-9891-4159-b98c-4d890450d3f8","year":2018},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:8b18c049836b760d888ea1fafd8a8c110da23e20bd34ac2613cfb06915b403ae","observation_id":"e93f46bb-2829-4058-a36e-c7fbf095aeb6","resolution":{"observed_at":"2026-05-12T15:21:39.645950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Journal of symbolic computation , year=","venue":null,"work_id":"bf8c310f-7681-40e9-935e-5d2388bde451","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:265484091415a78a668f41d8991e5f250c814aee2cb81de5d89ddf19a3c87bae","observation_id":"48d27ba9-b96b-479d-8034-8c675bab95fe","resolution":{"observed_at":"2026-05-12T15:21:39.688243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"cee0d2c9-3ada-404e-9cdd-5b9ab7301b9d","year":null},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:320b2f7b2328e55a3be6a3b3d2e0aa7f0a1d2b31dd575a92428b84cc15bc1811","observation_id":"752123f0-fda5-47df-aa5b-bf783833a474","resolution":{"observed_at":"2026-05-12T15:21:39.666169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-05T23:31:35.236970Z","title":"Structure and Interpretation of Computer Programs","venue":null,"work_id":"01a14db6-7d1d-4607-868a-f7393285bd98","year":1985},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:7447206c1e9c4649ea7ed59fa1fe1de9c5251f19e57ab62da80e47f46d698cdc","observation_id":"59d31195-3fab-4472-bdd9-6cc31fdf5570","resolution":{"observed_at":"2026-05-12T15:21:39.611754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-05T23:31:35.219519Z","title":"Visual Information Extraction with Lixto","venue":null,"work_id":"70a0bb1e-35f7-444f-b12d-bd6dcd37cc57","year":2001},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:450de23b8d08599e930b58e2ec0cf4db7ed461a31e4674d5e82c6c69ebc08420","observation_id":"41478002-8b9e-4175-b48b-e5297ce68f36","resolution":{"observed_at":"2026-05-12T15:21:39.614324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-05T23:31:35.229190Z","title":"Brachman and James G","venue":null,"work_id":"0dc6cf5e-34e0-4f51-b711-0498f8e618ec","year":1985},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:ed8307a7ada5c8ca29421c46ed183c2f61ce395456861446a419485ef8997dbd","observation_id":"96fd4c3f-baa4-431f-ad51-e88d127ef580","resolution":{"observed_at":"2026-05-12T15:21:39.598645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-05T23:31:35.170053Z","title":"Complexity results for nonmonotonic logics","venue":null,"work_id":"d0459553-e996-400d-b3ca-0618c3da598c","year":1992},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:b1ebc6dfc9035ba830209f1e759a2091812a3f6f433e4ae7fc1640ddf40e2b4e","observation_id":"e3cffa90-383d-4a07-8d46-9836133d56ad","resolution":{"observed_at":"2026-05-12T15:21:39.604865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-05T23:31:35.155403Z","title":"Hypertree Decompositions and Tractable Queries","venue":null,"work_id":"97611438-476f-473e-b229-ee75292c4fac","year":2002},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:7f82f0cec0f6263bc01ef8a9945a97dab8d0c4504e319ca9667ab4ef3ad1902e","observation_id":"d8440e4f-2818-4545-93df-1090af1864f1","resolution":{"observed_at":"2026-05-12T15:21:39.626326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-05T23:31:35.234923Z","title":"Levesque","venue":null,"work_id":"2b2ea1e8-5a16-4e95-9d62-33d1f1897824","year":1984},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:ecde8f3e7f0af4391c4fc17f6a6fbf3e9b793d0a94ce8b7fc3d0f304db25fa6e","observation_id":"af2ca849-946c-421e-aad2-5d3a4ba0f848","resolution":{"observed_at":"2026-05-12T15:21:39.656019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-05T23:31:35.239073Z","title":"Levesque","venue":null,"work_id":"5d70b36e-df12-4e66-b38f-8a703566fd80","year":1984},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:ce3a03f0626d97dd49796763cfde60c41bd4b143da704e5bf20a7634003e895c","observation_id":"97388f5b-2a6d-4111-8d74-8250518a994f","resolution":{"observed_at":"2026-05-12T15:21:39.654095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-05T23:31:35.243001Z","title":"On the compilability and expressive power of propositional planning formalisms","venue":null,"work_id":"8ae4c2e5-9772-402b-a073-feeecb218449","year":2000},"citing_paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-12T04:22:37.919106Z"},"links":{"citing_paper":"/paper/2605.10169"},"observation_digest":"sha256:8dd8e4b934fa2273b9f164c0a4b19dcf7e415517dd7704f5ecc0fb369207d931","observation_id":"39f7a1ed-4a54-4b89-b445-fecb980320aa","resolution":{"observed_at":"2026-05-12T15:21:39.664029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.10169","last_updated":"2026-05-11T08:19:14Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T08:19:14Z","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":47},"total_outbound_references":53},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2605.10169."}