{"id":"https://openalex.org/W7204916796","doi":"https://doi.org/10.48550/arxiv.2608.31061","title":"Structural Corrections to the Bethe Approximation of the Permanent","display_name":"Structural Corrections to the Bethe Approximation of the Permanent","publication_year":2026,"publication_date":"2026-08-31","ids":{"openalex":"https://openalex.org/W7204916796","doi":"https://doi.org/10.48550/arxiv.2608.31061"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2608.31061","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.31061","pdf_url":"https://arxiv.org/pdf/2608.31061","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2608.31061","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120614953","display_name":"Ijay Narang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Narang, Ijay","raw_affiliation_strings":["School of Computer Science , Georgia Institute of Technology ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science , Georgia Institute of Technology ,","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010848870","display_name":"Will Perkins","orcid":"https://orcid.org/0000-0002-7937-7016","observed_orcids":["https://orcid.org/0000-0002-7937-7016"]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Perkins, Will","raw_affiliation_strings":["School of Computer Science , Georgia Institute of Technology ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science , Georgia Institute of Technology ,","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":4,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0013000000035390258,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/permanent","display_name":"permanent","score":0.8100000023841858},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.765999972820282},{"id":"https://openalex.org/keywords/nonnegative-matrices","display_name":"nonnegative matrices","score":0.8389999866485596},{"id":"https://openalex.org/keywords/peeling-algorithm","display_name":"peeling algorithm","score":0.5070000290870667},{"id":"https://openalex.org/keywords/deterministic-approximation","display_name":"deterministic approximation","score":0.4269999861717224},{"id":"https://openalex.org/keywords/polynomial-time-approximation","display_name":"polynomial-time approximation","score":0.4269999861717224},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.5860000252723694}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7196000218391418},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5914999842643738},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4814000129699707},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4675000011920929},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44269999861717224},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4009999930858612},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3986999988555908},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39329999685287476},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.37709999084472656},{"id":"https://openalex.org/C77843276","wikidata":"https://www.wikidata.org/wiki/Q831226","display_name":"Bethe ansatz","level":3,"score":0.3472999930381775},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.32109999656677246},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.3102000057697296},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.25209999084472656}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2608.31061","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.31061","pdf_url":"https://arxiv.org/pdf/2608.31061","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2608.31061","doi":"https://doi.org/10.48550/arxiv.2608.31061","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2608.31061","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,"listed_in":[],"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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2608.31061","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.31061","pdf_url":"https://arxiv.org/pdf/2608.31061","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G5281999466","display_name":"Collaborative Research: AF: Small: Sampling and Optimization under Global Constraints","funder_award_id":"2309708","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7204916796.pdf","grobid_xml":"https://content.openalex.org/works/W7204916796.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W1594620223","https://openalex.org/W7204805534"],"related_works":["https://openalex.org/W2899996831","https://openalex.org/W7204805534","https://openalex.org/W2161055874","https://openalex.org/W3082447721","https://openalex.org/W7212258185","https://openalex.org/W4310901894","https://openalex.org/W7212171764","https://openalex.org/W7095761188","https://openalex.org/W7125768608","https://openalex.org/W4386075097"],"abstract_inverted_index":{"We":[0,65],"study":[1],"deterministic":[2,137],"approximation":[3,17],"algorithms":[4],"for":[5,142],"the":[6,13,34,37,49,98,107,117,129,143],"permanent":[7,35,39,119,144],"of":[8,25,48,56,95,124,128,145],"a":[9,30,41,54,78,92,122,136],"nonnegative":[10,148],"matrix":[11],"through":[12],"Bethe":[14,38,79,108,118],"permanent,":[15],"an":[16,146],"computable":[18],"in":[19],"polynomial":[20,138],"time.":[21],"The":[22,45],"tight":[23],"analysis":[24],"Anari":[26],"and":[27,36,74,89],"Rezaei":[28],"gives":[29],"universal":[31],"comparison":[32],"between":[33],"within":[40,121],"factor":[42,123],"$(\\sqrt":[43],"2)^n$.":[44],"simple":[46],"example":[47],"unweighted":[50],"$4$-cycle":[51,69],"$C_4$":[52],"(or":[53],"union":[55],"disjoint":[57],"$C_4$'s)":[58],"shows":[59],"that":[60,67,116],"this":[61],"bound":[62],"is":[63,102,112,120,154],"tight.":[64],"show":[66,115],"such":[68],"obstructions":[70],"can":[71,105],"be":[72],"identified":[73],"exploited":[75],"algorithmically.":[76],"Given":[77],"optimizer,":[80],"our":[81],"algorithm":[82,141],"identifies":[83],"nearly":[84],"isolated":[85],"weighted":[86,100],"$2\\times2$":[87],"blocks":[88],"peels":[90],"off":[91],"vertex-disjoint":[93],"family":[94],"them.":[96],"If":[97],"total":[99],"correction":[101],"large,":[103],"we":[104,114,134],"improve":[106],"approximation;":[109],"if":[110],"it":[111],"small,":[113],"$(\\sqrt2":[125],"-":[126],"\\varepsilon)^n$":[127],"truth.":[130],"Combining":[131],"these":[132],"facts,":[133],"obtain":[135],"time":[139],"$(\\sqrt2-\\varepsilon)^n$-approximation":[140],"arbitrary":[147],"$n\\times":[149],"n$":[150],"matrix,":[151],"where":[152],"$\\varepsilon>0$":[153],"some":[155],"absolute":[156],"constant.":[157]},"counts_by_year":[{"year":2026,"cited_by_count":4}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-02T00:00:00"}