{"as_of":"2026-08-16T04:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:03263ae970cb8035d6b97f85e01d277031a24a78a586b8e944ca6af2bcde4c55","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:08:19.297672Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T03:07:42.036055Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.10896","snapshot_observed_at":"2026-08-02T03:07:42.036055Z","title":"Control synthesis for multiple reach-avoid tasks via Hamilton-Jacobi reachability analysis (arXiv version),","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14023","last_updated":"2026-07-15T16:55:13Z","snapshot_observed_at":"2026-08-12T19:06:05.312020Z","submitted_at":"2026-07-15T16:55:13Z","title":"Exact Decomposition of Adversarial Dual-Objective Value Functions, with Applications to Optimal Drug Dosing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T03:07:42.036055Z"},"links":{"cited_paper":"/paper/2509.10896","citing_paper":"/paper/2607.14023"},"observation_digest":"sha256:02e178f30cc46db3577dfc01f497975f88e6e272aba46a6d0073011b95183c36","observation_id":"be21a8c1-b5ea-4f1c-bc1d-a879b36cf7ba","resolution":{"observed_at":"2026-08-02T03:07:42.036055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.10896/citation-record","integrity":"/paper/2509.10896/integrity","json":"/paper/2509.10896/citation-record.json","paper":"/paper/2509.10896"},"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-15T16:08:20.026628Z","title":"Control barrier function based quadratic programs for safety critical systems","venue":null,"work_id":"7542bf55-4883-489d-b299-2ce0f186d6ba","year":2016},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.079115Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:367efb8e938b0355a7da23245c8deab629681ca3bcf98e13af95fc738d5a2570","observation_id":"b2cf81a6-d4af-4ee9-98ad-a110be887374","resolution":{"observed_at":"2026-08-15T16:08:20.033314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.084804Z","title":"Principles of model checking","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.084804Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:eab9a1920cf10c7441827b371f6026aa1aabfda51a8268b8188141e0a43bed48","observation_id":"9da0b465-b58d-4b75-91b8-6a9da64085ab","resolution":{"observed_at":"2026-08-15T16:08:19.084804Z","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-15T16:08:19.993657Z","title":"Hamilton-jacobi reachability: A brief overview and recent advances","venue":null,"work_id":"41b5d85b-32ca-4b3a-9d83-1707521ecde2","year":2017},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.092626Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:09e12c24638107c3354c31998dcaf7707ca3bf552ce90a754778e95c581d1293","observation_id":"5065da36-3608-4039-80e4-8f851ee0425e","resolution":{"observed_at":"2026-08-15T16:08:20.000311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.099202Z","title":"Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations, volume 12","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.099202Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:5a30c5d680638635bd4be6b10d59853a04705f2db0dde6c846cfee0e4a287192","observation_id":"28771b3a-ce20-4181-b80c-66f8ff540012","resolution":{"observed_at":"2026-08-15T16:08:19.099202Z","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-15T16:08:19.963118Z","title":"Formal Methods for Control Synthesis: An Optimization Perspective","venue":null,"work_id":"a22fddbb-954a-4629-83d4-edf814f8dac8","year":2019},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.106579Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:0338828b9c07c5861f03df91453eaf27bac56fbcd571a0289d1fb09029d6d9da","observation_id":"928ea754-f48c-4e08-8078-15ff5e079ea4","resolution":{"observed_at":"2026-08-15T16:08:19.968824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.944035Z","title":"Formal methods for discrete-time dynamical systems , volume 89","venue":null,"work_id":"2f90ffe0-514f-4a1d-ac23-fc3ffec5fd1e","year":2017},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.112575Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:1022d8751f63404043d8350d4b1aaa86248b326a59286dc164d74580b86cd860","observation_id":"fb0e275b-e87e-48f0-bdea-cb9efa6cacd1","resolution":{"observed_at":"2026-08-15T16:08:19.950520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.927835Z","title":"Formal Methods in Manufacturing","venue":null,"work_id":"ef78c6b0-f259-4012-9bb9-53906245efec","year":2018},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.119559Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:a57997271a49f90fe950796cbb57bda06c86d883fdf37a57804b9c06d103c2a2","observation_id":"2e72d829-e064-4b5e-b0f5-16459fe3ce58","resolution":{"observed_at":"2026-08-15T16:08:19.933491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.907921Z","title":"Verifying safety of an autonomous spacecraft rendezvous mission","venue":null,"work_id":"e89c76ff-64a2-4c16-8b10-2c9c605fb0bf","year":2017},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.125835Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:ecbc5b62bfbfc5bd9e412afc9d5d79bfde5e18bea0d9fc7eb19fc62d2efe24f8","observation_id":"85a5092f-9d32-4d23-9183-3142e8b57e51","resolution":{"observed_at":"2026-08-15T16:08:19.915407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.889925Z","title":"Robust sequential trajectory planning under disturbances and adversarial intruder","venue":null,"work_id":"3f461752-970b-4d05-bffa-2df0c3196880","year":2018},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.133138Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:48d473b4761372a9cf68336797616c781cf0923052b92090c766fefbd9d35f85","observation_id":"79b5b27e-ba98-41ca-9b28-67efd386d5c4","resolution":{"observed_at":"2026-08-15T16:08:19.895541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.872476Z","title":"Signal temporal logic meets reachability: Connections and applications","venue":null,"work_id":"692665bf-5401-4b9f-bf2a-04a862ae38c0","year":2018},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.138923Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:d8fd88b17b4293ab3550661434694d01679a9df214bad102e32cc086cb20b6c7","observation_id":"b77a6e7b-f165-4302-8071-20882c95b378","resolution":{"observed_at":"2026-08-15T16:08:19.877729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.854425Z","title":"Hamilton–jacobi reachability: Some recent theoretical advances and applications in unmanned airspace management","venue":null,"work_id":"c09b2366-5946-4b91-94b2-0a61f55b573e","year":2018},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.145541Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:015da1bdbb6da0539069e623604093145cf9cb958fcef8c7c6f9cf0a6aa14456","observation_id":"6185654f-c6f5-4cc5-8889-6a57dff629cd","resolution":{"observed_at":"2026-08-15T16:08:19.860428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.837918Z","title":"Control synthesis for multiple reach-avoid tasks via hamilton-jacobi reachability analysis","venue":null,"work_id":"74afcae7-1a2d-4ad8-ade6-9ff10b66e74f","year":2025},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.151762Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:0e25c54ef5b8a78d24db0ad289063488f05b472fd112f4c78dd5051fe22d2899","observation_id":"84727da9-75ef-4eea-8814-d7b51803dd46","resolution":{"observed_at":"2026-08-15T16:08:19.843660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.819205Z","title":"Choi, Donggun Lee, Koushil Sreenath, Claire J","venue":null,"work_id":"0194275d-2f3f-41f8-8867-c2cedf6d1e67","year":2021},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.156678Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:03d2c7ee8eeed33116c6c2462172d020b815d7e629b9b7d2cebeb36dfa6c3bee","observation_id":"8c41551c-1bdd-4dab-a04d-1d5dae59954a","resolution":{"observed_at":"2026-08-15T16:08:19.824388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.800522Z","title":"Prescribed-time reach-avoid-stay specifications for unknown systems: A spatiotemporal tubes approach","venue":null,"work_id":"6df7fa47-9f98-4af3-abbd-7e33795340a7","year":2024},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.162566Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:e6454b52f560b2d54ecdc7bd3a154c131d79a66c816b96e81c820e3cfbf231fc","observation_id":"8bbf58ab-2a4a-49cf-8244-773431ab82ed","resolution":{"observed_at":"2026-08-15T16:08:19.806941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13199","last_updated":"2025-09-03T11:06:24Z","snapshot_observed_at":"2026-08-11T05:49:17.865004Z","submitted_at":"2025-01-22T20:06:30Z","title":"Symbolic Control for Autonomous Docking of Marine Surface Vessels","version":2},"cited_work":{"arxiv_id":"2501.13199","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.13199","snapshot_observed_at":"2026-08-15T16:08:19.423872Z","title":"Symbolic Control for Autonomous Docking of Marine Surface Vessels","venue":"eess.SY","work_id":"52e1c786-8db0-4407-a43a-d572aca5b0cf","year":2025},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.168215Z"},"links":{"cited_paper":"/paper/2501.13199","citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:3a6838ad56a62714da2d183f56ecb2dcbe951d40c453a1ad9db32d8260acc00c","observation_id":"4859a59a-72d6-4451-962d-3a415821fac5","resolution":{"observed_at":"2026-08-15T16:08:19.429898Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.174413Z","title":"Reach-avoid problems with time-varying dynamics, targets and constraints","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.174413Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:2c9c97eba5867e0b46e3b4f8ccec9e79d6372d67c324f03a79d277f45a24c9e5","observation_id":"a2f2a8ff-7b4c-47bb-86a2-3d480bf13a03","resolution":{"observed_at":"2026-08-15T16:08:19.174413Z","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-15T16:08:19.772597Z","title":"Temporal logic trees for model checking and control synthesis of uncertain discrete-time systems","venue":null,"work_id":"688afe69-83e9-4b08-b88a-f9d600d42513","year":2021},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.179229Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:9c826b089dbd3891914c7e6330dcf46d0ea91ac5e94518d64dbd7b9ff7d2343f","observation_id":"7115c158-437d-435e-a7c1-04544747aad7","resolution":{"observed_at":"2026-08-15T16:08:19.777851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.756440Z","title":"A differential game approach to planning in adversarial scenarios: A case study on capture-the-flag","venue":null,"work_id":"66f4d801-b21b-40f8-8903-62f0dcbaad65","year":2011},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.184161Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:572de1890c1b2591406b55bef2dd93e321499f72e75205ba8030c1afa23c07ff","observation_id":"cb66419f-864d-4f1d-9085-873153104ca5","resolution":{"observed_at":"2026-08-15T16:08:19.761430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08334","last_updated":"2024-04-12T08:56:16Z","snapshot_observed_at":"2026-08-13T00:32:05.938732Z","submitted_at":"2024-04-12T08:56:16Z","title":"Guaranteed Completion of Complex Tasks via Temporal Logic Trees and Hamilton-Jacobi Reachability","version":1},"cited_work":{"arxiv_id":"2404.08334","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.08334","snapshot_observed_at":"2026-08-15T16:08:19.392506Z","title":"Guaranteed Completion of Complex Tasks via Temporal Logic Trees and Hamilton-Jacobi Reachability","venue":"eess.SY","work_id":"f32ce356-85fa-4b98-904c-38b7786dcf25","year":2024},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.189657Z"},"links":{"cited_paper":"/paper/2404.08334","citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:6ecf843031d78352bdc585413b97da7efbe144c3d6dc892131475fdc7e34e919","observation_id":"e8ce173e-da2e-4ef2-b6fa-c923ae18607f","resolution":{"observed_at":"2026-08-15T16:08:19.399853Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.740107Z","title":"A fully automated framework for control of linear systems from temporal logic specifications","venue":null,"work_id":"919c4066-acd9-403e-afd8-c2059221705a","year":2008},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.195963Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:8358b3e0022650f4579a1447e38a5d01c62006c0a021729e64ada6137db28898","observation_id":"e58d49c8-9b74-406b-8fb4-2bd22a2f02fa","resolution":{"observed_at":"2026-08-15T16:08:19.745567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.723217Z","title":"Control barrier functions for signal temporal logic tasks","venue":null,"work_id":"8cbf1d6a-e671-42b7-bc75-dfb67f51b699","year":2018},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.202601Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:9f9d08109118a3643fc6e4f2261ec5a996c63284e535dd829d81aaa284e5d0d5","observation_id":"f01a20f9-ed58-431b-bb0f-d9f7b0a1b2d7","resolution":{"observed_at":"2026-08-15T16:08:19.728320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.704601Z","title":"Finite abstractions with robustness margins for temporal logic-based control synthesis","venue":null,"work_id":"247be80c-87ce-409c-8d42-f72d97542db8","year":2016},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.208723Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:bb2321151be16ef0acad4fff9af498daec7bcd32cf82dc7cea6d68d3a3f3abec","observation_id":"c23e3803-088a-44cf-be3c-47ccd3ac786f","resolution":{"observed_at":"2026-08-15T16:08:19.710434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.688394Z","title":"Hamilton–jacobi formulation for reach–avoid differential games","venue":null,"work_id":"bda01296-1056-468f-bafd-0770474c9882","year":2011},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.213841Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:836394aedafeffb5a2a39343701f64a530f98d8f58eabdc011b7b3829b6226e1","observation_id":"a0c07b06-e43a-4c80-8145-d6f9544f8810","resolution":{"observed_at":"2026-08-15T16:08:19.693587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.670974Z","title":"Formal methods to comply with rules of the road in autonomous driving: State of the art and grand challenges","venue":null,"work_id":"f0c18fbe-653f-42c9-a669-3d8845e0cd44","year":2023},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.219904Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:0a0868f93016b37b45d74516212ffcbaee314b7943174b3f3d161a926f17c408","observation_id":"fbe51d4c-5eb0-4456-a218-ef2810b10a16","resolution":{"observed_at":"2026-08-15T16:08:19.677533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.655059Z","title":"Smooth converse lyapunov-barrier theorems for asymptotic stability with safety constraints and reach-avoid- stay specifications","venue":null,"work_id":"fc577859-c40a-4c6f-8ca6-1fc71fcb1273","year":2022},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.226135Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:e8377e0ee142a857c7b1d653468d26d1f59b30adc952c19596bf0afbb272aa26","observation_id":"4e720401-e387-46e3-bdf4-45260ed8e52f","resolution":{"observed_at":"2026-08-15T16:08:19.659968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.639394Z","title":"Stochastic lyapunov- barrier functions for robust probabilistic reach-avoid-stay specifications","venue":null,"work_id":"936c0032-8d20-4717-b6f3-1ad8489ee399","year":2024},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.231422Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:390c11a7e11f84bd0309b26ddd01457223315ba7dd99c82f8d1a7cf1a8ed08ff","observation_id":"66b7e1bb-2046-442e-be31-9e28a3378d81","resolution":{"observed_at":"2026-08-15T16:08:19.645103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.624470Z","title":"A time-dependent hamilton-jacobi formulation of reachable sets for continuous dynamic games","venue":null,"work_id":"0beec41b-a476-4a26-82dc-dc04938000bc","year":2005},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.235992Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:ba0ada9b585f4838fd3bda5d0a71213700834ae84504fd000ea4fcc1fe922b5e","observation_id":"abc9d6cd-59d1-4dc9-9dce-b4f5da1e1fdc","resolution":{"observed_at":"2026-08-15T16:08:19.629338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.607068Z","title":"Control of Cyber-Physical-Systems with logic specifications: A formal methods approach","venue":null,"work_id":"a4f37d63-618b-4a42-9b62-d238f579678f","year":2019},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.241015Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:9147fa7aeb51cee1b7349428d7c9e5f1fe12ff7f1281676310876375cf536b05","observation_id":"bcc1ab79-5e92-4f09-9691-b6f173ee6006","resolution":{"observed_at":"2026-08-15T16:08:19.613189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.589847Z","title":"Feedback refinement relations for the synthesis of symbolic controllers","venue":null,"work_id":"1c6a15ec-e071-4cf7-b103-20a3ccfaa104","year":2016},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.246536Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:27ae9710c59ff112debf09847875dc8a070e44dc894e944b5889de8ffd0e8ba2","observation_id":"4e50a5c1-e4e8-48c9-b293-cbedf6cb828a","resolution":{"observed_at":"2026-08-15T16:08:19.595669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.572062Z","title":"Control of mobile robots using barrier functions under temporal logic specifications","venue":null,"work_id":"5fcd1b39-3044-4f42-977b-7e48b6c46fe4","year":2020},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.251482Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:b44a090fe58ff60102d29482cabe3c3cace2d28179d9661ffb5d3f226d0220d1","observation_id":"53f1f4e9-ff06-463b-8af3-f9bc8901e8d9","resolution":{"observed_at":"2026-08-15T16:08:19.577679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05535","last_updated":"2024-04-08T14:03:33Z","snapshot_observed_at":"2026-08-13T00:34:57.712881Z","submitted_at":"2024-04-08T14:03:33Z","title":"Robust STL Control Synthesis under Maximal Disturbance Sets","version":1},"cited_work":{"arxiv_id":"2404.05535","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.05535","snapshot_observed_at":"2026-08-15T16:08:19.360893Z","title":"Robust STL Control Synthesis under Maximal Disturbance Sets","venue":"cs.RO","work_id":"1c9d9fd5-12c5-4335-a9e0-859971e37cb3","year":2024},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.256332Z"},"links":{"cited_paper":"/paper/2404.05535","citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:1cd385d38fbe6cdc66899721e43e2c13a4d762db23ebf0466ee15c854c0c78dd","observation_id":"2e5dc01c-3319-44bb-9056-b34398885d74","resolution":{"observed_at":"2026-08-15T16:08:19.368703Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.555204Z","title":"Optimization-based trajectory generation with linear temporal logic specifications","venue":null,"work_id":"db92df25-41f1-46ba-9c38-0d67ad3e3bef","year":2014},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.262411Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:dff8efca71d66cf178135f6bbfa1c03f07b937f798147fb820b87cc99cefd6a1","observation_id":"3487557b-3494-4d2a-8b89-766de6d467a2","resolution":{"observed_at":"2026-08-15T16:08:19.560630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.537669Z","title":"Automata theory meets barrier certificates: Temporal logic verification of nonlinear systems","venue":null,"work_id":"9318dc45-ee0e-4cc1-85de-c419dfd6779a","year":2015},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.267294Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:00fc7baaeab576c9c95bdb1844881330b518bd082b2ba4a28dca261a345bf851","observation_id":"b4785db6-4130-478f-a773-84a204bfbcb4","resolution":{"observed_at":"2026-08-15T16:08:19.543582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.520412Z","title":"Reach-avoid verification based on convex optimization","venue":null,"work_id":"3d62b969-6f38-437f-bc97-2fd2246a6bc2","year":2024},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.272138Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:aee958c52c0f9a871f30760029decca0fb891e68220a055cfc8b7a9e3b879a73","observation_id":"605c9602-d99e-4d8c-a586-b182118af104","resolution":{"observed_at":"2026-08-15T16:08:19.526460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13075","last_updated":"2024-02-20T15:21:30Z","snapshot_observed_at":"2026-08-14T14:13:45.868790Z","submitted_at":"2024-02-20T15:21:30Z","title":"Formal Synthesis of Controllers for Safety-Critical Autonomous Systems: Developments and Challenges","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13075","snapshot_observed_at":"2026-08-15T16:08:19.276996Z","title":"Formal synthesis of controllers for safety-critical autonomous systems: Developments and challenges","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.276996Z"},"links":{"cited_paper":"/paper/2402.13075","citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:4f51018a8fb61fa0239af7a9b32f057bed5f648be6303fc1f4d84f02cfdd68af","observation_id":"c48814c0-af08-47f7-bf28-d2ec0e2841ac","resolution":{"observed_at":"2026-08-15T16:08:19.276996Z","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-15T16:08:19.498435Z","title":"Continuous- time control synthesis under nested signal temporal logic specifications","venue":null,"work_id":"4e0a5a05-29b6-454a-a6ec-110bebf5a832","year":2024},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.282956Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:80c4c822cb491db5822357aa18e02d221e5846743ea55f19bf6e3d62a8568215","observation_id":"819329f3-a30f-4482-b588-5e7d944b985b","resolution":{"observed_at":"2026-08-15T16:08:19.508711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.480246Z","title":"Model predictive monitoring of dynamical systems for signal temporal logic specifications","venue":null,"work_id":"a5a990cd-5f51-421a-882a-005247189d9b","year":2024},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.287812Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:9d3138a95645ea6dcf990510feef0f8e36c8bf9600e58f5a034a7dd293b4a840","observation_id":"a30f4feb-aaae-4dc9-91c6-cd99e8e143b3","resolution":{"observed_at":"2026-08-15T16:08:19.486126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.462265Z","title":"Formal synthesis of controllers for uncertain linear systems against-regular properties: A set-based approach","venue":null,"work_id":"6da7edd7-1a72-4468-846d-7fc6b2862b5e","year":2024},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.292594Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:915963045579bdace4a7bdad53501711bed263f83900b2f46f8b88be0655f503","observation_id":"7b908171-8f4d-4071-8f12-0d8a5ece9c84","resolution":{"observed_at":"2026-08-15T16:08:19.468776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T16:08:19.443364Z","title":"Efficient path planning algorithms in reach-avoid problems","venue":null,"work_id":"a5bcbbd9-04a2-472e-986c-b4a22f0509a4","year":2018},"citing_paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T16:08:19.297672Z"},"links":{"citing_paper":"/paper/2509.10896"},"observation_digest":"sha256:c4424ecc88e590b511e294b8fa5027fc211c4d3d2065372db65d8de19bc9da9d","observation_id":"f954ac65-6e61-499c-8677-f3be5f6b3f40","resolution":{"observed_at":"2026-08-15T16:08:19.449368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.10896","last_updated":"2025-09-13T16:54:27Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-15T15:49:59.386050Z","submitted_at":"2025-09-13T16:54:27Z","title":"Control Synthesis for Multiple Reach-Avoid Tasks via Hamilton-Jacobi Reachability Analysis"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":3,"verified_fuzzy":32},"total_outbound_references":39},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 1 inbound Pith citation observation for arXiv:2509.10896."}