{"id":"https://openalex.org/W7148726262","doi":"https://doi.org/10.48550/arxiv.2604.01397","title":"EXaCTz: Guaranteed Extremum Graph and Contour Tree Preservation for Distributed- and GPU-Parallel Lossy Compression","display_name":"EXaCTz: Guaranteed Extremum Graph and Contour Tree Preservation for Distributed- and GPU-Parallel Lossy Compression","publication_year":2026,"publication_date":"2026-04-01","ids":{"openalex":"https://openalex.org/W7148726262","doi":"https://doi.org/10.48550/arxiv.2604.01397"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.01397","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01397","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.01397","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025568210","display_name":"Yuxiao Li","orcid":"https://orcid.org/0000-0002-8715-5982"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Li, Yuxiao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113300583","display_name":"Mingze Xia","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xia, Mingze","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132911107","display_name":"Xin Liang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liang, Xin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132847284","display_name":"Bei Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Bei","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132839261","display_name":"Hanqi Guo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guo, Hanqi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5025568210"],"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.4302999973297119,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.4302999973297119,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.10279999673366547,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.0877000018954277,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.6061000227928162},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5256999731063843},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.47699999809265137},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4699999988079071},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.45419999957084656},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.44780001044273376},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.41179999709129333},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.3865000009536743},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3856000006198883}],"concepts":[{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.6061000227928162},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5685999989509583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5676000118255615},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5256999731063843},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.47699999809265137},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4699999988079071},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.45419999957084656},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44780001044273376},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.41179999709129333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38909998536109924},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.3865000009536743},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3856000006198883},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3797000050544739},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.34630000591278076},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.3433000147342682},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3052999973297119},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.3050999939441681},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C110521144","wikidata":"https://www.wikidata.org/wiki/Q193460","display_name":"Scalar field","level":2,"score":0.29100000858306885},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.2745000123977661},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2671000063419342},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C7545210","wikidata":"https://www.wikidata.org/wiki/Q838123","display_name":"Data redundancy","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.01397","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01397","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.01397","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01397","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2,84],"EXaCTz,":[3],"a":[4,38,73,85,155,173,194,204,222],"parallel":[5],"algorithm":[6,88,127],"that":[7,89,103,158,170],"concurrently":[8],"preserves":[9],"extremum":[10,133],"graphs":[11],"and":[12,30,71,135,201,236],"contour":[13],"trees":[14],"in":[15,154,232],"lossy-compressed":[16],"scalar":[17],"field":[18],"data.":[19,99],"While":[20],"error-bounded":[21],"lossy":[22],"compression":[23,57],"is":[24],"essential":[25],"for":[26,67,97,198,221],"large-scale":[27],"scientific":[28],"simulations":[29],"workflows,":[31],"existing":[32],"topology-preserving":[33],"methods":[34,102],"suffer":[35],"from":[36],"(1)":[37],"significant":[39],"throughput":[40,175,241],"disparity,":[41],"where":[42],"topology":[43,107],"correction":[44,240],"speeds":[45,58],"are":[46],"on":[47,59,105,166],"the":[48,60,126,136,144,151,182],"order":[49,61],"of":[50,54,62,75,114,138,146,176,227,242],"MB/s,":[51],"lagging":[52],"orders":[53],"magnitude":[55],"behind":[56],"GB/s,":[63,180],"(2)":[64],"limited":[65],"support":[66],"diverse":[68],"topological":[69,91],"descriptors,":[70],"(3)":[72],"lack":[74],"theoretical":[76],"convergence":[77,145],"bounds.":[78],"To":[79],"address":[80],"these":[81],"challenges,":[82],"EXaCTz":[83,109,171,210],"high-performance,":[86],"bounded-iteration":[87],"enforces":[90,110,128],"consistency":[92],"by":[93,150,189],"deriving":[94],"targeted":[95],"edits":[96],"decompressed":[98],"Unlike":[100],"prior":[101],"rely":[104],"explicit":[106],"reconstruction,":[108],"consistent":[111,129],"min/max":[112],"neighbors":[113],"all":[115],"vertices,":[116],"along":[117],"with":[118,215,219],"global":[119],"ordering":[120],"among":[121],"critical":[122],"points.":[123],"As":[124],"such,":[125],"critical-point":[130],"classification,":[131],"saddle":[132],"connectivity,":[134],"preservation":[137],"merge/split":[139],"events.":[140],"We":[141],"theoretically":[142],"prove":[143],"our":[147],"algorithm,":[148],"bounded":[149],"longest":[152],"path":[153],"vulnerability":[156],"graph":[157],"characterizes":[159],"potential":[160],"cascading":[161],"effects":[162],"during":[163],"correction.":[164],"Experiments":[165],"real-world":[167],"datasets":[168,226],"show":[169],"achieves":[172],"single-GPU":[174,205],"up":[177,190,228,243],"to":[178,191,212,229,244],"4.52":[179],"outperforming":[181],"state-of-the-art":[183],"contour-tree-preserving":[184],"method":[185],"(Gorski":[186],"et":[187],"al.)":[188],"213x":[192],"(with":[193,203],"single-core":[195],"CPU":[196],"implementation":[197],"fair":[199],"comparison)":[200],"3,285x":[202],"version).":[206],"In":[207],"distributed":[208],"environments,":[209],"scales":[211],"128":[213],"GPUs":[214],"55.6\\%":[216],"efficiency":[217],"(compared":[218],"6.4\\%":[220],"naive":[223],"parallelization),":[224],"processing":[225],"512":[230],"GB":[231],"under":[233],"48":[234],"seconds":[235],"achieving":[237],"an":[238],"aggregate":[239],"32.69":[245],"GB/s.":[246]},"counts_by_year":[],"updated_date":"2026-04-04T06:15:33.020886","created_date":"2026-04-04T00:00:00"}