{"as_of":"2026-08-21T01:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2919e7aceca8c5e1beab356b6cb943ab795639a2b6fb96cc28f2972672a4ba26","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T04:57:25.453030Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.23203/citation-record","integrity":"/paper/2605.23203/integrity","json":"/paper/2605.23203/citation-record.json","paper":"/paper/2605.23203"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Roadmap for artificial in- telligence safety assurance","venue":null,"work_id":"20b6123e-9a31-426d-aeaa-a2596446acdb","year":2024},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:03bed4bbf8a7d813a785c753643b07a206cc798ebb5dfc5f84421de7afd4e953","observation_id":"c05d7022-4bf2-4641-92ea-5197e6891129","resolution":{"observed_at":"2026-05-25T12:57:02.277298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"EASA concept pa- per: Guidance for level 1 & 2 machine-learning applications","venue":null,"work_id":"91c3173b-6267-40b9-a75d-f4491df9fc33","year":2024},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:eaafd664b3d947fa0e295a95c6dbcd81e1e676dc818e5b0ff17ebc2f5704f229","observation_id":"b36a5fec-8439-4f35-9703-ab3aca20026a","resolution":{"observed_at":"2026-05-25T12:57:02.258834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The sample complexities of global Lipschitz opti- mization","venue":null,"work_id":"e5187b5a-c01a-4f54-bb1d-31a4fb7778a2","year":2021},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:d1cf95b113c9e5077301b03f8eccb28316721253cc941d32486a9988f573bd95","observation_id":"f2444d1a-1a9a-436b-a8a4-1fe27c83465f","resolution":{"observed_at":"2026-05-25T12:57:02.247270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.00498","last_updated":"2021-08-31T01:29:56Z","snapshot_observed_at":"2026-08-16T17:59:55.152335Z","submitted_at":"2021-08-31T01:29:56Z","title":"The Second International Verification of Neural Networks Competition (VNN-COMP 2021): Summary and Results","version":1},"cited_work":{"arxiv_id":"2109.00498","doi":"10.48550/arxiv.2109.00498","metadata_source":"arxiv_reference","pith_arxiv_id":"2109.00498","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The sec- ond international verification of neural networks competition (VNN-COMP 2021): Summary and results","venue":"arXiv (Cornell University)","work_id":"ec26f06b-4785-4204-ab04-b7a861696f8b","year":2021},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"cited_paper":"/paper/2109.00498","citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:48f2208cf4750c8109ad5a654940a13db6e3a1118d18895cf17a4fbb5eab361a","observation_id":"89e44501-e8e5-4b5e-ac42-4f37a8cc16eb","resolution":{"observed_at":"2026-05-25T05:00:22.278321Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Neural network based runway landing guidance for general aviation au- toland","venue":null,"work_id":"c11633ac-43a2-411c-9435-6c79d8ab878b","year":2021},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:9bf1e50d24bb55c3e1f9908347eabfe21f3511a3296427e915ec1f3c83032226","observation_id":"befc7769-a0a5-48e9-acd2-68bda63125cf","resolution":{"observed_at":"2026-05-25T12:57:02.273807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Certifying geometric ro- bustness of neural networks","venue":null,"work_id":"fe365bf1-29ab-405c-a80e-2290f9f1f33d","year":2019},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:d287fe675e6ec327ffdf66add37b0698c5050e9d0b4faa8bef75610d49b011d5","observation_id":"e3633fe2-fe4b-42c2-9e7d-d9df46d8a615","resolution":{"observed_at":"2026-05-25T12:57:02.254389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Verification of geometric robustness of neural networks via piecewise linear approx- imation and Lipschitz optimisation","venue":null,"work_id":"326f5e20-1e2b-4805-b2c8-69d9d69cf53e","year":2024},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:19b189d9ac5fb9fb56657beaabc62af95b922223ca22bd16bd9aa2ef1f0e3702","observation_id":"08857bfe-0fed-4663-b374-33f286b7e794","resolution":{"observed_at":"2026-05-25T12:57:02.280659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient verification of ReLU- based neural networks via dependency analysis","venue":null,"work_id":"cf6ee877-2777-496a-aaf3-323cd79f6424","year":2020},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:c2779cc3e247f496896a9ac0a75582badacfe55c297edcb8b95f26333b724d67","observation_id":"6c37bfb7-d146-46a9-bffb-69c2af87c822","resolution":{"observed_at":"2026-05-25T12:57:02.269977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The fourth international verification of neural net- works competition (VNN-COMP 2023): Summary and re- sults","venue":null,"work_id":"baaa8898-a13e-4d5e-ad2d-dd0255f5083c","year":2023},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:ef27ac379dc18d4bcd37442e5b2ce5ee5382430ff81ea04932d3bdfd2097339a","observation_id":"9de35ddf-b0ea-40fa-a3bd-81e70abd0cd5","resolution":{"observed_at":"2026-05-25T12:57:02.243237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The right (angled) perspective: Improving the understanding of road scenes using boosted inverse perspective mapping","venue":null,"work_id":"b21043c8-0101-4d7e-8a6f-8d33a2261c69","year":2019},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:005b35e88bd2b22b9563105a92c7cae0a4a855496046fc39caf5defe438a4334","observation_id":"f79a4f0a-e2d2-4ade-bf74-1e4cc84d3ab3","resolution":{"observed_at":"2026-05-25T12:57:02.283980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Homography-based state estimation for autonomous UA V landing","venue":null,"work_id":"a573fc8a-bcec-4cde-a1a8-93b8b3a8e2af","year":2017},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:103a4d37cf78f2efaaee3144fd13ed897dfb4d30826d6196fc8acba087f2097c","observation_id":"a5057fd3-6713-4361-9d2e-0a07edffde83","resolution":{"observed_at":"2026-05-25T12:57:02.313684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Real-time geometry-aware augmented reality in minimally invasive surgery.Healthcare technology letters, 4(5):163–167","venue":null,"work_id":"6aecafb2-0354-4daa-b04d-882f20152839","year":2017},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:1d8814d84ea770a496953d82292a8d289f283d08e3fba550b88152fb2c28e1f3","observation_id":"c920f293-3c5e-4d79-b34e-95446d4c4032","resolution":{"observed_at":"2026-05-25T12:57:02.290578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01349","last_updated":"2024-10-08T15:56:45Z","snapshot_observed_at":"2026-08-16T13:55:57.082467Z","submitted_at":"2024-05-02T14:58:44Z","title":"Position: Towards Resilience Against Adversarial Examples","version":2},"cited_work":{"arxiv_id":"2405.01349","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.01349","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Po- sition: Beyond robustness against single attack types","venue":null,"work_id":"54d60c61-3e86-4d72-899e-c265da128dc5","year":2024},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"cited_paper":"/paper/2405.01349","citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:c8099e327525c296010ce4525c7972ca2f02f85a61e7126c846d575652c1dabc","observation_id":"788b9036-37b3-4625-9bad-6637c5640586","resolution":{"observed_at":"2026-05-25T05:00:22.272737Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"LARD - Landing Approach Runway Detection - Dataset for Vision Based Landing","venue":null,"work_id":"90603bd4-c564-4c7e-be52-629ee15e1a6e","year":2023},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:47f7ddc755de7cf579ce88faadcaab54e2832eb46e07ef3b03de26ba01baa5f2","observation_id":"cb955591-9938-4605-9f66-7263fbf8ceb3","resolution":{"observed_at":"2026-05-25T12:57:02.287072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.06627","last_updated":"2018-05-17T15:24:31Z","snapshot_observed_at":"2026-08-19T04:45:50.554716Z","submitted_at":"2018-02-19T13:49:15Z","title":"Robustness of Rotation-Equivariant Networks to Adversarial Perturbations","version":2},"cited_work":{"arxiv_id":"1802.06627","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.06627","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robustness of Rotation-Equivariant Networks to Adversarial Perturbations","venue":"cs.CV","work_id":"ef5e7ebf-83a0-406c-8ded-926c8e6822f2","year":2018},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"cited_paper":"/paper/1802.06627","citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:254ececa2e02a64e9dc52b103362dcb5a987f4d86dd13f47ad6dc4e0701c278b","observation_id":"352c899c-4190-4f3d-b6c0-e9b913157def","resolution":{"observed_at":"2026-05-25T05:00:22.266815Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exploring the landscape of spatial robustness","venue":null,"work_id":"de4582c1-12e4-44b4-8e8e-340f4878a198","year":2019},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:c7c8bdf39a9f6926bbcaef923fe30d99d57b27c0f1615cb1fb80d023f115dbe8","observation_id":"26341140-4c16-49de-b04d-c4f48dea5fa6","resolution":{"observed_at":"2026-05-25T12:57:02.230955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The robustness of deep networks: A ge- ometrical perspective.IEEE Signal Processing Magazine, 34(6):50–62","venue":null,"work_id":"726f8ccc-765d-4a1d-8282-a7d9ccc93e56","year":2017},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:dea6f3496be541cf9a636aa631a5ccf2844047b51f7d0eec7a541a13c225482b","observation_id":"743f95c8-331d-47a9-8c04-567ea2772895","resolution":{"observed_at":"2026-05-25T12:57:02.234759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fuzz testing based data augmentation to improve robustness of deep neural networks","venue":null,"work_id":"bc75e00d-8289-41f8-a2b9-c6b2e72dc649","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:8cbeaeb0c74ea42f88825db78ec8ef7e3bdad5a7795341de2361f40407253e74","observation_id":"6f24f95b-1605-4e10-9d29-d5d829aa4900","resolution":{"observed_at":"2026-05-25T12:57:02.238348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Explaining and harnessing adversarial examples","venue":null,"work_id":"89e5281e-a21c-43a5-8b94-48f4a65bead4","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:c9418a3cfe353014c21f1b63710e351a0987c6a1273f33203b476d85c7ca3737","observation_id":"e9bd4b8c-c976-488b-87bb-017586f36599","resolution":{"observed_at":"2026-05-25T12:57:02.262955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient verifica- tion of neural networks against LVM-based specifications","venue":null,"work_id":"b6123ad3-56d9-427e-9d8e-6f91a597883e","year":2023},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:8a09fb8fa02e6eb7b42253135771e777f16b12fe83596faaaaff4515848d7480","observation_id":"ad43252b-42fd-4872-abc0-d87c6a132053","resolution":{"observed_at":"2026-05-25T12:57:02.250594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cambridge University Press","venue":null,"work_id":"5f52fb98-f8a4-41a6-ba0e-74a61fbdc4dc","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:52cf92a0d96a1c51086ae2860b2dbe7153dac6b46fb2d31db46d13e0abe870cc","observation_id":"20d430d3-9f50-4e80-be38-e5fc15f80466","resolution":{"observed_at":"2026-05-25T12:57:02.266281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards compositional adversarial robustness: Generalizing adversarial training to composite semantic perturbations","venue":null,"work_id":"a469c18c-0e8a-4218-8f5b-745b09deaa82","year":2023},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:136170579c98b72b11e6566cee301172909aafba0dd32cfaf2fc36856c3fda09","observation_id":"c136f3f4-0e54-43ad-9b77-656d72b731f1","resolution":{"observed_at":"2026-05-25T12:57:02.305297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robustness certification of visual perception models via camera motion smoothing","venue":null,"work_id":"cb98ad69-17a5-437e-90b4-ab6229d32e0b","year":2022},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:e5a1a00bb7b2e605266bd6340c08c5ec440ddc8e3277f84099fc96073827677a","observation_id":"24caefb5-13c7-4509-a326-b539f623ebcd","resolution":{"observed_at":"2026-05-25T12:57:02.388741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robustness ver- ification for perception models against camera motion per- turbations","venue":null,"work_id":"ce616403-91d9-442d-9e7f-04fe874378f3","year":2023},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:b7fc27f6c86885a36ed0c26dc374cda863b8d97ee11a72de14c6c7206d6577d0","observation_id":"3cf25dd0-c4c0-4ce0-baa9-babe76b04257","resolution":{"observed_at":"2026-05-25T12:57:02.396242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pixel-wise smoothing for certified robustness against camera motion perturbations","venue":null,"work_id":"c242e44b-1bf7-4add-8d84-d1f3ac248277","year":2024},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:7972fbffb90f781f2c7065aafbbc10db168ce57d2108c46b0f9dfed35b9668cc","observation_id":"c2b77a4d-f6ba-4b75-8fcf-1ad986e8b862","resolution":{"observed_at":"2026-05-25T12:57:02.403449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"When deep learning meets polyhedral theory: A sur- vey.INFORMS Journal on Computing","venue":null,"work_id":"7d913cde-6279-47db-9084-7d532804ee0d","year":2026},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:f5c405cd8c47d67d119aff55da2891791cf17eefdf681eda7b755194d99dcd95","observation_id":"3b5c531c-4520-4ff6-a25e-b57bdbf47fd6","resolution":{"observed_at":"2026-05-25T12:57:02.385414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03000","last_updated":"2026-04-14T16:40:44Z","snapshot_observed_at":"2026-07-06T19:27:25.061335Z","submitted_at":"2024-10-03T21:20:46Z","title":"Towards Generalized Certified Robustness with Multi-Norm Training","version":3},"cited_work":{"arxiv_id":"2410.03000","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.03000","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards Generalized Certified Robustness with Multi-Norm Training","venue":"cs.LG","work_id":"e157279c-40c7-481f-ab81-286b3cbb51d7","year":2024},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"cited_paper":"/paper/2410.03000","citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:e797b5efb76c4bbf116620494a300adee7e9fd10b9a24ddbd5af2c77694c80f2","observation_id":"a2364f73-e1d1-471d-b5ef-2492084dffb6","resolution":{"observed_at":"2026-05-25T05:00:22.283759Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Geometric robustness of deep networks: analysis and improvement","venue":null,"work_id":"1c1d75e0-1d70-4ce7-803b-560006ddd1a4","year":2018},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:2c0e097c365a18a1aa1382300d9f36fef814c882bd9ca06578fb2192242eeb0d","observation_id":"647c1de3-dd56-4bdd-b0b0-9186e198f68e","resolution":{"observed_at":"2026-05-25T12:57:02.377796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reluplex: An efficient SMT solver for verifying deep neural networks","venue":null,"work_id":"41b7f13f-2b0a-4f17-8a02-c0ac8bc5e1b2","year":2017},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:8e607942118fd79b3443dd776dfc6c273e1baa5e42a4bc31f32cc4926ccafd47","observation_id":"71b2ed40-aa72-4991-8fff-dcbfb07ad764","resolution":{"observed_at":"2026-05-25T12:57:02.381532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2512.19007","doi":"10.48550/arxiv.2512.19007","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The 6th international verification of neural networks competition (VNN-COMP 2025): Summary and results","venue":"mediaTUM  (Technical University of Munich)","work_id":"80333d64-d5f0-4f74-a560-fb32d4526bf1","year":2025},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:191f74ae6e15c28c762557fcfcdf37563f25ffa7e63b1dffc6afbf4039aeeb7b","observation_id":"0b8fcea0-3fbe-463d-a18f-e207dc1ab86f","resolution":{"observed_at":"2026-05-25T05:00:22.255333Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-26T00:24:21.941378+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-26T00:24:21.941378+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.11373","last_updated":"2018-11-28T03:36:25Z","snapshot_observed_at":"2026-08-19T04:11:16.772765Z","submitted_at":"2018-11-28T03:36:25Z","title":"Formal Verification of CNN-based Perception Systems","version":1},"cited_work":{"arxiv_id":"1811.11373","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.11373","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Formal Verification of CNN-based Perception Systems","venue":"cs.LG","work_id":"a1f6eaa7-bb36-428d-a322-062afefa8bd5","year":2018},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"cited_paper":"/paper/1811.11373","citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:f9f421f98a393187f03eb66551e8474c39c277caa0157fda8662a8d7cf7dc39e","observation_id":"3d7e6174-46c0-4a14-8374-a553ffd0ba72","resolution":{"observed_at":"2026-05-25T05:00:22.261617Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deep learning.Nature, 521(7553):436–444","venue":null,"work_id":"cd031be7-112e-4f06-ae64-f1e75572300b","year":2015},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:ae91d5202038d4b4a86273aa0aa86906bb72ccfe52ad1e8892636bbb389a505a","observation_id":"ff029d6b-d760-4185-af25-ac18a32a7b01","resolution":{"observed_at":"2026-05-25T12:57:02.406645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SoK: Certified robustness for deep neural networks","venue":null,"work_id":"cdda9d55-d19a-4dad-a842-a6c9a5c3f5b3","year":2023},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:9e525a59f186dedae195345f45fe25010578f746f8a0b896c95da89cff7282eb","observation_id":"2f44c39a-3779-4c81-aeb2-8cbe08c1bba3","resolution":{"observed_at":"2026-05-25T12:57:02.353187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Al- gorithms for verifying deep neural networks.Foundations and Trends in Optimization, 4(3-4):244–404","venue":null,"work_id":"cb263a88-8865-4343-96b1-735b656d7d02","year":2021},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:99edcf0b21ebbf4cc1929911ac5ac24689e83a268e014e47630d4008f30483d1","observation_id":"ad18fb52-af84-4b67-b1de-654c178b8446","resolution":{"observed_at":"2026-05-25T12:57:02.367903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Vision-centric BEV perception: A survey.IEEE TPAMI","venue":null,"work_id":"7c8242bf-7c6f-4f41-bfa0-fe3cc2d79f58","year":2024},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:4e8f7ea49b639302976d198de1ffb476b57ccd3c0e36553924f0e43f806a159a","observation_id":"c74a9e7f-02cc-44b6-b13d-9c14a660d9cd","resolution":{"observed_at":"2026-05-25T12:57:02.410189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Global optimization of Lipschitz functions","venue":null,"work_id":"27465ea1-15ba-40ed-bb0d-d9fcbaa9edcc","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:c436a323d50baac11014ca1f39b7fd517bdd237bde709df9a4d248067e948994","observation_id":"6ee41bad-09a6-424a-a083-ddc29cf8a220","resolution":{"observed_at":"2026-05-25T12:57:02.450046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09361","last_updated":"2023-10-13T19:08:21Z","snapshot_observed_at":"2026-08-20T06:22:02.024669Z","submitted_at":"2023-10-13T19:08:21Z","title":"Is Certifying $\\ell_p$ Robustness Still Worthwhile?","version":1},"cited_work":{"arxiv_id":"2310.09361","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.09361","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Is certifyingℓ p robustness still worthwhile?","venue":null,"work_id":"55daf080-7ad8-41be-8b58-4baf102d4e7a","year":2023},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"cited_paper":"/paper/2310.09361","citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:30b9d22399240d67741092afa4ca16ec1ee836028eab3990b80e487523856153","observation_id":"1b82ae8b-4b7a-483b-a19b-72b7cd6c8cd3","resolution":{"observed_at":"2026-05-25T05:00:22.234821Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Universal adversarial perturba- tions","venue":null,"work_id":"57024b31-7c20-4cfa-957e-e2ca221c9f7b","year":2017},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:ec3bde3d6c6f3e04a634f23f474eadbc43a4bd6fcbe85f62342441293fe48032","observation_id":"da4df1a6-2e18-46ac-8491-9fa6da1ef99d","resolution":{"observed_at":"2026-05-25T12:57:02.341986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Moss, Mykel J","venue":null,"work_id":"4573fb3e-3aec-48d3-ba1d-53b000442890","year":2024},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:a6b995ef0ad46cc057d06d2c999184d3ede6e62d06ff052c9f9277f2489f6bd8","observation_id":"01446bfc-36b7-4387-a579-a8dcdb5767a8","resolution":{"observed_at":"2026-05-25T12:57:02.335246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reachability analysis of deep neural networks with provable guarantees","venue":null,"work_id":"c8c860ef-cdfb-4cae-b8ed-08c901f06a1c","year":2018},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:b4c8c4ec9fbfaf05fba80f7753ddc57a61ed949573e6618b25cf2d281755bcab","observation_id":"e95654b4-050d-4fd4-ad32-3a88c8eeb7cd","resolution":{"observed_at":"2026-05-25T12:57:02.338577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Landing system development based on inverse homography range camera fu- sion (IHRCF).Sensors, 22(5):1870","venue":null,"work_id":"eddb3d78-e446-4a31-92b5-935cb94bade7","year":2022},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:496b0247e76142797f7113dbd07adeac156f110c8a494aba8cb4a68e01f76756","observation_id":"bcca549c-bef4-4c0e-a5b6-77b2cd3547b2","resolution":{"observed_at":"2026-05-25T12:57:02.332088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Neural network verification with branch-and-bound for general nonlinearities","venue":null,"work_id":"c3caf98d-f85f-4f33-bf02-2831d1267305","year":2025},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:aab0b5beb1e7d3641492061d7eac582fb9b9b4660d510fe89f9f9e24b2242f1e","observation_id":"80190778-64f0-4691-b2fe-c467e7e8e52f","resolution":{"observed_at":"2026-05-25T12:57:02.328491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An abstract domain for certifying neural networks","venue":null,"work_id":"96282489-34df-4ddb-be7f-069a986b3059","year":2019},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:47b4fb440c6a29a1f367b739814d25625966c3986d90864ad621ad328d957463","observation_id":"9aec5a05-9a3a-4027-816a-15c7b74a053c","resolution":{"observed_at":"2026-05-25T12:57:02.345775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10571","last_updated":"2020-05-01T07:29:34Z","snapshot_observed_at":"2026-08-20T04:15:35.155856Z","submitted_at":"2017-10-29T07:27:57Z","title":"Certifying Some Distributional Robustness with Principled Adversarial Training","version":5},"cited_work":{"arxiv_id":"1710.10571","doi":"10.48550/arxiv.1710.10571","metadata_source":"arxiv_reference","pith_arxiv_id":"1710.10571","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Certifying some distributional robustness with principled adversarial training","venue":"arXiv (Cornell University)","work_id":"f13c7954-0712-439e-8efc-0f9b560646d0","year":2017},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"cited_paper":"/paper/1710.10571","citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:e9442ee1cfc9fb58750866d903bb4f0979cb1184e3567b28280107ac780e1097","observation_id":"ef9cc49c-c950-4b3b-b723-9ffa61335002","resolution":{"observed_at":"2026-05-25T05:00:22.240908Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In- triguing properties of neural networks","venue":null,"work_id":"cbd9bd68-80c9-4850-8373-0575f2aedf71","year":2014},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:f48fa5646ec9f0b1b8b8bb5e6b3328202b33ede57775b2132a92b8fab454e096","observation_id":"f8f3badf-61eb-43c6-bbf5-47d1d9249ad5","resolution":{"observed_at":"2026-05-25T12:57:02.446430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A new technique for fully autonomous and efficient 3D robotics hand/eye calibra- tion.IEEE Transactions on Robotics and Automation, 5(3): 345–358","venue":null,"work_id":"df6d6bda-316e-49c2-a109-d6e8e092b3aa","year":1989},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:cbfe5c4c8b15cd2833d488b38401c4e8837148f3bb61d49747b45bd63b975be7","observation_id":"a14799e7-5efa-4cb1-b4a2-ed09168e9b13","resolution":{"observed_at":"2026-05-25T12:57:02.297736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"To- wards verifying the geometric robustness of large-scale neu- ral networks.Proceedings of the AAAI conference on AI","venue":null,"work_id":"d16af5ca-9a41-410d-b74e-211258c3978b","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:8dfe2cf9c7343eff20b7c445351a26d95392804491c38541e7a615757980f5ff","observation_id":"fd0bd4e6-99ae-4197-9fe7-a572cf16929a","resolution":{"observed_at":"2026-05-25T12:57:02.301426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Art-point: Im- proving rotation robustness of point cloud classifiers via ad- versarial rotation","venue":null,"work_id":"1bb389d3-39ba-49d5-9efd-6f69263305b5","year":2022},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:9aa18444c672a714393170d3501217f2dfefefefee9271c8a8b324856f349131","observation_id":"13db431d-d913-4570-9bcb-b17e1e6ee529","resolution":{"observed_at":"2026-05-25T12:57:02.309898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Beta-CROWN: Efficient bound propagation with per-neuron split constraints for com- plete and incomplete neural network verification.NeurIPS, 34","venue":null,"work_id":"cb5d0f52-1ac9-47cf-a4d4-9d40fb8d9a2a","year":2021},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:5f4cda02976cc54c933074c7351983d816cbcc4986974416b393cf23d7e98dba","observation_id":"147cf946-da7e-4cd1-adfe-f4bd211d003a","resolution":{"observed_at":"2026-05-25T12:57:02.324718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deobfuscating machine learning assurance and approval","venue":null,"work_id":"3edd382a-e374-426e-acff-7819c1e7a650","year":2024},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:61525c9d57ce2073cf70adc1480bef3ae25602d6989a87790ea36e12e40390cb","observation_id":"ff47aa0f-e154-4fed-ba5e-1ce16159b25b","resolution":{"observed_at":"2026-05-25T12:57:02.293928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Toward certified ro- bustness against real-world distribution shifts","venue":null,"work_id":"7fee0c9a-b8c8-47be-96c9-ccb652497280","year":2023},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:54847984c0135f95d02bd9ec04e5523b9fec1cd702f76f65af3666947fa8e755","observation_id":"4e73e125-9692-4db8-9a6b-9ff30c2929eb","resolution":{"observed_at":"2026-05-25T12:57:02.317471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Marabou 2.0: a versatile formal analyzer of neural networks","venue":null,"work_id":"1505d713-b965-4337-b6a6-c81ada4c21a7","year":2024},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:fe9d7547eb2ce6a240b6c60d5e9f766e4294d2607d2e07d150ca98eb53ce68b5","observation_id":"9e1129b2-5654-434d-9837-99c54f3851b9","resolution":{"observed_at":"2026-05-25T12:57:02.321146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1801.02612","last_updated":"2018-01-09T19:03:32Z","snapshot_observed_at":"2026-08-18T13:45:39.627332Z","submitted_at":"2018-01-08T18:51:59Z","title":"Spatially Transformed Adversarial Examples","version":2},"cited_work":{"arxiv_id":"1801.02612","doi":null,"metadata_source":"pith","pith_arxiv_id":"1801.02612","snapshot_observed_at":"2026-07-01T15:25:48.596888Z","title":"Spatially Transformed Adversarial Examples","venue":"cs.CR","work_id":"f336fc9b-949a-4acd-8e63-6c1153063756","year":2018},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"cited_paper":"/paper/1801.02612","citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:d07bfddd3cdb95523f1638cba4de1a62265732f06c9e7a1b133cbefc46d48261","observation_id":"10512bd6-a29a-46c1-a902-caa8bc8745ec","resolution":{"observed_at":"2026-05-25T05:00:22.289822Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Automatic perturbation analysis for scalable certified robustness and beyond","venue":null,"work_id":"b9a6daef-15d0-4338-be37-741f6f33c5e1","year":2020},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:693a6dbbc3536cdfbeab2ed5d0793f90c0059cdd04933efd0c01e0af68ad4b67","observation_id":"6809214b-9aa0-41b0-b442-c29bb981d2fc","resolution":{"observed_at":"2026-05-25T12:57:02.453523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast and Complete: En- abling complete neural network verification with rapid and massively parallel incomplete verifiers","venue":null,"work_id":"59d8a101-34b5-4e2c-be51-9b277a26af32","year":2021},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:5a93a164936be4039b84ca1b130157e61bd22f5ffc71cc7c8a355cadc014a0e5","observation_id":"3c9b4827-c04e-4ff5-9bcd-382fae6f80f6","resolution":{"observed_at":"2026-05-25T12:57:02.438036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Provable defense against geometric transformations","venue":null,"work_id":"17743676-c01c-4c25-ba0c-39267151576a","year":2023},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:6ff183d76b65ffed6b1dfd88537be949ed197bec752c216f0f145710cb319f0a","observation_id":"ab00a156-ff76-4557-b01e-4f2f2671db8d","resolution":{"observed_at":"2026-05-25T12:57:02.432488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient neural network robustness certi- fication with general activation functions","venue":null,"work_id":"5e0ec295-1000-4ff3-a937-21bd4036397c","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:36be6fb834261adf06cdffea9d059c88b06ce3fb09025d6b4558869a4916b55a","observation_id":"33d32b05-c2f5-45a3-b94c-12cc165ba19c","resolution":{"observed_at":"2026-05-25T12:57:02.421628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"General cutting planes for bound-propagation-based neural network verifica- tion","venue":null,"work_id":"beab7f58-8910-4da7-af36-b25009155404","year":2022},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:3978c0dbd2d29c458f5b764f91798cc03f922eec30f7dc00da128c1197f58e11","observation_id":"6b2e97d3-1b6c-48c7-87f2-208124a89a25","resolution":{"observed_at":"2026-05-25T12:57:02.417811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b73febd9-3600-4c23-b8e3-c62b748cc912","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:7aa49df5e23f0d1f5f86cee7cbb8136a26f8ca37dc5e0d3ce657701efbbcd2e5","observation_id":"a88ff804-d818-402a-a50e-621370f74e93","resolution":{"observed_at":"2026-05-25T12:57:02.424943Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sample images from each dataset","venue":null,"work_id":"2e6462ad-b8b6-45e1-8274-4a90d4cf1f80","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:d5467dbfe1f36d2a1105eddf20991a3905cd16bb3516ed820f08748c6ff11ce7","observation_id":"35b23dde-6a07-4386-9c50-6b7f1f1eafdc","resolution":{"observed_at":"2026-05-25T12:57:02.428642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In this case, bilinear interpolation relies on padding mechanisms to impute missing pixel values","venue":null,"work_id":"a5fa886a-4634-4637-9bcb-1eb7bec1cf4b","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:e3aae1876bbe5d03ad0d61453fa056998f14345391ff42e0c77158f552cc8455","observation_id":"4fe11547-cd9e-4437-b233-f2cdaaf0e412","resolution":{"observed_at":"2026-05-25T12:57:02.442968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e8da14ed-0f86-482f-8db8-deae891d53a8","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:0a513802b62bfb091fce6428e160c33fbe775ef17b64aff01f770cd68872c249","observation_id":"c5f68c02-e9cb-4d9b-9b7b-b6d54fe963e1","resolution":{"observed_at":"2026-05-25T12:57:02.392082Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d4fc4e77-cb06-410a-a60f-70e7752155d1","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:cc257ecf45c0a499d9e4d2a35611fd19afa901dbdf8876a38973d8ca22c441da","observation_id":"d652b99c-d8f4-41da-b353-09c5d3d22032","resolution":{"observed_at":"2026-05-25T12:57:02.413678Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In this context, t=0and Eq","venue":null,"work_id":"d0eb3e1d-cf44-43f4-81f1-1c247a465eda","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:e866039cb3a63c8211cb1ee80669590344bef9849cdc86546f3331ba861f611c","observation_id":"180eab68-87b1-4859-90d1-50bf4cdcebb4","resolution":{"observed_at":"2026-05-25T12:57:02.399677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"92325967-d609-4619-bb29-92c42ad4b445","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:a48b72211556c2dbc3f8450cb426b78af6c2665fc9bf178830de52d6cb4493dc","observation_id":"8059839b-48c2-463b-b9e1-902785547bcd","resolution":{"observed_at":"2026-05-25T12:57:02.364031Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"13 and derive a majorant for the gradient of the inverse transform ∇⊤ ∆ψT −1 , more particularly along each coordinate by maximizing ∂u0 ∂∆ψ and ∂v0 ∂∆ψ independently","venue":null,"work_id":"3290dec0-9031-4b4b-bd42-f7eba10d8480","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:976aeb764edd40a908b820e087f7691ee7dcc82b1adf5257b8183b2eef0bc07f","observation_id":"c2f099de-1a17-467e-bc61-c762577063e1","resolution":{"observed_at":"2026-05-25T12:57:02.357172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"[7] proposes to usefbound =f κ1+κ2 2 + L 2 (κ2 −κ 1)","venue":null,"work_id":"b67c8d04-1097-4694-8506-ed8a4d0198c5","year":null},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:0ffcc5b738ed0c4a5e4c43a1af570a3fd91d0fee1c70eac4c6c5dcbe59962395","observation_id":"2902f77e-6664-4fa1-bd9d-22933083e6df","resolution":{"observed_at":"2026-05-25T12:57:02.360742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7d494203-ee6b-42e2-9e19-3fa6b730cd4a","year":2021},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:21cca1681498b5991b6b9a188fe2bd237b10b6c095ed8d65b3da0b163d5f0bb5","observation_id":"dce77132-c4e9-43b7-9a0e-86a790169394","resolution":{"observed_at":"2026-05-25T12:57:02.373546Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2, this section presents extended robustness results on additional networks of the VNN-COMP benchmarks","venue":null,"work_id":"7afbed43-e753-49ed-9b02-17a177308ebf","year":2026},"citing_paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-25T04:57:25.453030Z"},"links":{"citing_paper":"/paper/2605.23203"},"observation_digest":"sha256:f4ae3ff2f332f1cd7e7eeaeefa60a2ef352bbf7fc5d3b0e433e8c88e1b09efc4","observation_id":"b9b9524d-f298-4a93-b4ba-2ce42cb5bfba","resolution":{"observed_at":"2026-05-25T12:57:02.349355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.23203","last_updated":"2026-05-22T03:37:34Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-15T00:31:02.461636Z","submitted_at":"2026-05-22T03:37:34Z","title":"Lipschitz Optimization for Formal Verification of Homographies"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":9,"verified_fuzzy":55},"total_outbound_references":69},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 0 inbound Pith citation observations for arXiv:2605.23203."}