{"id":"https://openalex.org/W3008068881","doi":"https://doi.org/10.1109/tnet.2020.2969523","title":"On Fundamental Bounds on Failure Identifiability by Boolean Network Tomography","display_name":"On Fundamental Bounds on Failure Identifiability by Boolean Network Tomography","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3008068881","doi":"https://doi.org/10.1109/tnet.2020.2969523","mag":"3008068881"},"language":"en","primary_location":{"id":"pmh:oai:iris.uniroma1.it:11573/1393018","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/1393018","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":[],"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/A5081384199","display_name":"Novella Bartolini","orcid":"https://orcid.org/0000-0002-1278-4549"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Bartolini N.","raw_affiliation_strings":["Department of Computer Science, Sapienza University of Rome, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088400668","display_name":"Ting He","orcid":"https://orcid.org/0000-0003-1070-7483"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"He T.","raw_affiliation_strings":["Department of Computer Science and Engineering, Pennsylvania State University, University Park, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Pennsylvania State University, University Park, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014863005","display_name":"Viviana Arrigoni","orcid":"https://orcid.org/0000-0002-1411-9091"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Arrigoni V.","raw_affiliation_strings":["Department of Computer Science, Sapienza University of Rome, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061205069","display_name":"Annalisa Massini","orcid":"https://orcid.org/0000-0001-8343-8929"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Massini A.","raw_affiliation_strings":["Department of Computer Science, Sapienza University of Rome, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065503000","display_name":"Federico Trombetti","orcid":"https://orcid.org/0000-0001-6640-1972"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Trombetti F.","raw_affiliation_strings":["Department of Computer Science, Sapienza University of Rome, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080827772","display_name":"Hana Khamfroush","orcid":"https://orcid.org/0000-0002-4859-814X"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Khamfroush H.","raw_affiliation_strings":["Department of Computer Science, University of Kentucky, Lexington, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kentucky, Lexington, USA","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5081384199"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":3.561,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.92986042,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12127","display_name":"Software System Performance and Reliability","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9790999889373779,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11512","display_name":"Anomaly Detection Techniques and Applications","score":0.9750999808311462,"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/identifiability","display_name":"Identifiability","score":0.8916337490081787},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6713886857032776},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6555548310279846},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.562487006187439},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5506495833396912},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5384781956672668},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5307281613349915},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.5135891437530518},{"id":"https://openalex.org/keywords/network-tomography","display_name":"Network tomography","score":0.48308613896369934},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4753377437591553},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4532025456428528},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.44543036818504333},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4384477436542511},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4334535300731659},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3702138364315033},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3467326760292053},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.27196356654167175},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1412152349948883},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10075461864471436}],"concepts":[{"id":"https://openalex.org/C122770356","wikidata":"https://www.wikidata.org/wiki/Q1656753","display_name":"Identifiability","level":2,"score":0.8916337490081787},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6713886857032776},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6555548310279846},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.562487006187439},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5506495833396912},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5384781956672668},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5307281613349915},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.5135891437530518},{"id":"https://openalex.org/C146368544","wikidata":"https://www.wikidata.org/wiki/Q3408544","display_name":"Network tomography","level":3,"score":0.48308613896369934},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4753377437591553},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4532025456428528},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.44543036818504333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4384477436542511},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4334535300731659},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3702138364315033},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3467326760292053},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.27196356654167175},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1412152349948883},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10075461864471436},{"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:iris.uniroma1.it:11573/1393018","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/1393018","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4784400162","display_name":null,"funder_award_id":"HDTRA1-10-1-0085","funder_id":"https://openalex.org/F4320332186","funder_display_name":"Defense Threat Reduction Agency"},{"id":"https://openalex.org/G5045519773","display_name":null,"funder_award_id":"G4936 SONiCS","funder_id":"https://openalex.org/F4320307849","funder_display_name":"North Atlantic Treaty Organization"}],"funders":[{"id":"https://openalex.org/F4320307849","display_name":"North Atlantic Treaty Organization","ror":"https://ror.org/05xagc088"},{"id":"https://openalex.org/F4320332186","display_name":"Defense Threat Reduction Agency","ror":"https://ror.org/04tz64554"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1104700549","https://openalex.org/W1975680434","https://openalex.org/W2017274979","https://openalex.org/W2031558773","https://openalex.org/W2037721173","https://openalex.org/W2042876290","https://openalex.org/W2101627389","https://openalex.org/W2112838414","https://openalex.org/W2115303222","https://openalex.org/W2130531694","https://openalex.org/W2137789694","https://openalex.org/W2170378215","https://openalex.org/W2170587003","https://openalex.org/W2170985435","https://openalex.org/W2258641260","https://openalex.org/W2481573243","https://openalex.org/W2507955396","https://openalex.org/W2584825104","https://openalex.org/W2762746414","https://openalex.org/W2803843146","https://openalex.org/W3008068881","https://openalex.org/W3103169419"],"related_works":["https://openalex.org/W2724847603","https://openalex.org/W2034041141","https://openalex.org/W2184661725","https://openalex.org/W4249955856","https://openalex.org/W2481573243","https://openalex.org/W1527895164","https://openalex.org/W3035785974","https://openalex.org/W2920713474","https://openalex.org/W2349785426","https://openalex.org/W2390624985"],"abstract_inverted_index":{"Boolean":[0,107],"network":[1,31,85,108,130],"tomography":[2],"is":[3,43],"a":[4,46,99],"powerful":[5],"tool":[6],"to":[7,54,116,123],"infer":[8],"the":[9,23,27,34,68,75,84,87,91,125,138,141,146],"state":[10],"(working/failed)":[11],"of":[12,25,29,36,49,71,77,104,140,145],"individual":[13],"nodes":[14],"from":[15],"path-level":[16],"measurements":[17],"obtained":[18],"by":[19],"edge-nodes.":[20],"We":[21],"consider":[22],"problem":[24],"optimizing":[26],"capability":[28],"identifying":[30],"failures":[32,105],"through":[33],"design":[35,117,147],"monitoring":[37,78,121],"schemes.":[38],"Finding":[39],"an":[40],"optimal":[41],"solution":[42],"NP-hard":[44],"and":[45,80,90,119,134,143],"large":[47],"body":[48],"work":[50],"has":[51],"been":[52],"devoted":[53],"heuristic":[55],"approaches":[56],"providing":[57],"lower":[58],"bounds.":[59],"Unlike":[60],"previous":[61],"works,":[62],"we":[63,136],"provide":[64],"upper":[65,96],"bounds":[66,97,142],"on":[67,83,102,114],"maximum":[69,92,126],"number":[70,76],"identifiable":[72],"nodes,":[73],"given":[74],"paths":[79],"different":[81],"constraints":[82],"topology,":[86],"routing":[88],"scheme,":[89],"path":[93],"length.":[94],"These":[95],"represent":[98],"fundamental":[100],"limit":[101],"identifiability":[103,127],"via":[106],"tomography.":[109],"Our":[110],"analysis":[111,133],"provides":[112],"insights":[113,148],"how":[115],"topologies":[118],"related":[120],"schemes":[122],"achieve":[124],"under":[128],"various":[129],"settings.":[131],"Through":[132],"experiments":[135],"demonstrate":[137],"tightness":[139],"efficacy":[144],"for":[149],"engineered":[150],"as":[151,153],"well":[152],"real":[154],"networks.":[155]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}