{"id":"https://openalex.org/W4415250756","doi":"https://doi.org/10.1109/hpec67600.2025.11196094","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","display_name":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","publication_year":2025,"publication_date":"2025-09-15","ids":{"openalex":"https://openalex.org/W4415250756","doi":"https://doi.org/10.1109/hpec67600.2025.11196094"},"language":"en","primary_location":{"id":"doi:10.1109/hpec67600.2025.11196094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-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/A5120024837","display_name":"Atieh Barati Nia","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Atieh Barati Nia","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012058924","display_name":"Mohammad Dindoost","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Dindoost","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076610730","display_name":"David A. Bader","orcid":"https://orcid.org/0000-0002-7380-5876"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David A. Bader","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Data Science,Newark,NJ,USA","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5120024837"],"corresponding_institution_ids":["https://openalex.org/I118118575"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30645345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9495000243186951,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9495000243186951,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.935699999332428,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9294000267982483,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/correctness","display_name":"Correctness","score":0.6685000061988831},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.5906000137329102},{"id":"https://openalex.org/keywords/scripting-language","display_name":"Scripting language","score":0.5266000032424927},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.511900007724762},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4916999936103821},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.43459999561309814},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.3968000113964081},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3937999904155731},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.38940000534057617}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.781000018119812},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6685000061988831},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.5906000137329102},{"id":"https://openalex.org/C61423126","wikidata":"https://www.wikidata.org/wiki/Q187432","display_name":"Scripting language","level":2,"score":0.5266000032424927},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.511900007724762},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4916999936103821},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.43459999561309814},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4142000079154968},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.3968000113964081},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3937999904155731},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.38940000534057617},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3808000087738037},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.34860000014305115},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.3479999899864197},{"id":"https://openalex.org/C70587473","wikidata":"https://www.wikidata.org/wiki/Q7834111","display_name":"Transformative learning","level":2,"score":0.32670000195503235},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.31279999017715454},{"id":"https://openalex.org/C38721330","wikidata":"https://www.wikidata.org/wiki/Q80056","display_name":"Sonnet","level":3,"score":0.3125999867916107},{"id":"https://openalex.org/C46681722","wikidata":"https://www.wikidata.org/wiki/Q4725589","display_name":"Alias","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.29910001158714294},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C152752567","wikidata":"https://www.wikidata.org/wiki/Q116877","display_name":"Code refactoring","level":3,"score":0.2827000021934509},{"id":"https://openalex.org/C70437156","wikidata":"https://www.wikidata.org/wiki/Q7228652","display_name":"Pooling","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C2983609787","wikidata":"https://www.wikidata.org/wiki/Q10534782","display_name":"Software implementation","level":3,"score":0.27469998598098755},{"id":"https://openalex.org/C2988963302","wikidata":"https://www.wikidata.org/wiki/Q629206","display_name":"Program code","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.26330000162124634},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.2628999948501587},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26249998807907104},{"id":"https://openalex.org/C135257023","wikidata":"https://www.wikidata.org/wiki/Q691358","display_name":"Domain-specific language","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C153180980","wikidata":"https://www.wikidata.org/wiki/Q19776675","display_name":"Commit","level":2,"score":0.2574000060558319}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec67600.2025.11196094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1482680420","https://openalex.org/W1489509891","https://openalex.org/W4312438588","https://openalex.org/W4384026634","https://openalex.org/W4390188839","https://openalex.org/W4390189048","https://openalex.org/W4391136507","https://openalex.org/W4399577572","https://openalex.org/W4404782360","https://openalex.org/W4404782502","https://openalex.org/W4405601545","https://openalex.org/W4407551092"],"related_works":[],"abstract_inverted_index":{"Large":[0],"Language":[1],"Models":[2],"(LLMs)":[3],"are":[4,117],"increasingly":[5],"used":[6],"to":[7,45,78,131,144,195,216],"automate":[8],"software":[9,34],"development,":[10],"yet":[11],"most":[12],"prior":[13],"evaluations":[14],"focus":[15],"on":[16,232],"functional":[17],"correctness":[18],"or":[19],"high-level":[20],"languages":[21],"such":[22],"as":[23,71],"Python.":[24],"As":[25],"one":[26],"of":[27,32,42,50,64,129,226],"the":[28,76,127,190,227],"first":[29,124],"systematic":[30],"explorations":[31],"LLM-assisted":[33,65],"performance":[35,163],"engineering,":[36],"we":[37],"present":[38],"a":[39,202],"comprehensive":[40],"study":[41],"LLMs\u2019":[43],"ability":[44,128],"generate":[46,132,145],"efficient":[47],"C":[48],"implementations":[49],"graph-analysis":[51],"routines\u2014code":[52],"that":[53,82,134,156,180],"must":[54],"satisfy":[55],"stringent":[56],"runtime":[57],"and":[58,86,95,101,108,113,168,186,213],"memory":[59],"constraints.":[60],"This":[61],"emerging":[62],"field":[63],"algorithm":[66],"engineering":[67],"holds":[68],"significant":[69],"promise,":[70],"these":[72,193],"models":[73,91,194],"may":[74],"possess":[75],"capability":[77,143],"design":[79],"novel":[80],"approaches":[81],"improve":[83],"existing":[84,136],"algorithms":[85,133,147],"their":[87,142],"implementations.":[88],"Eight":[89],"state-of-the-art":[90],"(OpenAI":[92],"ChatGPT":[93],"o3":[94],"o4-mini-high,":[96],"Anthropic":[97],"Claude":[98,157],"4":[99,159],"Sonnet":[100,102,158],"Extended,":[103],"Google":[104],"Gemini":[105],"2.5":[106],"Flash":[107],"Pro,":[109],"xAI":[110],"Grok":[111],"3-Think,":[112],"DeepSeek":[114],"DeepThink":[115],"R1)":[116],"benchmarked":[118],"using":[119],"two":[120],"distinct":[121],"approaches.":[122],"The":[123,138,153],"approach":[125,140],"evaluates":[126],"LLMs":[130,182],"outperform":[135],"benchmarks.":[137],"second":[139],"assesses":[141],"graph":[146],"for":[148,192,205],"integration":[149],"into":[150],"performance-critical":[151],"systems.":[152],"results":[154],"show":[155],"Extended":[160],"achieves":[161],"superior":[162],"in":[164,173,184,220],"ready-to-use":[165],"code":[166,229],"generation":[167],"efficiency,":[169],"outperforming":[170],"human-written":[171],"baselines":[172],"triangle":[174],"counting.":[175],"Although":[176],"our":[177],"findings":[178],"demonstrate":[179],"contemporary":[181],"excel":[183],"optimizing":[185],"integrating":[187],"established":[188],"algorithms,":[189],"potential":[191],"eventually":[196],"invent":[197],"transformative":[198],"algorithmic":[199],"techniques":[200],"represents":[201],"compelling":[203],"frontier":[204],"future":[206],"research.":[207],"We":[208],"provide":[209],"prompts,":[210],"generated":[211],"code,":[212],"measurement":[214],"scripts":[215],"promote":[217],"reproducible":[218],"research":[219],"this":[221],"rapidly":[222],"evolving":[223],"domain.":[224],"All":[225],"source":[228],"is":[230],"available":[231],"GitHub":[233],"at":[234],"https://github.com/Bader-Research/LLM-triangle-counting/.":[235]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-16T00:00:00"}