Pith. sign in

Paper Citation Record · LEDGER

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees

As of 10 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2507.17453.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2507.17453 v1

Coverage vector

measured 65 of 65 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T14:54:44.332411Z

measured 65 of 65 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

65 of 65 outbound references displayed

  • verified exact12
  • verified fuzzy26
  • unresolved25
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 2e04bee5-d4c7-4f72-8ab8-f81a649b9020 · outbound

This paper cites Optimization and abstraction: a synergistic approach for analyzing neural network robustness.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Optimization and abstraction: a synergistic approach for analyzing neural network robustness

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.123418Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.123418Z digest=sha256:2e4798597561033469242c5d2dd3afa32d1d8ba751e82fbdbaf6043a906a8e28

Observation 4cb794c6-01a2-43fa-ab8a-fb2b26456b84 · outbound

This paper cites Strong convex relaxations and mixed-integer programming formulations for trained neural networks (2018), 1811.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Strong convex relaxations and mixed-integer programming formulations for trained neural networks (2018), 1811

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.362579Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.126994Z digest=sha256:3f2e19bb902bd468a8c009ed38bcc849500ad29c98864b6c431269fe1a8cf1ad

Observation 8549a5d5-2f66-47c6-b2eb-0d9993d1b448 · outbound

This paper cites Square attack: a query-efficient black-box adversarial attack via random search.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Square attack: a query-efficient black-box adversarial attack via random search

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.130096Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.130096Z digest=sha256:cc15bc4f3f7d2101274433d31af99434445636b651d53fa808ce16fceaf5517f

Observation d382cb40-30d4-4585-a7f3-ed89d0d1a810 · outbound

This paper cites Branch and Bound for Piecewise Linear Neural Network Verification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Branch and Bound for Piecewise Linear Neural Network Verification

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.133910Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.133910Z digest=sha256:b6aeaa595da604b9873f6a84e8a4a72c25de965813c8454105c2008b4978a1bb

Observation ad51bae3-ca1d-4ab8-96f2-b10b6abc5dd3 · outbound

This paper cites Branch and bound for piecewise linear neural network verification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Branch and bound for piecewise linear neural network verification

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.354165Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.137771Z digest=sha256:c167a5b459645daa57d98b6da49e70c3af6a8bb6fc83cbd7e421c3eb53de02a9

Observation 2d832d43-b319-439b-9c47-d1c64053f533 · outbound

This paper cites Towards evaluating the robustness of neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Towards evaluating the robustness of neural networks

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.140982Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.140982Z digest=sha256:27a682ff73d59933cff37aa2b4cf7bc503478fa45ba08ae1a0b5e0d9fe5fe45c

Observation 0268fe9a-65ad-4486-9d2f-1bf7530c8180 · outbound

This paper cites Maximum resilience of artificial neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Maximum resilience of artificial neural networks

Reference 7

Resolution
verified exact
doi, observed 2026-08-06T14:54:44.519716Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.144448Z digest=sha256:a7fe2b4920a8a93dabe0ec2649f31abd607c2e6a87f44055534f3ccc9c965ad0

Observation 923e071e-b430-4c69-8bc4-32f52e8dc73d · outbound

This paper cites A survey of algorithms for black-box safety validation of cyber-physical systems.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees A survey of algorithms for black-box safety validation of cyber-physical systems

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.345811Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.147563Z digest=sha256:6cc524ce994c423043ed5b989ec8a00519f9aef7018fe57fbde4136d3bee2616

Observation fce475f3-dc33-42a5-9949-547eb9b50a16 · outbound

This paper cites Fast Falsification of Neural Networks using Property Directed Testing.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Fast Falsification of Neural Networks using Property Directed Testing

Reference 9

Resolution
verified exact
local_arxiv, observed 2026-08-06T14:54:44.509996Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.150460Z digest=sha256:60daacb80e1e5137aa59e64ff6fb0c8e67b49f84275a815dfa3745f3aa21f7b3

Observation 3869d7b5-641e-4e92-8dfb-9032fb88ec37 · outbound

This paper cites Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.337626Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.153773Z digest=sha256:a84ec7455e9fbe1c1939308130f4bd9f2afed330a8208e93ca722ebbcf8b76a4

Observation 024baced-ad56-48f9-aaf9-e4d28adf75fe · outbound

This paper cites Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.156711Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.156711Z digest=sha256:6c875839f66fcfdbed918aaf3d5c81a15b0341b7afc38551aacbcb5ace7cf276

Observation bfe69a1a-28ef-4971-b661-9c21ca7a8ab6 · outbound

This paper cites A DPLL(T) Framework for Verifying Deep Neural Networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees A DPLL(T) Framework for Verifying Deep Neural Networks

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.160076Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.160076Z digest=sha256:cf07864a600830c08add3ca2035b60360ed4515aacce8c6a2893ca48ebf37a22

Observation 36e36ca2-ff43-4913-b78b-0927dcfa2eca · outbound

This paper cites Harnessing neuron stability to improve dnn verification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Harnessing neuron stability to improve dnn verification

Reference 13

Resolution
verified exact
doi, observed 2026-08-06T14:54:44.488119Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.163532Z digest=sha256:90ca33fa30b9f77f77ddb7ab8d93dbdd09281cc4e627880f25aa19015e753915

Observation 588dd4b4-3bc2-476e-ab54-97b31ec97f5d · outbound

This paper cites Efficient neural network verification with exactness characterization.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Efficient neural network verification with exactness characterization

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.329279Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.166772Z digest=sha256:5951599389a910ba3b6e6cc36164b6f45931e171c6f1522ca2df95c6cdb2b9fa

Observation c61e2f35-6bef-40de-b0c9-654b333111b8 · outbound

This paper cites Formal verification of piece-wise linear feed-forward neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Formal verification of piece-wise linear feed-forward neural networks

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.321149Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.169777Z digest=sha256:b657d4b70243e1af6f79dc43f80bac53f63626b2430bf2c967f797cc47257565

Observation 810fbc08-1480-4dc8-b80c-9601cd1f3cea · outbound

This paper cites Safety verification and robustness analysis of neural networks via quadratic constraints and semidefinite programming.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Safety verification and robustness analysis of neural networks via quadratic constraints and semidefinite programming

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.312965Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.172846Z digest=sha256:14fda5d8b664dc2711a2b5483baee4565492ba213286dd4b4a52c942cd28b5f3

Observation 4484d752-00be-4c52-b057-eaaccc33bb96 · outbound

This paper cites Complete Verification via Multi-Neuron Relaxation Guided Branch-and-Bound.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Complete Verification via Multi-Neuron Relaxation Guided Branch-and-Bound

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.176007Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.176007Z digest=sha256:ed8bed2f6d6272ff7a560fd110424598356ada9cf05ef951783e2933fa1bcf17

Observation 3a0593cf-dff9-4dca-9c66-84e677ad514f · outbound

This paper cites Shared certificates for neural network verification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Shared certificates for neural network verification

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.304609Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.179945Z digest=sha256:fac2191f97bb90a78124d9ae6d335dc9145df0dc296c8d86ceb3902f0d37d9b6

Observation 60f20f14-0597-40ea-8ae6-ab9ded12680b · outbound

This paper cites Adaptive branch-and-bound tree exploration for neural network verification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Adaptive branch-and-bound tree exploration for neural network verification

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.296558Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.183591Z digest=sha256:7d521deda469d4aa1867a9c01d333c9d27b09cd8a505bc71edc1655de5435801

Observation ded05a70-b57b-48ed-b2ac-f715b0b3bdbc · outbound

This paper cites Fuzz testing based data augmentation to improve robustness of deep neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Fuzz testing based data augmentation to improve robustness of deep neural networks

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.187314Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.187314Z digest=sha256:1a47d9d99c12d4adf676eb33aa201fb1e09e64f8d6a55c37daa86d002caa4f6b

Observation 07c603d4-9cfe-47c0-9692-26b84c5336ba · outbound

This paper cites Goodfellow, Jonathon Shlens, and Christian Szegedy.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Goodfellow, Jonathon Shlens, and Christian Szegedy

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.288272Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.190734Z digest=sha256:864021c677ce47971a4de45f2bfbdc51bc71625ac428e7f38f87dec2923f4dfb

Observation c9c3d047-9c22-4203-bd23-03150c29353e · outbound

This paper cites Eager falsification for accelerating robustness verification of deep neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Eager falsification for accelerating robustness verification of deep neural networks

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.194202Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.194202Z digest=sha256:ec797e8f29c663ac9c85d34a0a86c5055839cfce78ce8f616cbc2ebb05fae2fa

Observation 0473fdef-d90e-438b-a728-5dbcaa2f6a7f · outbound

This paper cites Gurobi Optimizer Reference Manual , 2023.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Gurobi Optimizer Reference Manual , 2023

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.279475Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.197470Z digest=sha256:b0dd5d5b78305cfe4f0569aa68a26b0f1996f2a731106d31c14c5a8287276558

Observation 3d241bcb-0219-44ac-b13f-271c410a77ac · outbound

This paper cites Iterative counter-example guided robustness verification for neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Iterative counter-example guided robustness verification for neural networks

Reference 24

Resolution
verified exact
doi, observed 2026-08-06T14:54:44.471949Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.200930Z digest=sha256:47c7ba33d4549543ebad6e676364bca383be7d0a041bc8c185bf8c04db0c00b5

Observation fa051654-890e-49cb-a09a-95d7b536ac97 · outbound

This paper cites Deepsplit: An efficient splitting method for neural network verification via indirect effect analysis.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Deepsplit: An efficient splitting method for neural network verification via indirect effect analysis

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.204451Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.204451Z digest=sha256:4f8bf133ba66d3f6ed5b6ffcc3fa4a4d0d64d2b468aa0cdb9c4dff0c522a6e06

Observation e5b1df30-827c-46ac-bc1a-8b13440504e9 · outbound

This paper cites Safety verification of deep neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Safety verification of deep neural networks

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.207662Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.207662Z digest=sha256:4434201765905cc25d0df5b8880a179892b044b219315c7d4a3228b7c1790ffc

Observation bdb0fa46-9997-46e2-8c6e-668412bfd467 · outbound

This paper cites Reluplex: An efficient SMT solver for verifying deep neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Reluplex: An efficient SMT solver for verifying deep neural networks

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.210811Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.210811Z digest=sha256:a5e0f7bb22920d1f625f9a27787bfa8b924647f45d7f7980cdc60befba2933ee

Observation fb8637c7-b696-4c3d-8461-8e72584928e4 · outbound

This paper cites Optimization by simulated annealing.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Optimization by simulated annealing

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.214236Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.214236Z digest=sha256:a26a3932629e26bc3d6295192135a8141e6f14b046ce97915b721944bca3204d

Observation 0c88b65f-0c2e-43cc-b3cb-854d1f288e49 · outbound

This paper cites Algorithms for verifying deep neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Algorithms for verifying deep neural networks

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.217522Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.217522Z digest=sha256:dc0c50311c68562aa2f81dcdfa25ee4e3b10f5e91539ce552c74ae2dae5a2789

Observation c4b8dfa9-824c-4081-ac19-185660e21524 · outbound

This paper cites Neural Network Branching for Neural Network Verification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Neural Network Branching for Neural Network Verification

Reference 30

Resolution
verified exact
local_arxiv, observed 2026-08-06T14:54:44.906907Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.220704Z digest=sha256:2e221445d580f377aa24dc14dea6d73bd7d65a597e3790c96598ee09537f529e

Observation 60d24cee-aa16-4ab6-a9dd-f2f178a8c262 · outbound

This paper cites Relu hull approximation.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Relu hull approximation

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.224480Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.224480Z digest=sha256:cc4d632deef06926fa662654e02e2bb5f0b7387281e22e14ad64ba2a6559e61c

Observation 23c28493-dd4a-4d0c-908c-8cde3d1c18b1 · outbound

This paper cites Towards deep learning models resistant to adversarial attacks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Towards deep learning models resistant to adversarial attacks

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.271191Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.227848Z digest=sha256:134304f950dbbe7f2bc7037b4e690b33db26b1af404bb9bdf1f0fbe8d3d25f4f

Observation 43d2691c-555d-4678-84a5-a805b1e605a3 · outbound

This paper cites Scaling Polyhedral Neural Network Verification on GPUs.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Scaling Polyhedral Neural Network Verification on GPUs

Reference 33

Resolution
metadata mismatch
local_arxiv, observed 2026-08-06T14:54:44.893792Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.231117Z digest=sha256:98d1348764185aac2c3357bb7c8223ab798e42ab71786256af60440b18cfed91

Observation 2a4a9049-a355-4f78-a263-b974bec88754 · outbound

This paper cites The Third International Verification of Neural Networks Competition (VNN-COMP 2022): Summary and Results.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees The Third International Verification of Neural Networks Competition (VNN-COMP 2022): Summary and Results

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.234193Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.234193Z digest=sha256:f095ca04b15f95c9f15e553795bb6970011a05ac021fc400c4399ea03cb6890b

Observation 6e17f5c1-8c82-481f-b011-a26df1861cae · outbound

This paper cites PRIMA: General and Precise Neural Network Certification via Scalable Convex Hull Approximations.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees PRIMA: General and Precise Neural Network Certification via Scalable Convex Hull Approximations

Reference 35

Resolution
metadata mismatch
local_arxiv, observed 2026-08-06T14:54:44.872139Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.237363Z digest=sha256:de8bea8176ac465cf76c8eeefd53e1c7dc727dcf9dc04f11de409506cd6fe3c5

Observation 3cc405ec-3328-42e2-b4f8-79957374f5f7 · outbound

This paper cites u ller, Gleb Makarchuk, Gagandeep Singh, Markus P \.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees u ller, Gleb Makarchuk, Gagandeep Singh, Markus P \

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.240816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.240816Z digest=sha256:dfe888fcf322a380dc02d07165442ec93b11125216b2f677830214601610293a

Observation 991166a1-5972-481e-aa76-3f5add011f49 · outbound

This paper cites Tensorfuzz: Debugging neural networks with coverage-guided fuzzing.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Tensorfuzz: Debugging neural networks with coverage-guided fuzzing

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.262773Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.244233Z digest=sha256:18898c1b5358c1daed097954c338ca73cf0b507766538f6491ab07f04c893add

Observation 3fdf4355-2b96-4510-927b-2e306017b4a2 · outbound

This paper cites An abstraction-refinement approach to verifying convolutional neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees An abstraction-refinement approach to verifying convolutional neural networks

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.247478Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.247478Z digest=sha256:05f1ab131580d9e1f04805ba39f8261171f141620850ffcd82d918d0e1958337

Observation fca71369-1fff-45db-bc2e-c1713ba70847 · outbound

This paper cites Deepxplore: Automated whitebox testing of deep learning systems.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Deepxplore: Automated whitebox testing of deep learning systems

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.250679Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.250679Z digest=sha256:6272b0702b5ce5144fffb8f8e08b41dd9e549b7f68caa486a45dc92150c3aa23

Observation 21ed128b-3ea5-4e32-87ef-7ef5eb1b25f1 · outbound

This paper cites Semidefinite relaxations for certifying robustness to adversarial examples.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Semidefinite relaxations for certifying robustness to adversarial examples

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.253862Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.253903Z digest=sha256:ee5383ad5be11769cad4bf139dee75dcd6612251fb98f79312662d4738931b33

Observation da425636-542a-4c60-8ece-3bcc3c5b4be0 · outbound

This paper cites Fast Neural Network Verification via Shadow Prices.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Fast Neural Network Verification via Shadow Prices

Reference 41

Resolution
verified exact
local_arxiv, observed 2026-08-06T14:54:44.796173Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.256955Z digest=sha256:cb2216d63a8d1c56f0311a9e8d115dc6adc04ac1e453e3ebf8d5559f15215633

Observation d631dc46-40b4-4e3b-aec4-aaaff1299cb4 · outbound

This paper cites Neural Network Verification with Branch-and-Bound for General Nonlinearities.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Neural Network Verification with Branch-and-Bound for General Nonlinearities

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.260070Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.260070Z digest=sha256:44cecb6632282c9578f882ef66c39c2a5f10a3a1b34546e2229669e47e475d36

Observation eb664778-9464-4ecf-994c-5e4eafeabb0c · outbound

This paper cites Efficiently computing local lipschitz constants of neural networks via bound propagation.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Efficiently computing local lipschitz constants of neural networks via bound propagation

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.244722Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.263097Z digest=sha256:f1b79968fdbb7e717c28cf72099fd8d63c4d70982e92c656fe464bfb70709cef

Observation 0a005240-f7a9-43cd-b069-1ce991adb216 · outbound

This paper cites Beyond the single neuron convex barrier for neural network certification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Beyond the single neuron convex barrier for neural network certification

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.236113Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.266237Z digest=sha256:4c1938fce84875575677f1b5b989c5237018c64deda30a301f736e8855badc23

Observation 922032d3-44dc-4963-86fb-f885076acf65 · outbound

This paper cites Fast and effective robustness certification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Fast and effective robustness certification

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.227648Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.269163Z digest=sha256:1e9420c79d27b2b8df3b403b37aaa179401885f48ed955d11f1ad4ebc38edfec

Observation 85d7d93c-dcd4-497f-8387-0293a5a6fd3a · outbound

This paper cites Fast and effective robustness certification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Fast and effective robustness certification

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.219215Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.271893Z digest=sha256:cc70d404269c90e6d902f1d3eba9673dddfdc2b5d1977e445f6c51a2c5c170a1

Observation 0a371369-5b93-4a6e-a136-6a4906fb437f · outbound

This paper cites Boosting robustness certification of neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Boosting robustness certification of neural networks

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.210028Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.274696Z digest=sha256:7c97eaf66ff3248c26000e6a17038eddc1be2dfe1c3d7c57b15af8dda23a7e77

Observation 0af9617f-d662-4deb-aaa2-018359a5e0ab · outbound

This paper cites An abstract domain for certifying neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees An abstract domain for certifying neural networks

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.277594Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.277594Z digest=sha256:244bb0f3f0b00927009a0e077f28f4330e27664b10a1700de73ea7c3c0bf895d

Observation 32f90b07-882e-4a27-82de-18317f4ba849 · outbound

This paper cites Deeptest: Automated testing of deep-neural-network-driven autonomous cars.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Deeptest: Automated testing of deep-neural-network-driven autonomous cars

Reference 49

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.280577Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.280577Z digest=sha256:45a69a4d0214452780a511147da8b27fe8c57aa5c001386fd3cef8e64ee56e37

Observation e7b14479-ed8e-418b-a656-e5e9f26c8299 · outbound

This paper cites The convex relaxation barrier, revisited: Tightened single-neuron relaxations for neural network verification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees The convex relaxation barrier, revisited: Tightened single-neuron relaxations for neural network verification

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.200883Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.283656Z digest=sha256:cf59f5f15d9ddcaa7899e0f79ee89c077e97c8c2fb2b59ec17bd0cc63208ad84

Observation 8ed4b09d-9136-4d7d-be80-b7a9022814c9 · outbound

This paper cites Evaluating robustness of neural networks with mixed integer programming.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Evaluating robustness of neural networks with mixed integer programming

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.192167Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.286829Z digest=sha256:d337254288b279a4a4eb9e886eb849e89e33a5397830a411ff8c1f9878a3fc44

Observation 11cf4181-1cee-4340-8080-3b7c2b05b1da · outbound

This paper cites Incremental verification of neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Incremental verification of neural networks

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.290305Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.290305Z digest=sha256:83379c21785f702b90f02c07eeb18d3a980dbfd842332d4c327d65d46b40c8f0

Observation 2b4d0781-34ca-486d-9675-d1b9f8b489f8 · outbound

This paper cites Efficient formal safety analysis of neural networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Efficient formal safety analysis of neural networks

Reference 53

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.183337Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.293214Z digest=sha256:c2a4c1c1c61b266cfcaec1657ef3055c60287a3ea05fbe1de260b97e352e1eca

Observation 26cd30e4-6697-4ebf-89f8-46861ce152cc · outbound

This paper cites Formal security analysis of neural networks using symbolic intervals.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Formal security analysis of neural networks using symbolic intervals

Reference 54

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.174276Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.296263Z digest=sha256:d7010b004c881f7a587926ef667ff4085059009ca17a012f9e10271bbf928d25

Observation b6c7e80c-0e1a-439d-9ef5-20acc07f27a8 · outbound

This paper cites Beta-crown: Efficient bound propagation with per-neuron split constraints for neural network robustness verification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Beta-crown: Efficient bound propagation with per-neuron split constraints for neural network robustness verification

Reference 55

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.165397Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.299376Z digest=sha256:8b5f91758001967369ed4a86b9a5428579d3d216188ba9a02a9d5bc75a21a7e1

Observation b2a774f9-2e5c-48ff-99c9-4f6244d0466f · outbound

This paper cites 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.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees 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

Reference 56

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.302569Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.302569Z digest=sha256:46638a4edbf79f33890010f79807f4d925f8be006dd7b5f53301075a192ea446

Observation 75835eed-2c69-48d2-bce6-1966718baea8 · outbound

This paper cites Improving transferability of adversarial examples with input diversity.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Improving transferability of adversarial examples with input diversity

Reference 57

Resolution
unresolved
no resolver link, observed 2026-08-06T14:54:44.305757Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T14:54:44.305757Z digest=sha256:ac4fdb4aa3515fc7c205bffae1fdc538fc7ad38f1a9f2a9447766a0caaf5d419

Observation 27d751f2-8873-43c7-adf1-fb4031ed68fd · outbound

This paper cites kprop: Multi-neuron relaxation method for neural network robustness verification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees kprop: Multi-neuron relaxation method for neural network robustness verification

Reference 58

Resolution
verified exact
doi, observed 2026-08-06T14:54:44.410257Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.308757Z digest=sha256:eacfe8fcec54c6d28fbbf05b0b0ae44a538e0f2585bdcb8b3754a2bc3d7a3ccf

Observation 88629b8e-5e92-409b-b6d7-ebbb82056e6e · outbound

This paper cites Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks

Reference 59

Resolution
verified exact
local_arxiv, observed 2026-08-06T14:54:44.401230Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.311927Z digest=sha256:e4dc72c456f6c8a297aa89bd83248ac87e196017a3dc5e162fbc1d4f217940ee

Observation 4e0d65da-5904-41ea-9c45-47936538a010 · outbound

This paper cites Improving neural network verification through spurious region guided refinement.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Improving neural network verification through spurious region guided refinement

Reference 60

Resolution
verified exact
doi, observed 2026-08-06T14:54:44.389600Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.316761Z digest=sha256:5ad454ce46ef1c06d8f97ffe2ab30ec7ec8aeb560f9dcabde603494a18c203c9

Observation f133450e-36b7-4554-a888-c2310d9e40e5 · outbound

This paper cites Derivative-free optimization via classification.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Derivative-free optimization via classification

Reference 61

Resolution
verified exact
doi, observed 2026-08-06T14:54:44.381082Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.320001Z digest=sha256:6d2c794f77a8dab2fce42174fb8ee3c3bad48af49a2f292bdb9792cfc2eee7e8

Observation e9cbd83d-214d-46d8-bbf1-d1fbd43cbad8 · outbound

This paper cites Dilum Bandara, Shiping Chen, Jianjun Zhao, and Yulei Sui.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Dilum Bandara, Shiping Chen, Jianjun Zhao, and Yulei Sui

Reference 62

Resolution
verified exact
doi, observed 2026-08-06T14:54:44.372192Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.323019Z digest=sha256:3192bf04f7e89283c2a0c0e52af84ec1329296838d69b0eb6a99419338b5b7eb

Observation a582c4ae-349a-452d-a20c-c860650118f4 · outbound

This paper cites A branch and bound framework for stronger adversarial attacks of relu networks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees A branch and bound framework for stronger adversarial attacks of relu networks

Reference 63

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.151466Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.326209Z digest=sha256:4422448468c57d58b24f7a12ef7cba015d93f19bcb1caea0748329a78c780bfd

Observation ee637893-d531-4361-89e8-cf14f12fb00d · outbound

This paper cites Efficient neural network robustness certification with general activation functions.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Efficient neural network robustness certification with general activation functions

Reference 64

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T14:54:45.142513Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.329284Z digest=sha256:8e3f97b25710a37cdbe03b14595551719cca04d7d2a8dd148bf66a25a384fa16

Observation 280f9ba1-4f90-44ef-b026-26c3a358899c · outbound

This paper cites Cleverest: accelerating cegar-based neural network verification via adversarial attacks.

Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees Cleverest: accelerating cegar-based neural network verification via adversarial attacks

Reference 65

Resolution
verified exact
doi, observed 2026-08-06T14:54:44.362300Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-06T14:54:44.332411Z digest=sha256:fd9761efe7f895873dfc6a0f543bba3d1b6a656e2cfa248692a3701ef0a8a6ef

Pith citing papers

No inbound Pith citation observations are available.