{"as_of":"2026-08-07T17:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c104d8e2ca259fc84c50ff973455adfe46965946a522ce7a32e94bea7c044d75","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:54:44.332411Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2507.17453/citation-record","integrity":"/paper/2507.17453/integrity","json":"/paper/2507.17453/citation-record.json","paper":"/paper/2507.17453"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.123418Z","title":"Optimization and abstraction: a synergistic approach for analyzing neural network robustness","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.123418Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:01f645c1a977693adb7130508fee7f9c90cb7cb3d66ee1dc2c771883f8ada190","observation_id":"2e04bee5-d4c7-4f72-8ab8-f81a649b9020","resolution":{"observed_at":"2026-08-06T14:54:44.123418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.359466Z","title":"Strong convex relaxations and mixed-integer programming formulations for trained neural networks (2018), 1811","venue":null,"work_id":"f6a67c77-6b82-4cde-ba42-f81b3d899eb8","year":2018},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.126994Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:66857670bc991137c87b92c21d70702f8bca579f9f08b47585890269edcba65f","observation_id":"4cb794c6-01a2-43fa-ab8a-fb2b26456b84","resolution":{"observed_at":"2026-08-06T14:54:45.362579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.130096Z","title":"Square attack: a query-efficient black-box adversarial attack via random search","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.130096Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:78fd7e1afbdd0c6971a30aef3725e9300e37cd793e838d04153b80286bfa93e2","observation_id":"8549a5d5-2f66-47c6-b2eb-0d9993d1b448","resolution":{"observed_at":"2026-08-06T14:54:44.130096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.06588","last_updated":"2025-08-26T14:58:14Z","snapshot_observed_at":"2026-08-01T20:43:28.226689Z","submitted_at":"2019-09-14T12:44:35Z","title":"Branch and Bound for Piecewise Linear Neural Network Verification","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.06588","snapshot_observed_at":"2026-08-06T14:54:44.133910Z","title":null,"venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.133910Z"},"links":{"cited_paper":"/paper/1909.06588","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:2c7fcaccbce09be6bf7a21d47889088ef4a429179c66ed26f87cb8b15f0fd948","observation_id":"d382cb40-30d4-4585-a7f3-ed89d0d1a810","resolution":{"observed_at":"2026-08-06T14:54:44.133910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.351203Z","title":"Branch and bound for piecewise linear neural network verification","venue":null,"work_id":"a7ae3130-dc56-4793-9027-77533265669a","year":2020},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.137771Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:b39dd94ed10891f6360e70da8c182a42eb2ffd2184e5c1dd5dfb46213d4443bd","observation_id":"ad51bae3-ca1d-4ab8-96f2-b10b6abc5dd3","resolution":{"observed_at":"2026-08-06T14:54:45.354165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.140982Z","title":"Towards evaluating the robustness of neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.140982Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:ca24ef8b9fdd4ac3b93f7849616cdeb89fbde35e54324dec1c52da119b227794","observation_id":"2d832d43-b319-439b-9c47-d1c64053f533","resolution":{"observed_at":"2026-08-06T14:54:44.140982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-68167-2_18","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.516618Z","title":"Maximum resilience of artificial neural networks","venue":null,"work_id":"29614efa-3f8c-425c-ae9c-3cd2903e2f21","year":2017},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.144448Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:78625acf525e5196834f0e623c3943bcbfc0587ced93c1b1e1fb7112d52c40f4","observation_id":"0268fe9a-65ad-4486-9d2f-1bf7530c8180","resolution":{"observed_at":"2026-08-06T14:54:44.519716Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.342874Z","title":"A survey of algorithms for black-box safety validation of cyber-physical systems","venue":null,"work_id":"80610351-6a58-4fdc-a27b-adf18351bedd","year":2021},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.147563Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:325d6750d8124132dbe3ab0547f5bf2cfa913f0454cfd08a224fc31fb2f51e6e","observation_id":"923e071e-b430-4c69-8bc4-32f52e8dc73d","resolution":{"observed_at":"2026-08-06T14:54:45.345811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12418","last_updated":"2021-04-26T09:16:27Z","snapshot_observed_at":"2026-08-02T17:33:24.795882Z","submitted_at":"2021-04-26T09:16:27Z","title":"Fast Falsification of Neural Networks using Property Directed Testing","version":1},"cited_work":{"arxiv_id":"2104.12418","doi":"10.48550/arxiv.2104.12418","metadata_source":"pith","pith_arxiv_id":"2104.12418","snapshot_observed_at":"2026-08-06T18:16:30.548575Z","title":"Fast Falsification of Neural Networks using Property Directed Testing","venue":"cs.AI","work_id":"f988d8fb-8de7-43fc-ab0b-67d1a36aac4f","year":2021},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.150460Z"},"links":{"cited_paper":"/paper/2104.12418","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:c4d62bf7a957d264ae1708a9dade0706f131184e588e11f749557239e3e910ab","observation_id":"fce475f3-dc33-42a5-9949-547eb9b50a16","resolution":{"observed_at":"2026-08-06T14:54:44.509996Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.334580Z","title":"Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming","venue":null,"work_id":"842527b7-79b2-414b-a632-3e7a8727782a","year":2020},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.153773Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:ed7b82568e65b221eb2f75bfeab1c040f0c3f5fba6233e060c9bcaff473d2cb8","observation_id":"3869d7b5-641e-4e92-8dfb-9032fb88ec37","resolution":{"observed_at":"2026-08-06T14:54:45.337626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.06718","last_updated":"2021-04-14T09:22:42Z","snapshot_observed_at":"2026-07-06T10:59:29.035923Z","submitted_at":"2021-04-14T09:22:42Z","title":"Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.06718","snapshot_observed_at":"2026-08-06T14:54:44.156711Z","title":"Improved branch and bound for neural network verification via lagrangian decomposition","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.156711Z"},"links":{"cited_paper":"/paper/2104.06718","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:dcf1c64baaaecd96f1052a171afc02b421707c30935355a366bade53fd646bf6","observation_id":"024baced-ad56-48f9-aaf9-e4d28adf75fe","resolution":{"observed_at":"2026-08-06T14:54:44.156711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.10266","last_updated":"2024-01-19T23:51:05Z","snapshot_observed_at":"2026-08-06T02:20:29.006019Z","submitted_at":"2023-07-17T18:49:46Z","title":"A DPLL(T) Framework for Verifying Deep Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.10266","snapshot_observed_at":"2026-08-06T14:54:44.160076Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.160076Z"},"links":{"cited_paper":"/paper/2307.10266","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:95a86c2df785dffea8d2dddd1cfcf9cbc11f1d6e8fb21455df54bdd6ae1f4aff","observation_id":"bfe69a1a-28ef-4971-b661-9c21ca7a8ab6","resolution":{"observed_at":"2026-08-06T14:54:44.160076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3643765","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.485253Z","title":"Harnessing neuron stability to improve dnn verification","venue":null,"work_id":"ed619e3d-c5bf-4f5a-8e9f-cd235f3cb755","year":2024},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.163532Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:029b65e091aca187a45fe0b5f2f6e3f1193acaa964f4620fd5cfc21bbc9bfdf0","observation_id":"36e36ca2-ff43-4913-b78b-0927dcfa2eca","resolution":{"observed_at":"2026-08-06T14:54:44.488119Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.326233Z","title":"Efficient neural network verification with exactness characterization","venue":null,"work_id":"3ae7c734-5ea1-48b9-aaef-70d022a05c37","year":2020},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.166772Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:ba252123fe2861876d151bf9598adb764ef0777e3e0756cdc246c0bf150bd80e","observation_id":"588dd4b4-3bc2-476e-ab54-97b31ec97f5d","resolution":{"observed_at":"2026-08-06T14:54:45.329279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.318157Z","title":"Formal verification of piece-wise linear feed-forward neural networks","venue":null,"work_id":"dbdb530d-4777-4c09-ab4f-b8879ff35264","year":2017},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.169777Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:667c3677cf458e18c8cf2536605bc67271ec429ef1f891a0305117764143a6b1","observation_id":"c61e2f35-6bef-40de-b0c9-654b333111b8","resolution":{"observed_at":"2026-08-06T14:54:45.321149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.309906Z","title":"Safety verification and robustness analysis of neural networks via quadratic constraints and semidefinite programming","venue":null,"work_id":"cf30891e-3ae2-4ccd-b387-41c325659c40","year":2020},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.172846Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:49573f9d2f78e0d874bda042c6721c187f6d20309bae8afa67faefdc6c13c5a4","observation_id":"810fbc08-1480-4dc8-b80c-9601cd1f3cea","resolution":{"observed_at":"2026-08-06T14:54:45.312965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.00263","last_updated":"2022-04-30T13:12:33Z","snapshot_observed_at":"2026-07-06T13:05:23.190497Z","submitted_at":"2022-04-30T13:12:33Z","title":"Complete Verification via Multi-Neuron Relaxation Guided Branch-and-Bound","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.00263","snapshot_observed_at":"2026-08-06T14:54:44.176007Z","title":"Complete verification via multi-neuron relaxation guided branch-and-bound","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.176007Z"},"links":{"cited_paper":"/paper/2205.00263","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:e4fd74e45ff732b29d63f6b3f98af2765d1d72465788d428c2e8e5f3de4845ab","observation_id":"4484d752-00be-4c52-b057-eaaccc33bb96","resolution":{"observed_at":"2026-08-06T14:54:44.176007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.301770Z","title":"Shared certificates for neural network verification","venue":null,"work_id":"7d16c835-6378-42c9-adba-2d3a7edc8620","year":2022},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.179945Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:787d06951c78e7db8a984d3effa35caae1e00580861032998a5b235d0256f920","observation_id":"3a0593cf-dff9-4dca-9c66-84e677ad514f","resolution":{"observed_at":"2026-08-06T14:54:45.304609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.293430Z","title":"Adaptive branch-and-bound tree exploration for neural network verification","venue":null,"work_id":"5c6fc675-66b2-4c7b-a6f5-d374e1bbe988","year":2025},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.183591Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:12ac40a68e5012f28caaf7ca253808d1e6284deabe89c0370d4e01d776a2eb85","observation_id":"60f20f14-0597-40ea-8ae6-ab9ded12680b","resolution":{"observed_at":"2026-08-06T14:54:45.296558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.187314Z","title":"Fuzz testing based data augmentation to improve robustness of deep neural networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.187314Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:45bd1721189d4dc4801d58936256e1daba8e021b41549b38c36161c783b94fbb","observation_id":"ded05a70-b57b-48ed-b2ac-f715b0b3bdbc","resolution":{"observed_at":"2026-08-06T14:54:44.187314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.285297Z","title":"Goodfellow, Jonathon Shlens, and Christian Szegedy","venue":null,"work_id":"ec54f8dd-d049-4e5c-be5c-fc84dd0e5c88","year":2015},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.190734Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:92ac8bdc1ed9a936a115cf1190ba24f9996108c2a54948d135a0e112cc5f096d","observation_id":"07c603d4-9cfe-47c0-9692-26b84c5336ba","resolution":{"observed_at":"2026-08-06T14:54:45.288272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.194202Z","title":"Eager falsification for accelerating robustness verification of deep neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.194202Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:2aa85e960425d5cd27360773766ab1c9e45e202a639639d841e56e150780c05c","observation_id":"c9c3d047-9c22-4203-bd23-03150c29353e","resolution":{"observed_at":"2026-08-06T14:54:44.194202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.276470Z","title":"Gurobi Optimizer Reference Manual , 2023","venue":null,"work_id":"9cec0f12-e14c-4395-a820-384419458dc2","year":2023},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.197470Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:3270bc98d28c81b503e6d7da6b13cf3f1f62732ca50629111adc73eb3f1a5042","observation_id":"0473fdef-d90e-438b-a728-5dbcaa2f6a7f","resolution":{"observed_at":"2026-08-06T14:54:45.279475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-65112-0_9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.468715Z","title":"Iterative counter-example guided robustness verification for neural networks","venue":null,"work_id":"5c09a9b0-973e-4d6a-8b55-75a7a284b4f2","year":2024},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.200930Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:5a8e14809ef1b21d0e805e3ceb73e65ab48af90679fb6233842ed024ef34436d","observation_id":"3d241bcb-0219-44ac-b13f-271c410a77ac","resolution":{"observed_at":"2026-08-06T14:54:44.471949Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.204451Z","title":"Deepsplit: An efficient splitting method for neural network verification via indirect effect analysis","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.204451Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:d17a310dd2173a35d426318e2244145521f103cbad90ccb6460c91394bfda60a","observation_id":"fa051654-890e-49cb-a09a-95d7b536ac97","resolution":{"observed_at":"2026-08-06T14:54:44.204451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.207662Z","title":"Safety verification of deep neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.207662Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:c811095d845a571d58a8da5f74b662a0ba84fdb8e425cefff6603973459ebcf4","observation_id":"e5b1df30-827c-46ac-bc1a-8b13440504e9","resolution":{"observed_at":"2026-08-06T14:54:44.207662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.210811Z","title":"Reluplex: An efficient SMT solver for verifying deep neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.210811Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:4f752f0b55c6cc37ea3aff77c06deed21e10cc32ab1dda4f0f44de28bbf58a05","observation_id":"bdb0fa46-9997-46e2-8c6e-668412bfd467","resolution":{"observed_at":"2026-08-06T14:54:44.210811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.214236Z","title":"Optimization by simulated annealing","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.214236Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:511e157734aaa78ceda5f8a176ee4d3450343412b4f44f5cb3d1d34635005f08","observation_id":"fb8637c7-b696-4c3d-8461-8e72584928e4","resolution":{"observed_at":"2026-08-06T14:54:44.214236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.217522Z","title":"Algorithms for verifying deep neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.217522Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:b396f8f77eae9df35485c949ef7928528930d4c591fd0ede3a30223197fcffe3","observation_id":"0c88b65f-0c2e-43cc-b3cb-854d1f288e49","resolution":{"observed_at":"2026-08-06T14:54:44.217522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01329","last_updated":"2019-12-03T12:12:29Z","snapshot_observed_at":"2026-07-06T08:41:39.110616Z","submitted_at":"2019-12-03T12:12:29Z","title":"Neural Network Branching for Neural Network Verification","version":1},"cited_work":{"arxiv_id":"1912.01329","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.01329","snapshot_observed_at":"2026-08-06T14:54:44.902929Z","title":"Neural Network Branching for Neural Network Verification","venue":"cs.LG","work_id":"d8e9672f-c07b-4dab-af39-dcb0a3b9f36c","year":2019},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.220704Z"},"links":{"cited_paper":"/paper/1912.01329","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:f43e4f13d068633b21f9c63bef602632fa1d894d2eb62794d273e268501aa817","observation_id":"c4b8dfa9-824c-4081-ac19-185660e21524","resolution":{"observed_at":"2026-08-06T14:54:44.906907Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.224480Z","title":"Relu hull approximation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.224480Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:52bded24b426dfc40d88129179428e2a2819d96a1a11f3684972e0d38656c16a","observation_id":"60d24cee-aa16-4ab6-a9dd-f2f178a8c262","resolution":{"observed_at":"2026-08-06T14:54:44.224480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.268170Z","title":"Towards deep learning models resistant to adversarial attacks","venue":null,"work_id":"5d9ede78-4e2e-4805-8cfb-82af89f2fcf9","year":2018},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.227848Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:2a82a31c02b7e9d1332c8b50b3fdb3cdd079210a59d6b12905fedc7037ce12c5","observation_id":"23c28493-dd4a-4d0c-908c-8cde3d1c18b1","resolution":{"observed_at":"2026-08-06T14:54:45.271191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.10868","last_updated":"2021-05-18T10:14:05Z","snapshot_observed_at":"2026-07-06T09:40:36.890707Z","submitted_at":"2020-07-20T16:09:07Z","title":"Scaling Polyhedral Neural Network Verification on GPUs","version":2},"cited_work":{"arxiv_id":"2007.10868","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.10868","snapshot_observed_at":"2026-08-06T14:54:44.889705Z","title":"Scaling Polyhedral Neural Network Verification on GPUs","venue":"cs.LG","work_id":"504cad5e-a44a-49e3-a416-145e1807bf8f","year":2020},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.231117Z"},"links":{"cited_paper":"/paper/2007.10868","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:31728edd4fdaa1c64bb0d0a564ff09fafd87c9fd2b7ed763156383327d577edd","observation_id":"43d2691c-555d-4678-84a5-a805b1e605a3","resolution":{"observed_at":"2026-08-06T14:54:44.893792Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10376","last_updated":"2023-02-16T08:06:35Z","snapshot_observed_at":"2026-07-06T14:33:03.656499Z","submitted_at":"2022-12-20T15:58:01Z","title":"The Third International Verification of Neural Networks Competition (VNN-COMP 2022): Summary and Results","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10376","snapshot_observed_at":"2026-08-06T14:54:44.234193Z","title":"3rd international verification of neural networks competition ( VNN-COMP 2022): Summary and results","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.234193Z"},"links":{"cited_paper":"/paper/2212.10376","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:766c4a4da59d7ec8d975a3a0c15d85c3994bbef7a5e9c43f1a101003b79c4126","observation_id":"2a4a9049-a355-4f78-a263-b974bec88754","resolution":{"observed_at":"2026-08-06T14:54:44.234193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03638","last_updated":"2022-02-28T16:54:50Z","snapshot_observed_at":"2026-08-02T00:05:34.511558Z","submitted_at":"2021-03-05T12:53:24Z","title":"PRIMA: General and Precise Neural Network Certification via Scalable Convex Hull Approximations","version":3},"cited_work":{"arxiv_id":"2103.03638","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.03638","snapshot_observed_at":"2026-08-06T14:54:44.868308Z","title":"PRIMA: General and Precise Neural Network Certification via Scalable Convex Hull Approximations","venue":"cs.AI","work_id":"513ac5ad-be8e-4c37-8da6-c94d9dcb4589","year":2021},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.237363Z"},"links":{"cited_paper":"/paper/2103.03638","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:f453eb9169b112bef11a061001d6ada8b22bb9db69f3929ce6004e530778b3e9","observation_id":"6e17f5c1-8c82-481f-b011-a26df1861cae","resolution":{"observed_at":"2026-08-06T14:54:44.872139Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.240816Z","title":"u ller, Gleb Makarchuk, Gagandeep Singh, Markus P \\","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.240816Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:0ded97f5815b4a7aeb953981c2d59f29b5d760d532825cae884f423678bcdc4e","observation_id":"3cc405ec-3328-42e2-b4f8-79957374f5f7","resolution":{"observed_at":"2026-08-06T14:54:44.240816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.259555Z","title":"Tensorfuzz: Debugging neural networks with coverage-guided fuzzing","venue":null,"work_id":"2a709e5f-e93d-4a17-906e-516c7f47db3b","year":2019},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.244233Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:54036e05f08033bbcabc2326ecc7e717e92942110c72c10d36058c7d150d6d24","observation_id":"991166a1-5972-481e-aa76-3f5add011f49","resolution":{"observed_at":"2026-08-06T14:54:45.262773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.247478Z","title":"An abstraction-refinement approach to verifying convolutional neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.247478Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:e0f492c04a49a17839f6933d2eb44991aa3a9e942287e3922a142d4cdf098a0d","observation_id":"3fdf4355-2b96-4510-927b-2e306017b4a2","resolution":{"observed_at":"2026-08-06T14:54:44.247478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.250679Z","title":"Deepxplore: Automated whitebox testing of deep learning systems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.250679Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:140e9e797ac5833b0cf5b8bae69dad0e2139619293982200e194ab5b978e5e33","observation_id":"fca71369-1fff-45db-bc2e-c1713ba70847","resolution":{"observed_at":"2026-08-06T14:54:44.250679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.250667Z","title":"Semidefinite relaxations for certifying robustness to adversarial examples","venue":null,"work_id":"70d2e110-6859-40e5-aa82-3f05935c2676","year":2018},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.253903Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:618227cec9c0c4fb4a2a81638ae82665be9ac69f56662b6d2d1f3463d9560dfd","observation_id":"21ed128b-3ea5-4e32-87ef-7ef5eb1b25f1","resolution":{"observed_at":"2026-08-06T14:54:45.253862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.07247","last_updated":"2021-06-21T13:15:34Z","snapshot_observed_at":"2026-07-06T07:34:10.374415Z","submitted_at":"2019-02-19T19:35:30Z","title":"Fast Neural Network Verification via Shadow Prices","version":3},"cited_work":{"arxiv_id":"1902.07247","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.07247","snapshot_observed_at":"2026-08-06T14:54:44.792126Z","title":"Fast Neural Network Verification via Shadow Prices","venue":"cs.LG","work_id":"8732bd4a-8fde-40c6-9fea-87c610fa27fb","year":2019},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.256955Z"},"links":{"cited_paper":"/paper/1902.07247","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:dac86235a1be1dc69fadc7cf4abb6f402f7fc5f5ec9556bf8d285fbbefdcb82a","observation_id":"da425636-542a-4c60-8ece-3bcc3c5b4be0","resolution":{"observed_at":"2026-08-06T14:54:44.796173Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.21063","last_updated":"2025-02-07T22:42:52Z","snapshot_observed_at":"2026-07-06T18:23:27.760658Z","submitted_at":"2024-05-31T17:51:07Z","title":"Neural Network Verification with Branch-and-Bound for General Nonlinearities","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.21063","snapshot_observed_at":"2026-08-06T14:54:44.260070Z","title":"Neural network verification with branch-and-bound for general nonlinearities","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.260070Z"},"links":{"cited_paper":"/paper/2405.21063","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:068b2f1ea45b121b1e8dcc6374e9fff67f5af97bf222ed8b1e1ab96a0626b137","observation_id":"d631dc46-40b4-4e3b-aec4-aaaff1299cb4","resolution":{"observed_at":"2026-08-06T14:54:44.260070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.241746Z","title":"Efficiently computing local lipschitz constants of neural networks via bound propagation","venue":null,"work_id":"0a3bb760-e550-4dbc-bdd3-dd8eb178121c","year":2022},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.263097Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:7eba2312999247ee4d138a3c2029532be26ab91be795ff078528206c96b5ec1b","observation_id":"eb664778-9464-4ecf-994c-5e4eafeabb0c","resolution":{"observed_at":"2026-08-06T14:54:45.244722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.233134Z","title":"Beyond the single neuron convex barrier for neural network certification","venue":null,"work_id":"f2ab78c3-8123-489c-b079-cca29796e334","year":2019},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.266237Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:494a8e9a20ff8c7a3de2d7cf114fadd1234324215ac15d14d43cadb83104a2eb","observation_id":"0a005240-f7a9-43cd-b069-1ce991adb216","resolution":{"observed_at":"2026-08-06T14:54:45.236113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.224606Z","title":"Fast and effective robustness certification","venue":null,"work_id":"6229544a-01ae-419f-8dea-6ffbc4a4f5df","year":2018},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.269163Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:f8dc626e9eb8fc4239c7ff7764a63ab4e4db8ef1329c4575a29b56aae6489d78","observation_id":"922032d3-44dc-4963-86fb-f885076acf65","resolution":{"observed_at":"2026-08-06T14:54:45.227648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.216094Z","title":"Fast and effective robustness certification","venue":null,"work_id":"1e0825e3-016d-4300-b7b5-de0580949bfa","year":2018},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.271893Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:96a5fd633d105c0af94ba8a0b01ae2f0bbbf665ad39b68ac184a4ad1ee338c68","observation_id":"85d7d93c-dcd4-497f-8387-0293a5a6fd3a","resolution":{"observed_at":"2026-08-06T14:54:45.219215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.206705Z","title":"Boosting robustness certification of neural networks","venue":null,"work_id":"c6e8613a-25c0-4cbe-8c7f-89e12043b3d1","year":2018},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.274696Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:5a48ff096611ae877fd7c9edb70d43eec9c77847a15a6527cede400f7b48f486","observation_id":"0a371369-5b93-4a6e-a136-6a4906fb437f","resolution":{"observed_at":"2026-08-06T14:54:45.210028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.277594Z","title":"An abstract domain for certifying neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.277594Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:1a2576a0b31f4d020882240f903cbb584eda369b7627696240107ae78d72165f","observation_id":"0af9617f-d662-4deb-aaa2-018359a5e0ab","resolution":{"observed_at":"2026-08-06T14:54:44.277594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.280577Z","title":"Deeptest: Automated testing of deep-neural-network-driven autonomous cars","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.280577Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:2cff637872cec17c15db9267e9c9982d538a6fa0bb26d83884026b558b2aa6f7","observation_id":"32f90b07-882e-4a27-82de-18317f4ba849","resolution":{"observed_at":"2026-08-06T14:54:44.280577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.197738Z","title":"The convex relaxation barrier, revisited: Tightened single-neuron relaxations for neural network verification","venue":null,"work_id":"7e90cbce-71e9-4f84-9ede-e4211b1dae9c","year":2020},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.283656Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:471706b5e15ef2f952de7d8c6fa89ca775a6a128ef02fbbeabc31a90210f9df4","observation_id":"e7b14479-ed8e-418b-a656-e5e9f26c8299","resolution":{"observed_at":"2026-08-06T14:54:45.200883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.188964Z","title":"Evaluating robustness of neural networks with mixed integer programming","venue":null,"work_id":"979ee5b0-e311-4b6a-b6fb-944ab7c2c6cc","year":2018},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.286829Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:92f817a6e45a89c8f377487bab071abe15ab6e65f4a9a50abac055b878c55ae4","observation_id":"8ed4b09d-9136-4d7d-be80-b7a9022814c9","resolution":{"observed_at":"2026-08-06T14:54:45.192167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.290305Z","title":"Incremental verification of neural networks","venue":null,"work_id":null,"year":1920},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.290305Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:bb7c7b15af44e2fb48630714bbca476237b3bc5946c93c91b315617d70a297ea","observation_id":"11cf4181-1cee-4340-8080-3b7c2b05b1da","resolution":{"observed_at":"2026-08-06T14:54:44.290305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.179836Z","title":"Efficient formal safety analysis of neural networks","venue":null,"work_id":"8d7e9198-669e-4bbc-bbc9-6544a7bce049","year":2018},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.293214Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:2a0d5e6f9e465b4e539eb2c8be9f3dede2d9271c307a19acfc7de895e1a6dd70","observation_id":"2b4d0781-34ca-486d-9675-d1b9f8b489f8","resolution":{"observed_at":"2026-08-06T14:54:45.183337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.171056Z","title":"Formal security analysis of neural networks using symbolic intervals","venue":null,"work_id":"a4a69bb3-19f3-4357-bfc8-8fb1d15ca2f8","year":2018},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.296263Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:700dc62e04eceeaa3f2bebdb251371379329f6c1d3838f42d56cac78576bd76f","observation_id":"26cd30e4-6697-4ebf-89f8-46861ce152cc","resolution":{"observed_at":"2026-08-06T14:54:45.174276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.162383Z","title":"Beta-crown: Efficient bound propagation with per-neuron split constraints for neural network robustness verification","venue":null,"work_id":"2d9447c6-4ecf-4afe-8a17-9cd3eb79293c","year":2021},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.299376Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:f957f2b8504067789041f76dc194306ae0cb8ef8f78e51708ce9a3edc3d7220d","observation_id":"b6c7e80c-0e1a-439d-9ef5-20acc07f27a8","resolution":{"observed_at":"2026-08-06T14:54:45.165397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.302569Z","title":"Daggitt, Wen Kokke, Idan Refaeli, Guy Amir, Kyle Julian, Shahaf Bassan, Pei Huang, Ori Lahav, Min Wu, Min Zhang, Ekaterina Komendantskaya, Guy Katz, and Clark W","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.302569Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:2ac374d6c08da565f91031dffb1fdb3c20f0a86f6f57adc7b1824c9c6fd9fc8c","observation_id":"b2a774f9-2e5c-48ff-99c9-4f6244d0466f","resolution":{"observed_at":"2026-08-06T14:54:44.302569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.305757Z","title":"Improving transferability of adversarial examples with input diversity","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.305757Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:b3e53d5bfe4410530cb5c79900f60e2e29682fd0a205822def26f08adcbdbc01","observation_id":"75835eed-2c69-48d2-bce6-1966718baea8","resolution":{"observed_at":"2026-08-06T14:54:44.305757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-42441-0_11","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.407026Z","title":"kprop: Multi-neuron relaxation method for neural network robustness verification","venue":null,"work_id":"961d1fca-8649-49ba-81f2-4728f76fd9ec","year":2023},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.308757Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:7598888bcc794dc0529afcbd9ca255c11091f1c39c96a2e7b6a7b46204f13f2e","observation_id":"27d751f2-8873-43c7-adf1-fb4031ed68fd","resolution":{"observed_at":"2026-08-06T14:54:44.410257Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06455","last_updated":"2023-02-10T04:31:28Z","snapshot_observed_at":"2026-07-06T14:51:19.104522Z","submitted_at":"2023-02-10T04:31:28Z","title":"Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks","version":1},"cited_work":{"arxiv_id":"2302.06455","doi":"10.48550/arxiv.2302.06455","metadata_source":"pith","pith_arxiv_id":"2302.06455","snapshot_observed_at":"2026-08-06T18:16:30.548575Z","title":"Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks","venue":"cs.AI","work_id":"013d67bd-8f88-4780-ba77-51de41dcdd09","year":2023},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.311927Z"},"links":{"cited_paper":"/paper/2302.06455","citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:66b2d74040d43339cfada11de50bce32c680bcb143f91932285ba94a5b849ab8","observation_id":"88629b8e-5e92-409b-b6d7-ebbb82056e6e","resolution":{"observed_at":"2026-08-06T14:54:44.401230Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-72016-2_21","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.386589Z","title":"Improving neural network verification through spurious region guided refinement","venue":null,"work_id":"d9972e3e-287d-4bf8-b736-1d734944a272","year":2021},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.316761Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:75c46703b4b415b0226b41de67c4dba2645b95ee1977968a657a3839771f6611","observation_id":"4e0d65da-5904-41ea-9c45-47936538a010","resolution":{"observed_at":"2026-08-06T14:54:44.389600Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v30i1.10289","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.377931Z","title":"Derivative-free optimization via classification","venue":null,"work_id":"c20367dd-9dfd-4b5e-bf9c-e9e5ad6a828a","year":2016},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.320001Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:a58d29a4ca49c4676801fd2ae7ed2b0042e31cc186f650e13643dccbe8f467f1","observation_id":"f133450e-36b7-4554-a888-c2310d9e40e5","resolution":{"observed_at":"2026-08-06T14:54:44.381082Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3720417","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.368477Z","title":"Dilum Bandara, Shiping Chen, Jianjun Zhao, and Yulei Sui","venue":null,"work_id":"3d3058ae-5b14-454d-8050-968d156c0ff9","year":2025},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.323019Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:ffc00adacb26be0c646fc9a2a4e13d44dc3bf7f1d07bc56630a92898019a4697","observation_id":"e9cbd83d-214d-46d8-bbf1-d1fbd43cbad8","resolution":{"observed_at":"2026-08-06T14:54:44.372192Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.148368Z","title":"A branch and bound framework for stronger adversarial attacks of relu networks","venue":null,"work_id":"bd6cf46f-f012-4039-8a5f-3868ab7ceb5c","year":2022},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.326209Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:0e5b897690da4398ff6d3af5bc47a3ab667f0058a3197c7e76ceaa4a6369dec6","observation_id":"a582c4ae-349a-452d-a20c-c860650118f4","resolution":{"observed_at":"2026-08-06T14:54:45.151466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:45.139457Z","title":"Efficient neural network robustness certification with general activation functions","venue":null,"work_id":"17a97647-4a26-4f4f-9bb4-6feca7764f95","year":2018},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.329284Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:347d587a87bc60c0911ba67afc07e6d0c7ef06148bcb6466bb980234772f45e1","observation_id":"ee637893-d531-4361-89e8-cf14f12fb00d","resolution":{"observed_at":"2026-08-06T14:54:45.142513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-22308-2_20","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:54:44.357075Z","title":"Cleverest: accelerating cegar-based neural network verification via adversarial attacks","venue":null,"work_id":"7deca30a-efa8-45bc-9cee-20ff5ddb0249","year":2022},"citing_paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-06T14:54:44.332411Z"},"links":{"citing_paper":"/paper/2507.17453"},"observation_digest":"sha256:6aa3137da994834f9f2ce229b230aef88fb73b8c2050ad2efaf4fe96064a7935","observation_id":"280f9ba1-4f90-44ef-b026-26c3a358899c","resolution":{"observed_at":"2026-08-06T14:54:44.362300Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.17453","last_updated":"2025-07-23T12:20:20Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T14:45:12.041852Z","submitted_at":"2025-07-23T12:20:20Z","title":"Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":25,"verified_exact":12,"verified_fuzzy":26},"total_outbound_references":65},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2507.17453."}