{"id":"https://openalex.org/W7168385275","doi":"https://doi.org/10.48550/arxiv.2607.11952","title":"Scalable Optimal Transport Algorithm for Network Alignment","display_name":"Scalable Optimal Transport Algorithm for Network Alignment","publication_year":2026,"publication_date":"2026-07-11","ids":{"openalex":"https://openalex.org/W7168385275","doi":"https://doi.org/10.48550/arxiv.2607.11952"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.11952","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.11952","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.11952","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140829783","display_name":"Elaheh Hassani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hassani, Elaheh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140960435","display_name":"Durga Mandarapu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mandarapu, Durga","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140927013","display_name":"Qi Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Qi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140849318","display_name":"Hanghang Tong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tong, Hanghang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140870263","display_name":"Ariful Azad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Azad, Ariful","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.595300018787384,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.595300018787384,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.1712000072002411,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.15850000083446503,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.8001000285148621},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6965000033378601},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5250999927520752},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5187000036239624},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.5027999877929688},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4794999957084656},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.40459999442100525},{"id":"https://openalex.org/keywords/dynamic-network-analysis","display_name":"Dynamic network analysis","score":0.33480000495910645}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8201000094413757},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8001000285148621},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6965000033378601},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5250999927520752},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5187000036239624},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.5027999877929688},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4794999957084656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4781000018119812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4219000041484833},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.40459999442100525},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3849000036716461},{"id":"https://openalex.org/C13540734","wikidata":"https://www.wikidata.org/wiki/Q5318996","display_name":"Dynamic network analysis","level":2,"score":0.33480000495910645},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30660000443458557},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.30649998784065247},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.30329999327659607},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.2833000123500824},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C100595998","wikidata":"https://www.wikidata.org/wiki/Q11731931","display_name":"Graph kernel","level":5,"score":0.2741999924182892},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.27379998564720154},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.25679999589920044},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.25589999556541443},{"id":"https://openalex.org/C104122410","wikidata":"https://www.wikidata.org/wiki/Q1416406","display_name":"Network model","level":2,"score":0.2551000118255615}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.11952","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.11952","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.11952","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.11952","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.770971953868866}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Network":[0],"alignment":[1,31,56,75,115],"identifies":[2],"node":[3],"correspondences":[4],"across":[5],"different":[6],"networks":[7],"and":[8,24,40,83,132],"is":[9],"a":[10,61,73,88,105],"fundamental":[11],"primitive":[12],"in":[13,46],"many":[14],"data":[15],"science":[16],"applications,":[17],"including":[18,104],"social":[19],"network":[20,30,68],"analysis,":[21],"fraud":[22],"detection,":[23],"knowledge":[25],"graph":[26,98],"integration.":[27],"However,":[28],"state-of-the-art":[29,119],"methods":[32,121],"often":[33],"achieve":[34],"high":[35],"accuracy":[36],"by":[37],"repeatedly":[38],"constructing":[39],"updating":[41],"dense":[42],"matrices,":[43],"sacrificing":[44],"scalability":[45,52],"the":[47,79],"process.":[48],"To":[49],"address":[50],"this":[51],"limitation":[53],"without":[54],"compromising":[55],"accuracy,":[57],"we":[58],"present":[59],"FastAlign,":[60],"scalable,":[62],"sparsity-aware":[63,97],"framework":[64],"for":[65],"optimal":[66],"transport-based":[67],"alignment.":[69],"Rather":[70],"than":[71],"introducing":[72],"new":[74],"model,":[76],"FastAlign":[77,95,113],"preserves":[78],"original":[80],"OT":[81],"formulation":[82],"reinterprets":[84],"its":[85],"computation":[86,99],"as":[87],"set":[89],"of":[90],"recurring":[91],"mixed":[92],"sparse-dense":[93],"operations.":[94],"combines":[96],"with":[100],"domain-specific":[101],"kernel":[102],"fusion,":[103],"custom":[106],"SpMM":[107],"kernel.":[108],"Our":[109],"results":[110],"show":[111],"that":[112],"achieves":[114],"quality":[116],"comparable":[117],"to":[118,128],"OT-based":[120],"while":[122],"substantially":[123],"reducing":[124],"end-to-end":[125],"runtime":[126],"up":[127],"3.89x-9.45x":[129],"on":[130,134],"CPU":[131],"2.24x-32.54x":[133],"GPU.":[135]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-16T00:00:00"}