{"as_of":"2026-08-18T22:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4727afce6aa3310e8c6247c1c075f68e016a46dc558bd47215954a54e15f9c3f","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:04:21.427542Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2506.06679/citation-record","integrity":"/paper/2506.06679/integrity","json":"/paper/2506.06679/citation-record.json","paper":"/paper/2506.06679"},"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-07T06:04:32.162400Z","title":"IEEE Control Systems Letters5(3), 773–778 (2020)","venue":null,"work_id":"0ecdb37a-4842-4641-b646-aeff69e089af","year":2020},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.148421Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:fddc2e3af63e31ca711b83b0badfc628629485897d424d89261026a1efe5e99d","observation_id":"74884585-f9e7-49cb-81bf-088ca1a996c2","resolution":{"observed_at":"2026-08-07T06:04:32.262649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:31.920964Z","title":"IEEE Transactions on Automatic Control62(10), 5269–5274 (2017)","venue":null,"work_id":"14287bdc-c489-4344-85d6-e434475591e1","year":2017},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.251714Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:7ee829e2913faf69f03ee8707caae5a8dcfbbdb15b63d95459ac1f004f09653f","observation_id":"98375508-d722-4b5c-a6d8-f0ffdd8563cc","resolution":{"observed_at":"2026-08-07T06:04:32.025853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:31.679758Z","title":"The MIT Press (2015)","venue":null,"work_id":"85e6bdcd-5890-48b4-8b08-49c8fdd5ced5","year":2015},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.315245Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:eccf7d7d19a9de1a0ab6abbf050d4548ebd643fa0f41681b4ca23eea21a982ac","observation_id":"27602aee-b6d1-4b37-966f-942d16ef2ed8","resolution":{"observed_at":"2026-08-07T06:04:31.794655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:16.386037Z","title":"In: 2019 18th European control conference (ECC)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.386037Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:c4b0240225cd73ece768009807629a92a015f4a1f6c4cf75cb27ef41f848a169","observation_id":"91ed9d9b-b203-48eb-83fc-f711594cb41b","resolution":{"observed_at":"2026-08-07T06:04:16.386037Z","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-07T06:04:31.455336Z","title":"User’s Guide and Reference Manual, Version4(2019)","venue":null,"work_id":"89537038-a63b-41a7-abbd-ef8afc23807a","year":2019},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.486087Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:34769856ce401b83db93264d8b3990e12c234d2ec24c730f992059fed0380f79","observation_id":"5effddbe-48d3-48fe-a37f-3a2e86689d0b","resolution":{"observed_at":"2026-08-07T06:04:31.564626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:31.252986Z","title":"Automatica44(8), 2163–2170 (2008)","venue":null,"work_id":"bd40ef7f-95ec-4028-942e-d9902a0d8162","year":2008},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.547246Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:171c4f67f23636ff26533e4299ba7ece426a2d2f9be385b4f2e46dc9671277b1","observation_id":"6a6db0fb-4d47-4b41-a948-244f38332075","resolution":{"observed_at":"2026-08-07T06:04:31.330197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:31.069639Z","title":"Advances in neural information processing systems32(2019)","venue":null,"work_id":"252e5f65-f812-42be-b6b9-1322d1009f52","year":2019},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.625656Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:2736c9e4650ad5bc2c8ce29f6c3ab5cd75b288f1c6eca8e4ec68ef3b4eebd28c","observation_id":"9f9133f9-c83e-49fd-960a-d786d5818757","resolution":{"observed_at":"2026-08-07T06:04:31.183755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:30.745046Z","title":"In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems","venue":null,"work_id":"4f359e3c-3a59-49bd-8f82-519cbd9735dd","year":2023},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.713131Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:e85c451f5933af24a41c125b9a07229dc0e41b11446f4bd465b9222386055fe3","observation_id":"829e45fc-a0ac-4225-b87d-b429f4cb5d90","resolution":{"observed_at":"2026-08-07T06:04:30.941934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:30.336472Z","title":"In: 2021 60th IEEE Conference on Decision and Control (CDC)","venue":null,"work_id":"0bc3c8a5-6eac-47af-b6fe-c25eb67610da","year":2021},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.778385Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:1a5a0dfcd13fff288769c23c3506e7398e5d78a2d27242865718ab8e44c0c1f3","observation_id":"e7ad876b-0406-40d6-bc8b-530da9f0bbdc","resolution":{"observed_at":"2026-08-07T06:04:30.514728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.00081","last_updated":"2024-11-11T01:04:19Z","snapshot_observed_at":"2026-08-16T16:35:33.978533Z","submitted_at":"2022-08-31T19:31:31Z","title":"A Semi-Algebraic Framework for Verification and Synthesis of Control Barrier Functions","version":3},"cited_work":{"arxiv_id":"2209.00081","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.00081","snapshot_observed_at":"2026-08-07T06:04:21.937025Z","title":"A Semi-Algebraic Framework for Verification and Synthesis of Control Barrier Functions","venue":"eess.SY","work_id":"476d0122-c507-410f-99d4-483e91cc653b","year":2022},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.845680Z"},"links":{"cited_paper":"/paper/2209.00081","citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:4e229346f48b3e12ae78492718cd29798eb86374a9b3aee4ccfb3f59fa90f8df","observation_id":"6675998b-1897-4727-8827-54d180c41eb3","resolution":{"observed_at":"2026-08-07T06:04:21.985709Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:30.023818Z","title":"Journal of Symbolic Computation5(1-2), 29–35 (1988)","venue":null,"work_id":"b65f45a5-d75c-49ea-9e34-ed30160f29de","year":1988},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:16.919874Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:1ef11361bbc54b56e8d883a8013c2d9ab18d87d70477e9d1c1af7cd57125c7e1","observation_id":"d2790404-4b12-4d5e-a8cb-acc51f62d85b","resolution":{"observed_at":"2026-08-07T06:04:30.152448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:29.760156Z","title":"Available at SSRN 4880686 (2023)","venue":null,"work_id":"dcae6295-1ecd-42d8-969f-8784a83ef7ec","year":2023},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:17.023254Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:a9266a10472798a20ec9e7dc2442cd97b9064db2d126dca5c4f99a61fe387586","observation_id":"7bd8092e-f930-4144-acf7-1d72e394bbb8","resolution":{"observed_at":"2026-08-07T06:04:29.883816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:17.196010Z","title":"In: Proceedings of the 27th ACM International Conference on Hybrid Systems: Computation and Control","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:17.196010Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:ba71a4e30bcbf0f3e5a93beb89dff205fad7017b738d00337d92775b23bb2d98","observation_id":"d4c11859-cb3a-4009-ba11-b879afef2da6","resolution":{"observed_at":"2026-08-07T06:04:17.196010Z","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-07T06:04:29.468154Z","title":"IEEE Transactions on Automatic Control66(7), 3138–3151 (2020)","venue":null,"work_id":"55e0b724-cff1-4435-a6e1-3f1d78c8d90f","year":2020},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:17.300071Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:c48fe69a9bf2f2ffaf55a80f0d9c2c5978cd817734aedde1477308a0163b48cb","observation_id":"9266c5f0-b3ef-49d3-8cd0-4201580b285b","resolution":{"observed_at":"2026-08-07T06:04:29.611230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:29.159399Z","title":"CRC Press (2000)","venue":null,"work_id":"c5cb2fca-98b4-405e-af42-66afb50fd56e","year":2000},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:17.380426Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:9d3580f98f21f464ac2f9a080558155ced222f8a833e28fb1e4f6ab950c12797","observation_id":"79afa14d-e53d-4ce4-bf4f-caec812543c3","resolution":{"observed_at":"2026-08-07T06:04:29.301382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:28.851575Z","title":"In: 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","venue":null,"work_id":"74997a08-ea9e-4eb6-afb1-96de689018b0","year":2018},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:17.433987Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:2db4bd2142d08a9e5b388afb0a164eaf9e2f340acd19e915fd6c0cca1cba249d","observation_id":"fc69ac88-f458-4482-bbc9-83b4edb2d956","resolution":{"observed_at":"2026-08-07T06:04:28.981625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:17.500024Z","title":"IEEE Transactions on Automatic Control59(2), 297–312 (2013)","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:17.500024Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:5b3e7c371a482383329de0e68f8f03ced4aa7f2f26eba4763cb3e4784f2a6e17","observation_id":"16ea3880-db5a-4c01-864d-3581570b9edc","resolution":{"observed_at":"2026-08-07T06:04:17.500024Z","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-07T06:04:28.575772Z","title":"Journal of Symbolic Computation24(2), 137–152 (1997)","venue":null,"work_id":"62ce9d75-d6d6-47f4-a79a-c4b8712e1426","year":1997},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:17.608607Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:4e7028b990af0d1872574be36efeb1df4e8ad5d145c2a7fb5a2d7d717dc88a72","observation_id":"94b92135-fd36-439b-a3d0-45ad764a88e9","resolution":{"observed_at":"2026-08-07T06:04:28.694099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:28.207432Z","title":"IFAC Proceedings V olumes 47(3), 2310–2316 (2014)","venue":null,"work_id":"318408aa-03c1-4124-8941-399be0de0e6d","year":2014},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:17.762591Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:61200b57fd653b9c96bff413c9b1571fa5b58412b83e8fb0e92614dad3eaf30d","observation_id":"5aa810f8-baa5-4b43-9451-47843e8cfefb","resolution":{"observed_at":"2026-08-07T06:04:28.358461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:27.935062Z","title":"In: 2004 IEEE international conference on robotics and automation (IEEE Cat","venue":null,"work_id":"16a21932-1fcb-4c5b-83bf-221197859b60","year":2004},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:17.826571Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:9e6e7ed9f43a9ee369c482cd13f5e258f127ebf63421c8a9c5435bd5c0a9eae7","observation_id":"929ddd72-2066-470a-947e-c1527c91adeb","resolution":{"observed_at":"2026-08-07T06:04:28.023110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:17.909464Z","title":"In: Proc","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:17.909464Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:f24b653d31bb7baf13fc634bfa0a21b6727ff6e08a69515d315f467e54a82ea5","observation_id":"2bd3bb9f-ccf0-4acb-b410-41b34d914a88","resolution":{"observed_at":"2026-08-07T06:04:17.909464Z","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-07T06:04:27.577432Z","title":"IEEE Transactions on automatic control56(8), 1849–1861 (2011)","venue":null,"work_id":"01ea7fe0-5730-475d-8a29-1d2b643d7cca","year":2011},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:18.004116Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:fe1ba6faed0da77035e7da396e58aa6c68f9ceb621c68be2bc307a7e53404bf9","observation_id":"abc947ec-98a3-4338-897c-df75e0b1ae95","resolution":{"observed_at":"2026-08-07T06:04:27.768786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:27.350112Z","title":"California Institute of Technology (2000) 14","venue":null,"work_id":"f301e08c-bc91-408d-93c9-902c197a7d38","year":2000},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:18.057921Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:ec021c9bc5ee8bb473b05405acc61e17f608674f91938af7d27fcb13ce3ee392","observation_id":"b27659b8-11c6-4604-9a3a-c0dc87ee1be6","resolution":{"observed_at":"2026-08-07T06:04:27.482554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:18.128152Z","title":"In: International conference on tools and algorithms for the construction and analysis of systems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:18.128152Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:a68fa9224b03eef6ea98025473d64cb98a024c87abf3e3ccbf74851496d96401","observation_id":"b3733786-f4c1-4cdd-b8f2-06de910e08ff","resolution":{"observed_at":"2026-08-07T06:04:18.128152Z","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-07T06:04:26.954019Z","title":"Autonomous Robots43, 275–307 (2019)","venue":null,"work_id":"79329c41-b598-4f27-a045-18d6501bbc51","year":2019},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:18.221641Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:892c453adb72141df2fcdbcc70574ac7de2c3d0317d12dd0a5141f80d15a6c1c","observation_id":"df08a5ed-e8aa-4caa-b79a-7bcdbd92b527","resolution":{"observed_at":"2026-08-07T06:04:27.105842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:26.474079Z","title":"In: 2024 American Control Conference (ACC)","venue":null,"work_id":"3272312c-d236-4640-a299-ce9d6792dbe0","year":2024},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:18.315547Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:1a42d0d2f5f316bbd81e9eb1c74d035bb6f9d2bd4ffa9f601f765133e9345448","observation_id":"908a4019-2294-45d5-b11b-21d5c39ab5bd","resolution":{"observed_at":"2026-08-07T06:04:26.752982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:26.097452Z","title":"IEEE Transactions on Reliability (2024)","venue":null,"work_id":"9b513a73-f24d-4271-a204-7146cfb8a041","year":2024},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:18.455605Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:fa01a94e4d602a05c4b4591044db717507db47ec148b6340e907c967f0307c31","observation_id":"a4980bdc-38d0-415a-9489-4f76c1c326a4","resolution":{"observed_at":"2026-08-07T06:04:26.299463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:25.787543Z","title":"IFAC Proceedings V olumes46(23), 576–581 (2013)","venue":null,"work_id":"bbc26076-7772-4833-9d0b-46e6762c2e9c","year":2013},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:18.608389Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:180b9e1fef167a874fbd62e50701caebece7c67c9b2e075254552222f3f2467b","observation_id":"b76c786b-9b71-48c1-9500-dfd1f5d244f9","resolution":{"observed_at":"2026-08-07T06:04:25.939916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:25.439023Z","title":"IEEE Transactions on Automatic Control 69(2), 755–770 (2023)","venue":null,"work_id":"d7c82d9a-619b-4b8e-9c53-9471c0537e72","year":2023},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:18.803783Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:28554cb904c4727b10a9c025490a59f62d71dff975e47c8264c52a6b0eede45f","observation_id":"e4919027-8150-4905-926a-95bcc4938f3f","resolution":{"observed_at":"2026-08-07T06:04:25.585732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:25.001950Z","title":"ProQuest (2006)","venue":null,"work_id":"efaf278e-eb8c-46ba-add6-b1c0833ded48","year":2006},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:18.979199Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:133123f6948d36bf11d3f6a7a15400d72845ede58b7a67fb0bccf74b675c5ef9","observation_id":"1e42d40f-6ce6-4ee7-b200-8bb6cf2947d7","resolution":{"observed_at":"2026-08-07T06:04:25.195507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:19.180828Z","title":"IEEE Transactions on Automatic Control53(2), 565–571 (2008)","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:19.180828Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:df56c2568ae71297ae71995cf5e60709154bd4132f3a1743d27b29e633cf1482","observation_id":"2fdd2a26-8871-4f84-98d1-e6f9174776b8","resolution":{"observed_at":"2026-08-07T06:04:19.180828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.07640","last_updated":"2025-08-11T07:41:21Z","snapshot_observed_at":"2026-08-16T13:00:53.475465Z","submitted_at":"2024-11-12T08:44:01Z","title":"Minimally Conservative Controlled-Invariant Set Synthesis Using Control Barrier Certificates","version":4},"cited_work":{"arxiv_id":"2411.07640","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.07640","snapshot_observed_at":"2026-08-07T06:04:21.758317Z","title":"Minimally Conservative Controlled-Invariant Set Synthesis Using Control Barrier Certificates","venue":"eess.SY","work_id":"5f0b7931-c695-446b-8d0d-af5756460138","year":2024},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:19.387055Z"},"links":{"cited_paper":"/paper/2411.07640","citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:23bfa102e3e795e97da5682c2fb9a0496cf97f7f13fd49ae236e73dbce2335ab","observation_id":"d21f8962-1828-4940-8859-d170512d2ecc","resolution":{"observed_at":"2026-08-07T06:04:21.825970Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:24.664343Z","title":"IFAC-PapersOnLine 56(2), 1698–1703 (2023)","venue":null,"work_id":"faec4014-9cca-4238-932f-768eb543b68c","year":2023},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:19.553836Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:b724d9ef1aff456621e36615d06f1acf265a1f51fb212544f2a1e811a9221fd9","observation_id":"72f99d5d-88ea-422c-bd4c-6fb5c0eef2ec","resolution":{"observed_at":"2026-08-07T06:04:24.825087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:24.323105Z","title":"In: 2018 Annual American Control Conference (ACC)","venue":null,"work_id":"c1910b01-319b-4f81-9107-17a8d237b47c","year":2018},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:19.708288Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:e011f971bd809aaa56dff12fea66bf6c716add1527772316e5690751e9b39a19","observation_id":"a3049042-6358-4523-a5e3-3e3844e77cb4","resolution":{"observed_at":"2026-08-07T06:04:24.484037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:24.049231Z","title":"In: 2024 European Control Conference (ECC)","venue":null,"work_id":"e1b32544-ce86-42fe-8a40-988e5b4c8f24","year":2024},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:19.860836Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:fa2cb115ef0ba6af04f16c927cc6c2a37c4833cb8e6e6932f079164b11a1423d","observation_id":"88348ef0-9052-4c87-b4da-652d2a8a6bdd","resolution":{"observed_at":"2026-08-07T06:04:24.136871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:23.713964Z","title":"Advances in neural information processing systems 36, 2939–2955 (2023)","venue":null,"work_id":"695edcb9-042e-49cf-b7bb-98a73ed0b1bf","year":2023},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:20.005607Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:8fe68652901e2d3b16226c9ae5608bdc7f06797a69afb4a142a5105c3399e762","observation_id":"89368c99-a369-4ace-922d-9a64918c26ca","resolution":{"observed_at":"2026-08-07T06:04:23.858423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:20.153371Z","title":"arXiv preprint arXiv:2404.18118 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:20.153371Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:718245da46bfb0ac74ceb1a901f40d2c9a1601aad4c71c5eb1f7b8f0993793fa","observation_id":"ac807593-75c8-4416-af84-13067082ca3e","resolution":{"observed_at":"2026-08-07T06:04:20.153371Z","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-07T06:04:23.464434Z","title":"IEEE Transactions on Automatic Control69(12), 8892–8899 (2024)","venue":null,"work_id":"21af9479-6ba1-4ca2-bc0a-b82012b99e26","year":2024},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:20.293734Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:5f80c24d57da9c9c5bd6bac16a807ec4c45bd02df047643279bb76bcb966a0ec","observation_id":"a5fe116e-cfaa-4092-bdb5-a2859f28f4f5","resolution":{"observed_at":"2026-08-07T06:04:23.623672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:23.224063Z","title":"In: 2021 American Control Conference (ACC)","venue":null,"work_id":"46925ab9-a7c2-4513-97fa-a14251fd39ee","year":2021},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:20.429400Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:026df183eee2c44e7b0f600aa7eb37261e3f5957cb12ac1f081d50decec5e0ff","observation_id":"2d3a5aa4-bab1-4682-9be4-293342f17ecc","resolution":{"observed_at":"2026-08-07T06:04:23.336133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:23.051707Z","title":"In: 2020 59th IEEE Conference on Decision and Control (CDC)","venue":null,"work_id":"449147a7-57b0-4b95-a5d6-c96a18bb8174","year":2020},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:20.633863Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:af7f2182c5dc8eb9e5099d5f943f6a49c5f99f1392417ac5b89ceaddfa155c5b","observation_id":"64b2e600-a42a-4987-b7a2-4847edf419fa","resolution":{"observed_at":"2026-08-07T06:04:23.105933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:22.879317Z","title":"In: International Conference on Computer Aided Verification","venue":null,"work_id":"59cd9aeb-9d3e-4591-b71d-8090ad983582","year":2023},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:20.833959Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:c13e956fb80e33cbd9f4518801b651226f943b50f72796b5de6b9accc2f4a3ab","observation_id":"a2937f71-e2a6-4266-aa89-3b0295580f95","resolution":{"observed_at":"2026-08-07T06:04:22.975474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:22.722486Z","title":"Advances in Neural Information Processing Systems36(2024)","venue":null,"work_id":"c8dc3496-6e50-42d4-97d2-9997b4f87190","year":2024},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:20.988697Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:d9d950b61c7fd1c3ab8825e6dbad79fe55960d06162470c5fe74d1dc8e4bba99","observation_id":"7b10051c-9a0a-4705-a0a3-2e58134775c8","resolution":{"observed_at":"2026-08-07T06:04:22.808462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:22.579595Z","title":"In: 2022 IEEE 61st Conference on Decision and Control (CDC)","venue":null,"work_id":"36abad79-0251-4843-8bfa-6de64c6c0c5e","year":2022},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:21.136782Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:2386a7b708f4bc52c1e9da7a1c3acbf99cf976a87ab2a1b138501c8f3705bad3","observation_id":"d85790b3-1f78-480f-b603-e0d4933793f3","resolution":{"observed_at":"2026-08-07T06:04:22.651612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:22.407525Z","title":"IEEE Transactions on Automatic Control68(8), 4682–4694 (2022)","venue":null,"work_id":"099bf8bd-e74a-42c6-b267-8bfc3cc87a7a","year":2022},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:21.281372Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:80a3bae5916edf0ba0ae836f1febac05599b81cd946d7c0105f903e683f8c0a8","observation_id":"8a029c0b-0bb4-40e9-9890-66bae94c2c59","resolution":{"observed_at":"2026-08-07T06:04:22.477920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:22.254215Z","title":"Formal Aspects of Computing 33, 437–455 (2021)","venue":null,"work_id":"dc779b6a-6726-4e4d-bce1-a8944c87de72","year":2021},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:21.346649Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:92a127ae15e676afe0f3bda396b1233e5e0f31a31ec8a19f4a64de11ad154d00","observation_id":"b3665c07-88c3-4e78-9318-13b57746805a","resolution":{"observed_at":"2026-08-07T06:04:22.317798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T06:04:22.061437Z","title":"In: Proceedings of the AAAI Conference on Artificial Intelligence","venue":null,"work_id":"84f7b65a-0c7e-42e5-a28d-6666264645ef","year":2023},"citing_paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:21.427542Z"},"links":{"citing_paper":"/paper/2506.06679"},"observation_digest":"sha256:c66eb8f9f237b564d4dc78224d020acd343bf33287c613a5b3b70a04acc50604","observation_id":"15d19afb-3e2e-44b1-8da0-4a3beafcdb7d","resolution":{"observed_at":"2026-08-07T06:04:22.115382Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.06679","last_updated":"2025-06-07T06:24:58Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-14T03:24:46.515194Z","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":36},"total_outbound_references":46},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2506.06679."}