Huan Zhang, Cho-Jui Hsieh, Shiqi Wang, Suman Jana, Xue Lin, Yihan Wang, Kaidi Xu
1 of 2 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 0 failures of our instrument; 1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2011.13824.json · badge: /api/ran/2011.13824.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| Verified-Intelligence/alpha-beta-CROWN_vnncomp2024 | reimplementation (classifier label) classifier basis: classifier_2025 |
1 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_unstable_size | Ran ran, honoured the contract we drafted |
Verified-Intelligence/alpha-beta-CROWN_vnncomp2024/auto_LiRPA/backward_bound.py pointer only (licence: NOASSERTION) · get_code("d5f02d6ed407b5ca") How it ranThe body of this sample is withheld: GitHub could not classify the licence of this paper's repository, Verified-Intelligence/alpha-beta-CROWN_vnncomp2024 (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| batched_backward | Not yet run unverified (harvested, no recorded run) |
Verified-Intelligence/alpha-beta-CROWN_vnncomp2024/auto_LiRPA/backward_bound.py pointer only (licence: NOASSERTION) · get_code("8ce44ae4ee73df92") How it ranThe body of this sample is withheld: GitHub could not classify the licence of this paper's repository, Verified-Intelligence/alpha-beta-CROWN_vnncomp2024 (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 1 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 1 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| get_unstable_size | 2 other papers 2 later |
2210.07394 (2022-10) Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound Propagation |
2405.21063 (2024-05) Neural Network Verification with Branch-and-Bound for General Nonlinearities |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Formal verification of neural networks (NNs) is a challenging and important problem. Existing efficient complete solvers typically require the branch-and-bound (BaB) process, which splits the problem domain into sub-domains and solves each sub-domain using faster but weaker incomplete verifiers, such as Linear Programming (LP) on linearly relaxed sub-domains. In this paper, we propose to use the backward mode linear relaxation based perturbation analysis (LiRPA) to replace LP during the BaB process, which can be efficiently implemented on the typical machine learning accelerators such as GPUs and TPUs. However, unlike LP, LiRPA when applied naively can produce much weaker bounds and even cannot check certain conflicts of sub-domains during splitting, making the entire procedure incomplete after BaB. To address these challenges, we apply a fast gradient based bound tightening procedure combined with batch splits and the design of minimal usage of LP bound procedure, enabling us to effectively use LiRPA on the accelerator hardware for the challenging complete NN verification problem and significantly outperform LP-based approaches. On a single GPU, we demonstrate an order of magnitude speedup compared to existing LP-based approaches. Recently, a Branch and Bound (BaB) style framework (Bunel et al., 2018; 2020b) has been adopted for efficient complete verification. BaB solves the optimization problem min x∈C f (x) to a global * Equal Contribution.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2011.13824")
get_code_for_paper("2011.13824")
have("2011.13824")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2011.13824.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2011.13824)
Connect an agent — have() is free.