{"as_of":"2026-08-19T04:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5efa6bb2d9e9312439e208906d05fc51932b679ef174561666cd714ff41484f5","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:56:00.393806Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"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/2505.03643/citation-record","integrity":"/paper/2505.03643/integrity","json":"/paper/2505.03643/citation-record.json","paper":"/paper/2505.03643"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.17551","last_updated":"2024-06-14T09:48:41Z","snapshot_observed_at":"2026-08-18T01:54:31.244541Z","submitted_at":"2024-03-26T09:58:27Z","title":"MPCC++: Model Predictive Contouring Control for Time-Optimal Flight with Safety Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.17551","snapshot_observed_at":"2026-08-15T23:56:00.294632Z","title":"Mpcc++: Model predictive contouring con- trol for time-optimal flight with safety constraints,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.294632Z"},"links":{"cited_paper":"/paper/2403.17551","citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:f192629ae4fda63903b389073a83369f35f7aa47580f4688fb8d9e6a8bc3f0d4","observation_id":"c562049e-4338-4800-a5d8-d0425bab522f","resolution":{"observed_at":"2026-08-15T23:56:00.294632Z","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-15T23:56:00.844637Z","title":"Scal- able multi-robot cooperation for multi-goal tasks using reinforcement learning,","venue":null,"work_id":"5633dfa9-3a2b-495d-a6f2-11af6593b70b","year":2024},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.300290Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:b45352b97bc9ab1d72fabd1a5f5fece75b2ad4244356f5ae4bf47df7cb3831c5","observation_id":"df6ee35c-3cca-4089-9fa7-932d9c643f7c","resolution":{"observed_at":"2026-08-15T23:56:00.849936Z","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-15T23:56:00.305027Z","title":"Learning robust autonomous navigation and locomotion for wheeled- legged robots,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.305027Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:cd80bf6c5be0f29b3b9896365eedd4e708c0d7d42e869ed05a56d01d97abcc90","observation_id":"3c95572a-8618-493f-84f5-0f7e3e7cb91b","resolution":{"observed_at":"2026-08-15T23:56:00.305027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:56:00.309637Z","title":"Reaching the limit in autonomous racing: Optimal control versus reinforcement learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.309637Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:81deaf8d90bdf88dbc8fc7cd2c27052d2b55065b0cb489e4e82d2b05939ec0ce","observation_id":"83dcb468-3a6b-4298-bc7d-26c31bc2e381","resolution":{"observed_at":"2026-08-15T23:56:00.309637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:56:00.314738Z","title":"Baier and J.-P","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.314738Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:5bf38767ad44e703592d299488e9866565bac2bb7c48996cd4a04d9139ecc92b","observation_id":"e321b1c6-df08-4963-9725-5d4f6af3532b","resolution":{"observed_at":"2026-08-15T23:56:00.314738Z","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":"2310.19083","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:56:00.616098Z","title":"Backward reachability analysis of perturbed continuous-time linear systems using set propagation,","venue":null,"work_id":"9ff07d7e-4e20-455b-aa6d-11de56f49889","year":2023},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.319608Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:8fd4cc77e7270ffce1439712b655281150f0548ef89cd32f6a0ee64d37a78e75","observation_id":"5526dc83-84a0-4d56-abe4-83f19bc5c9c0","resolution":{"observed_at":"2026-08-15T23:56:00.623919Z","resolver_source":"raw_fallback","status":"verified_exact"},"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-15T23:56:00.800211Z","title":"Reachability analysis of multi-affine systems,","venue":null,"work_id":"b0b31946-3df4-424e-88cb-8566d1be0997","year":2006},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.325020Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:5a31c6a1c86000768d0eb76da965cbfb390300081a075816360ca1f9a2313ef4","observation_id":"fd537659-178f-4ba7-8826-fdaebe3cadc9","resolution":{"observed_at":"2026-08-15T23:56:00.804816Z","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-15T23:56:00.784987Z","title":"Flow*: An analyzer for non-linear hybrid systems,","venue":null,"work_id":"18816cb3-6bd3-4b0a-a039-4a0746e5b8af","year":2013},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.329752Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:44cd6b0a176b56eb5a280599017f76068efa70ba51f29266fa1b5686cf04565a","observation_id":"8f6e9af0-8859-4f31-a69a-5771607fd559","resolution":{"observed_at":"2026-08-15T23:56:00.789984Z","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-15T23:56:00.769683Z","title":"The arch-comp friendly verification competition for continuous and hybrid systems,","venue":null,"work_id":"f89e51ad-1d80-4e00-9256-cedc6a075a09","year":2024},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.334544Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:672f5acf9a7fbeede6925e8f1052fbcf0e853253e757ee328883c456eacef870","observation_id":"b283d565-f5b0-4c36-8d60-c9ab6efc2bd4","resolution":{"observed_at":"2026-08-15T23:56:00.774728Z","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-15T23:56:00.338980Z","title":"Hamilton-jacobi reachability: A brief overview and recent advances,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.338980Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:7037dd44aac7273ce1de18d74415de29da33310340666842a990a55a56388007","observation_id":"260e7ab6-d961-460a-9e2e-5f3732c55af7","resolution":{"observed_at":"2026-08-15T23:56:00.338980Z","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-15T23:56:00.745209Z","title":"Reachable polyhedral marching (rpm): A safety verification algorithm for robotic systems with deep neural network components,","venue":null,"work_id":"e4a6d641-3139-49a2-aa1d-0d8ae4ee78c0","year":2021},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.343510Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:0301088e2d1b00e42452dabdaf2b161619630f970d5ebff69b7cebe7291fea92","observation_id":"40a5e216-7b87-40f9-b7ab-c06974ff1dc9","resolution":{"observed_at":"2026-08-15T23:56:00.750264Z","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-15T23:56:00.730042Z","title":"Reachability analysis of neural feedback loops,","venue":null,"work_id":"b2e80c10-3226-442d-adc6-dbd81e45c7ce","year":2021},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.348411Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:69e4dd200b2eac2bddf7f2e39a5815f3c0cd08c2c2c1a6fe1de3ebe460c0377c","observation_id":"70d8d849-0730-4069-9ccb-04ecb12948aa","resolution":{"observed_at":"2026-08-15T23:56:00.735132Z","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-15T23:56:00.714637Z","title":"Overt: An algorithm for safety verification of neural network control policies for nonlinear systems,","venue":null,"work_id":"90bebf28-b484-4221-88eb-b456af198328","year":2022},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.352603Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:73d9b6acf62bed646ea8f95a36516135110d52c083cdd44cd22874ea668b19c3","observation_id":"18ba38a5-9e5e-43b1-9eb4-1fe5de7a483e","resolution":{"observed_at":"2026-08-15T23:56:00.719359Z","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-15T23:56:00.700421Z","title":"Backward reachability analysis of neural feedback loops: Techniques for linear and nonlinear systems,","venue":null,"work_id":"176c2931-3a61-45f4-99b9-60b362cac1a2","year":2023},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.357196Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:27ee6e7e3c209a7313595e4995879a8eb4e9976d557eea81ff82e93fcfeec6c2","observation_id":"11759862-7cfe-48e9-8b31-1646e09500a5","resolution":{"observed_at":"2026-08-15T23:56:00.704913Z","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-15T23:56:00.361936Z","title":"Algorithms for verifying deep neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.361936Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:623a56333851aad702268c326976f1afcee108b14fa427b2ad8338b34816fcc1","observation_id":"653b5a17-9d83-4d50-be9e-afd68eab12c5","resolution":{"observed_at":"2026-08-15T23:56:00.361936Z","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-15T23:56:00.675741Z","title":"A dual approach to scalable verification of deep networks","venue":null,"work_id":"0faa0217-4991-460e-920f-9eeddbfdc5ac","year":2018},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.366407Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:69dcb35985a083ab06d03a8c03a6671d78cef7f3099dfd49e000d566e679d3f1","observation_id":"0c40a9d4-a442-4cb7-87f6-22f6eba1e432","resolution":{"observed_at":"2026-08-15T23:56:00.680793Z","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":"2408.09262","last_updated":"2025-06-22T15:40:04Z","snapshot_observed_at":"2026-08-16T13:25:49.187469Z","submitted_at":"2024-08-17T17:24:47Z","title":"PREMAP: A Unifying PREiMage APproximation Framework for Neural Networks","version":2},"cited_work":{"arxiv_id":"2408.09262","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.09262","snapshot_observed_at":"2026-08-15T23:56:00.488364Z","title":"PREMAP: A Unifying PREiMage APproximation Framework for Neural Networks","venue":"cs.LG","work_id":"5d6f158e-9e58-4293-a8b3-4b5f3dd4a602","year":2024},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.370986Z"},"links":{"cited_paper":"/paper/2408.09262","citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:a257495cec5e23e12f91c722a8223fee6963d52aa1eeef49d15e5c7a8b27501a","observation_id":"e2a71cdf-ca1c-4c17-afea-5424ca6f62cf","resolution":{"observed_at":"2026-08-15T23:56:00.493319Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"2202.02429","last_updated":"2023-01-05T00:53:35Z","snapshot_observed_at":"2026-08-16T17:23:29.124795Z","submitted_at":"2022-02-04T23:13:22Z","title":"Verifying Inverse Model Neural Networks","version":2},"cited_work":{"arxiv_id":"2202.02429","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.02429","snapshot_observed_at":"2026-08-15T23:56:00.466816Z","title":"Verifying Inverse Model Neural Networks","venue":"cs.LG","work_id":"b2839df2-cf9f-4df8-8669-086658a89c05","year":2022},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.375912Z"},"links":{"cited_paper":"/paper/2202.02429","citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:f750158bfe2cbbf038834ba186057ad946a3a32fca742e01c57f04f245688e78","observation_id":"b0fa1861-f22d-4629-ba92-1588aa4f0a24","resolution":{"observed_at":"2026-08-15T23:56:00.472204Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"1711.07356","last_updated":"2019-02-18T04:39:10Z","snapshot_observed_at":"2026-08-17T22:18:35.161858Z","submitted_at":"2017-11-20T15:05:33Z","title":"Evaluating Robustness of Neural Networks with Mixed Integer Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.07356","snapshot_observed_at":"2026-08-15T23:56:00.380736Z","title":"Evaluating robustness of neural networks with mixed integer programming,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.380736Z"},"links":{"cited_paper":"/paper/1711.07356","citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:a9adfe7d0c0551806d7fd223b962e879a9fe74aa8b04b98e5525c622bf929637","observation_id":"5f52ab88-5dd2-486e-b9de-f5a108f19f34","resolution":{"observed_at":"2026-08-15T23:56:00.380736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:56:00.385238Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.385238Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:1ee5ed4ebf0c000b1f73403e4f77cf1ae142c77816e031b86352f4c9ccf09424","observation_id":"dd8b970c-81db-4980-b7bc-049c4515b86d","resolution":{"observed_at":"2026-08-15T23:56:00.385238Z","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-15T23:56:00.651203Z","title":"Fast and effective robustness certification,","venue":null,"work_id":"b99c659b-90e3-4749-8a1b-4aa7d065e09d","year":2018},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.389517Z"},"links":{"citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:0f529b622f6a7c2e97f0cdc869e17f49ff77313ff0d1e43e305f64d5dd7eceae","observation_id":"b22a9a32-edf8-49a5-835e-fa1e5ef4274d","resolution":{"observed_at":"2026-08-15T23:56:00.655829Z","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":"2407.14394","last_updated":"2025-05-06T16:18:38Z","snapshot_observed_at":"2026-08-18T09:52:34.881112Z","submitted_at":"2024-07-19T15:16:25Z","title":"TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problems","version":2},"cited_work":{"arxiv_id":"2407.14394","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.14394","snapshot_observed_at":"2026-08-15T23:56:00.428309Z","title":"TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problems","venue":"eess.SY","work_id":"5762b50f-39fc-4ed4-95a1-db527c74e490","year":2024},"citing_paper":{"arxiv_id":"2505.03643","last_updated":"2025-05-06T15:50:43Z","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:56:00.393806Z"},"links":{"cited_paper":"/paper/2407.14394","citing_paper":"/paper/2505.03643"},"observation_digest":"sha256:17b0c427b1c608b9784ff953fa747566fa755fc464d9eba07e8da6b88529fdab","observation_id":"1faf4d26-b6df-4de9-a165-a05822cebe31","resolution":{"observed_at":"2026-08-15T23:56:00.435094Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"2505.03643","last_updated":"2025-05-06T15:50:43Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-18T20:10:45.798573Z","submitted_at":"2025-05-06T15:50:43Z","title":"BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":4,"verified_fuzzy":10},"total_outbound_references":22},"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 19 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2505.03643."}