{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:53:43Z","timestamp":1782924823140,"version":"3.54.5"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,25]]},"DOI":"10.1109\/ipdps65963.2026.00041","type":"proceedings-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T20:55:16Z","timestamp":1782852916000},"page":"377-389","source":"Crossref","is-referenced-by-count":0,"title":["ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting"],"prefix":"10.1109","author":[{"given":"S. M.","family":"Shovan","sequence":"first","affiliation":[{"name":"Missouri University of Science and Technology,Rolla,MO,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arindam","family":"Khanda","sequence":"additional","affiliation":[{"name":"Missouri University of Science and Technology,Rolla,MO,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjukta","family":"Bhowmick","sequence":"additional","affiliation":[{"name":"University of North Texas,Denton,TX,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sajal K.","family":"Das","sequence":"additional","affiliation":[{"name":"Missouri University of Science and Technology,Rolla,MO,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Community detection for hypergraph networks via regularized tensor power iteration","author":"Ke","year":"2019"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1186\/s12864-019-5787-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557301"},{"key":"ref4","first-page":"118","article-title":"A fine-grain hypergraph model for 2d decomposition of sparse matrices","volume-title":"IPDPS","volume":"1","author":"\u00c7ataly\u00fcrek"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407823"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00081"},{"key":"ref7","article-title":"Statistical inference for subgraph frequencies of exchangeable hyperedge models","author":"Bhattacharya","year":"2025"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW63119.2024.00063"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3624062.3625134"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00119"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3084096"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SBAC-PAD59825.2023.00020"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC56025.2022.00027"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2025.3536357"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547541"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761622"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00042"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00287-5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-385963-1.00026-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IA335182.2014.10612668"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547759"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"ref24","article-title":"Size-aware hypergraph motifs","author":"Niu","year":"2023"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2204967119"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3236335"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290988"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnad019"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374527"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547520"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2933196"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/9781118640708.ch25"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3171588"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3235941"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER59578.2024.00011"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3715332"}],"event":{"name":"2026 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","location":"New Orleans, LA, USA","start":{"date-parts":[[2026,5,25]]},"end":{"date-parts":[[2026,5,29]]}},"container-title":["2026 IEEE International Parallel and Distributed Processing Symposium (IPDPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11575315\/11575316\/11575370.pdf?arnumber=11575370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:13:59Z","timestamp":1782922439000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11575370\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,25]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/ipdps65963.2026.00041","relation":{},"subject":[],"published":{"date-parts":[[2026,5,25]]}}}