{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T00:10:01Z","timestamp":1760746201586,"version":"build-2065373602"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T00:00:00Z","timestamp":1757894400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T00:00:00Z","timestamp":1757894400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009224","name":"Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009224","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006168","name":"National Nuclear Security Administration","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006168","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,15]]},"DOI":"10.1109\/hpec67600.2025.11196484","type":"proceedings-article","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T17:35:37Z","timestamp":1760636137000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["When Structure is Silent: Opportunities for Algorithmic Dispatch in Linear Algebra"],"prefix":"10.1109","author":[{"given":"Emmanuel","family":"Lujan","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology,Computer Science & Artificial Intelligence Laboratory,Cambridge,Massachusetts,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Edelman","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology,Computer Science & Artificial Intelligence Laboratory,Cambridge,Massachusetts,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/992200.992205"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1824801.1824814"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932737"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492922000022"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC62836.2024.10938467"},{"article-title":"Efficient dynamic task scheduling in heterogeneous environments with julia","year":"2024","author":"Samaroo","key":"ref7"},{"article-title":"Alphaevolve: A coding agent for scientific and algorithmic discovery","year":"2025","author":"Novikov","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-022-05172-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542481"},{"article-title":"Smartsolve.jl: Ai for algorithmic discovery","year":"2025","author":"Lujan","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-020-2649-2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3575742"},{"article-title":"CoLA: Exploiting Compositional Structure for Automatic and Efficient Numerical Linear Algebra","year":"2023","author":"Potapczynski","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW59300.2023.00125"},{"article-title":"How we made a better backslash in matlab r2024a","year":"2024","author":"Croucher","key":"ref17"},{"volume-title":"LinearSolve.jl: High-Performance Unified Interface for Linear Solvers in Julia","year":"2024","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2019.03.009"},{"issue":"1","key":"ref20","article-title":"Differentialequations.jl \u2013 a performant and feature-rich ecosystem for solving differential equations in julia","volume-title":"The Journal of Open Research Software","volume":"5","author":"Rackauckas","year":"2017"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/141000671"},{"year":"2024","key":"ref22","article-title":"Matlab revision r2024a"},{"article-title":"Robust benchmarking in noisy environments","year":"2016","author":"Chen","key":"ref23"}],"event":{"name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","start":{"date-parts":[[2025,9,15]]},"location":"Wakefield, MA, USA","end":{"date-parts":[[2025,9,19]]}},"container-title":["2025 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11196085\/11196088\/11196484.pdf?arnumber=11196484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T04:47:20Z","timestamp":1760676440000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11196484\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,15]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/hpec67600.2025.11196484","relation":{},"subject":[],"published":{"date-parts":[[2025,9,15]]}}}