{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/provably-bounding-neural-network-preimages-1","title":"Provably Bounding Neural Network Preimages","arxiv_id":"2302.01404","date":"2023-02-02","proceeding":"NeurIPS 2023 11","authors":["Suhas Kotha","Christopher Brix","Zico Kolter","Krishnamurthy Dvijotham","huan zhang"],"abstract":"Most work on the formal verification of neural networks has focused on bounding the set of outputs that correspond to a given set of inputs (for example, bounded perturbations of a nominal input). However, many use cases of neural network verification require solving the inverse problem, or over-approximating the set of inputs that lead to certain outputs. We present the INVPROP algorithm for verifying properties over the preimage of a linearly constrained output set, which can be combined with branch-and-bound to increase precision. Contrary to other approaches, our efficient algorithm is GPU-accelerated and does not require a linear programming solver. We demonstrate our algorithm for identifying safe control regions for a dynamical system via backward reachability analysis, verifying adversarial robustness, and detecting out-of-distribution inputs to a neural network. Our results show that in certain settings, we find over-approximations over 2500x tighter than prior work while being 2.5x faster. By strengthening robustness verification with output constraints, we consistently verify more properties than the previous state-of-the-art on multiple benchmarks, including a large model with 167k neurons in VNN-COMP 2023. Our algorithm has been incorporated into the $\\alpha,\\!\\beta$-CROWN verifier, available at https://abcrown.org.","url_abs":"https://arxiv.org/abs/2302.01404v4","url_pdf":"https://arxiv.org/pdf/2302.01404v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"provably-bounding-neural-network-preimages-1","repo_url":"https://github.com/kothasuhas/verify-input","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"provably-bounding-neural-network-preimages-1","repo_url":"https://github.com/Verified-Intelligence/alpha-beta-CROWN_vnncomp2024","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"provably-bounding-neural-network-preimages-1","repo_url":"https://github.com/avrahamraviv/formal-verification-of-object-detection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"provably-bounding-neural-network-preimages-1","repo_url":"https://github.com/huanzhang12/alpha-beta-CROWN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"provably-bounding-neural-network-preimages-1","repo_url":"https://github.com/verified-intelligence/alpha-beta-crown","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"adversarial-robustness","task_name":"Adversarial Robustness"},{"task_slug":null,"task_name":"GPU"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2302.01404","atlas_url":"https://app.syntology.ai/?focus=2302.01404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01404"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2302.01404"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2302.01404"},"call":"get_harvested_code_for_paper(arxiv_id=\"2302.01404\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2302.01404"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2302.01404\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2302.01404"},"call":"get_concepts_for_paper(arxiv_id=\"2302.01404\")"}],"by_repo":[{"repo":"kothasuhas/verify-input","kind":"official","samples":6,"ran":0,"instrument":0,"unverified":6},{"repo":"Verified-Intelligence/alpha-beta-CROWN_vnncomp2024","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["2011.13824","2103.06624","2208.05740","2405.21063"],"harvested_for_calls":[{"arxiv_id":"2011.13824","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2011.13824"},"call":"get_harvested_code_for_paper(arxiv_id=\"2011.13824\")"},{"arxiv_id":"2103.06624","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.06624"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.06624\")"},{"arxiv_id":"2208.05740","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2208.05740"},"call":"get_harvested_code_for_paper(arxiv_id=\"2208.05740\")"},{"arxiv_id":"2405.21063","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.21063"},"call":"get_harvested_code_for_paper(arxiv_id=\"2405.21063\")"}]},{"repo":"avrahamraviv/formal-verification-of-object-detection","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2208.05740"],"harvested_for_calls":[{"arxiv_id":"2208.05740","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2208.05740"},"call":"get_harvested_code_for_paper(arxiv_id=\"2208.05740\")"}]},{"repo":"huanzhang12/alpha-beta-CROWN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2405.21063"],"harvested_for_calls":[{"arxiv_id":"2405.21063","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.21063"},"call":"get_harvested_code_for_paper(arxiv_id=\"2405.21063\")"}]},{"repo":"verified-intelligence/alpha-beta-crown","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"021bf0c50c494983","source_kind":"harvested","method_name":"INVPROP","realizes_method":"INVPROP","graph_method":"INVPROP","realizes_severed":false,"claim":"The code implements a method to provably bound the preimages of neural networks by optimizing linear relaxations (CROWN-like bounds) under input constraints.","centrality":"contribution","entry":"optimize_bound","entry_sha256":"6aa65dbdbffcb257","n_bricks":6,"bricks":[{"entry":"optimize_bound","code_sha256":"6aa65dbdbffcb257","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"get_crown_bounds","code_sha256":"9a6aff8656d29c80","role":"helper","order":1,"level":0,"status":"unverified"},{"entry":"get_Omega","code_sha256":"095d426f7fe1db6d","role":"helper","order":2,"level":0,"status":"unverified"},{"entry":"get_bias_lbs","code_sha256":"f7bd485aa6a7a27d","role":"helper","order":3,"level":0,"status":"unverified"},{"entry":"get_diagonals","code_sha256":"f9f378e63602dbda","role":"helper","order":4,"level":0,"status":"unverified"},{"entry":"_get_relu_state_masks","code_sha256":"daa5c49fe4662973","role":"helper","order":5,"level":0,"status":"unverified"}],"ran_individually":0,"ran_individually_constructed":0,"ran_individually_by_status":{},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"d48130e4717b","n_siblings":0,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"d48130e4717b","realizes_method":"INVPROP","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["021bf0c50c494983"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2302.01404"},"call":"assembly(arxiv_id=\"2302.01404\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2302.01404.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2302.01404.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/kothasuhas/verify-input","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Verified-Intelligence/alpha-beta-CROWN_vnncomp2024","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/verified-intelligence/alpha-beta-crown","reach":{"status":"ok","spdx":"NOASSERTION"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/huanzhang12/alpha-beta-CROWN","reach":{"status":"ok","spdx":"NOASSERTION"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/avrahamraviv/formal-verification-of-object-detection","reach":null}],"summary":{"unverified":6},"n_samples":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":6,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":6,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"samples":[{"code_sha256":"daa5c49fe4662973","code_sha256_prefix":"daa5c49fe4662973","entry":"_get_relu_state_masks","repo":"kothasuhas/verify-input","repo_kind":"official","path":"reproduce_paper/crown/crown.py","file_url":"https://github.com/kothasuhas/verify-input/blob/HEAD/reproduce_paper/crown/crown.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kothasuhas/verify-input when it was checked","mcp_get_code":{"code_sha256":"daa5c49fe4662973"}},{"code_sha256":"095d426f7fe1db6d","code_sha256_prefix":"095d426f7fe1db6d","entry":"get_Omega","repo":"kothasuhas/verify-input","repo_kind":"official","path":"reproduce_paper/crown/crown.py","file_url":"https://github.com/kothasuhas/verify-input/blob/HEAD/reproduce_paper/crown/crown.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kothasuhas/verify-input when it was checked","mcp_get_code":{"code_sha256":"095d426f7fe1db6d"}},{"code_sha256":"f7bd485aa6a7a27d","code_sha256_prefix":"f7bd485aa6a7a27d","entry":"get_bias_lbs","repo":"kothasuhas/verify-input","repo_kind":"official","path":"reproduce_paper/crown/crown.py","file_url":"https://github.com/kothasuhas/verify-input/blob/HEAD/reproduce_paper/crown/crown.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kothasuhas/verify-input when it was checked","mcp_get_code":{"code_sha256":"f7bd485aa6a7a27d"}},{"code_sha256":"9a6aff8656d29c80","code_sha256_prefix":"9a6aff8656d29c80","entry":"get_crown_bounds","repo":"kothasuhas/verify-input","repo_kind":"official","path":"reproduce_paper/crown/crown.py","file_url":"https://github.com/kothasuhas/verify-input/blob/HEAD/reproduce_paper/crown/crown.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kothasuhas/verify-input when it was checked","mcp_get_code":{"code_sha256":"9a6aff8656d29c80"}},{"code_sha256":"f9f378e63602dbda","code_sha256_prefix":"f9f378e63602dbda","entry":"get_diagonals","repo":"kothasuhas/verify-input","repo_kind":"official","path":"reproduce_paper/crown/crown.py","file_url":"https://github.com/kothasuhas/verify-input/blob/HEAD/reproduce_paper/crown/crown.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kothasuhas/verify-input when it was checked","mcp_get_code":{"code_sha256":"f9f378e63602dbda"}},{"code_sha256":"6aa65dbdbffcb257","code_sha256_prefix":"6aa65dbdbffcb257","entry":"optimize_bound","repo":"kothasuhas/verify-input","repo_kind":"official","path":"reproduce_paper/crown/crown.py","file_url":"https://github.com/kothasuhas/verify-input/blob/HEAD/reproduce_paper/crown/crown.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kothasuhas/verify-input when it was checked","mcp_get_code":{"code_sha256":"6aa65dbdbffcb257"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"dd4dd0db1e18ebc181176369124927a979b6dd2040f504d56d7adac5a706d7a3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}