{"id":"https://openalex.org/W4387971418","doi":"https://doi.org/10.3233/fi-222160","title":"Reachability in Simple Neural Networks","display_name":"Reachability in Simple Neural Networks","publication_year":2023,"publication_date":"2023-10-26","ids":{"openalex":"https://openalex.org/W4387971418","doi":"https://doi.org/10.3233/fi-222160"},"language":"en","primary_location":{"id":"doi:10.3233/fi-222160","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-222160","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019371898","display_name":"Marco S\u00e4lzer","orcid":"https://orcid.org/0000-0002-8012-5465"},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Marco S\u00e4lzer","raw_affiliation_strings":["School of Electr. Eng. and Computer Science, University of Kassel, Germany. marco.saelzer@uni-kassel.de, martin.lange@uni-kassel.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electr. Eng. and Computer Science, University of Kassel, Germany. marco.saelzer@uni-kassel.de, martin.lange@uni-kassel.de","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087768042","display_name":"Martin Lange","orcid":"https://orcid.org/0000-0002-1621-0972"},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Lange","raw_affiliation_strings":["School of Electr. Eng. and Computer Science, University of Kassel, Germany. marco.saelzer@uni-kassel.de, martin.lange@uni-kassel.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electr. Eng. and Computer Science, University of Kassel, Germany. marco.saelzer@uni-kassel.de, martin.lange@uni-kassel.de","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"last","author":{"id":null,"display_name":"Martin Lange","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Lange","raw_affiliation_strings":["School of Electr. Eng. and Computer Science, University of Kassel, Germany. marco.saelzer@uni-kassel.de, martin.lange@uni-kassel.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electr. Eng. and Computer Science, University of Kassel, Germany. marco.saelzer@uni-kassel.de, martin.lange@uni-kassel.de","institution_ids":["https://openalex.org/I106157433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019371898","https://openalex.org/A5087768042"],"corresponding_institution_ids":["https://openalex.org/I106157433"],"apc_list":null,"apc_paid":null,"fwci":0.1667,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57363597,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"189","issue":"3-4","first_page":"241","last_page":"259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8909597396850586},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.8078628778457642},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.7900964617729187},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7631317377090454},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.7225111126899719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5406754016876221},{"id":"https://openalex.org/keywords/deep-neural-networks","display_name":"Deep neural networks","score":0.4813466966152191},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47964364290237427},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.4480413496494293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3809489905834198},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35877835750579834},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35022151470184326},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3406229019165039},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24707496166229248},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1427638828754425}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8909597396850586},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.8078628778457642},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7900964617729187},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7631317377090454},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.7225111126899719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5406754016876221},{"id":"https://openalex.org/C2984842247","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep neural networks","level":3,"score":0.4813466966152191},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47964364290237427},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4480413496494293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3809489905834198},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35877835750579834},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35022151470184326},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3406229019165039},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24707496166229248},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1427638828754425},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-222160","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-222160","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W4224983736","https://openalex.org/W2060144422","https://openalex.org/W2011495892","https://openalex.org/W4389158950"],"abstract_inverted_index":{"We":[0,46],"investigate":[1],"the":[2,5,26,37,48,55,64],"complexity":[3],"of":[4,43,76,92,123,129],"reachability":[6],"problem":[7,27],"for":[8,30,73,83,126],"(deep)":[9],"neural":[10,32,80,97,132],"networks:":[11],"does":[12],"it":[13],"compute":[14],"valid":[15,19],"output":[16,90],"given":[17,40],"some":[18,52],"input?":[20],"It":[21],"was":[22],"recently":[23],"claimed":[24],"that":[25,69],"is":[28,110],"NP-complete":[29],"general":[31,65],"networks":[33,98],"and":[34,50,58,79,88,104,121],"specifications":[35,78],"over":[36],"input/output":[38],"dimension":[39,91],"by":[41,63],"conjunctions":[42],"linear":[44],"inequalities.":[45],"recapitulate":[47],"proof":[49],"repair":[51],"flaws":[53],"in":[54],"original":[56],"upper":[57],"lower":[59],"bound":[60],"proofs.":[61],"Motivated":[62],"result,":[66],"we":[67,116],"show":[68],"NP-hardness":[70],"already":[71],"holds":[72],"restricted":[74],"classes":[75],"simple":[77],"networks.":[81],"Allowing":[82],"a":[84,118],"single":[85],"hidden":[86],"layer":[87],"an":[89],"one":[93,101,105],"as":[94,96],"well":[95],"with":[99],"just":[100],"negative,":[102],"zero":[103],"positive":[106],"weight":[107],"or":[108],"bias":[109],"sufficient":[111],"to":[112],"ensure":[113],"NP-hardness.":[114],"Additionally,":[115],"give":[117],"thorough":[119],"discussion":[120],"outlook":[122],"possible":[124],"extensions":[125],"this":[127],"direction":[128],"research":[130],"on":[131],"network":[133],"verification.":[134]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-15T06:05:50.897203","created_date":"2025-10-10T00:00:00"}
