{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T08:32:49Z","timestamp":1770193969331,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,10,6]]},"DOI":"10.1145\/3767110.3767137","type":"proceedings-article","created":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T04:36:01Z","timestamp":1769747761000},"page":"190-196","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["TriPIM \u2014 Exact Triangle Counting on UPMEM Processing-in-Memory for Graph Analytics"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0705-2820","authenticated-orcid":false,"given":"Morteza","family":"Baradaran","sequence":"first","affiliation":[{"name":"University fo Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6535-8220","authenticated-orcid":false,"given":"Khyati","family":"Kiyawat","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0432-9414","authenticated-orcid":false,"given":"Akhil","family":"Shekar","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6975-632X","authenticated-orcid":false,"given":"Abdullah T.","family":"Mughrabi","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8091-9302","authenticated-orcid":false,"given":"Kevin","family":"Skadron","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,1,29]]},"reference":[{"key":"e_1_3_3_1_2_2","volume-title":"Introduction to UPMEM PIM. Processing-in-memory (PIM) on DRAM Accelerator (White Paper)","year":"2018","unstructured":"2018. Introduction to UPMEM PIM. Processing-in-memory (PIM) on DRAM Accelerator (White Paper). Technical Report. UPMEM, Grenoble, France."},{"key":"e_1_3_3_1_3_2","volume-title":"GAP benchmark suite reference code v0.6","author":"Beamer S.","year":"2015","unstructured":"S. Beamer. 2015. GAP benchmark suite reference code v0.6. https:\/\/github.com\/sbeamer\/gapbs"},{"key":"e_1_3_3_1_4_2","unstructured":"S. Beamer K. Asanovic and D.\u00a0A. Patterson. 2015. The GAP benchmark suite. arXiv:https:\/\/arXiv.org\/abs\/1508.03619 (Aug. 2015)."},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"R. Burt. 2004. Structural holes and good ideas. Amer. J. Sociology (2004).","DOI":"10.1086\/421787"},{"key":"e_1_3_3_1_8_2","series-title":"(NIPS \u201920)","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems","author":"Chen Z.","year":"2020","unstructured":"Z. Chen, L. Chen, S. Villar, and J. Bruna. 2020. Can graph neural networks count substructures?. In Proceedings of the 34th International Conference on Neural Information Processing Systems (Vancouver, BC, Canada) (NIPS \u201920). Curran Associates Inc., Red Hook, NY, USA, Article 871, 13\u00a0pages."},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"crossref","unstructured":"J. Coleman. 1988. Social capital in the creation of human capital. Amer. J. Sociology (1988).","DOI":"10.1086\/228943"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2019.8875680"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s and A. R\u00e9nyi. 1959. On Random Graphs I. Publicationes Mathematicae 6 (1959) 290\u2013297.","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452815"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00017"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547536"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"A. Itai and M. Rodeh. 1977. Finding a minimum circuit in a graph(STOC \u201977). Association for Computing Machinery New York NY USA 1\u201310.","DOI":"10.1145\/800105.803390"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICFPT64416.2024.11113456"},{"key":"e_1_3_3_1_17_2","volume-title":"International Conference on Learning Representations","author":"Kanatsoulis C.","year":"2024","unstructured":"C. Kanatsoulis and A. Ribeiro. 2024. Counting graph substructures with graph neural networks. In International Conference on Learning Representations."},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/HCS52781.2021.9567191"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/HCS55958.2022.9895629"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"crossref","unstructured":"M. Latapy. 2008. Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoretical Computer Science 407 (2008) 458\u2013473.","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"e_1_3_3_1_21_2","unstructured":"J. Leskovec D. Chakrabarti J. Kleinberg C. Faloutsos and Z. Ghahramani. 2010. Kronecker Graphs: An Approach to Modeling Networks. J. Mach. Learn. Res. 11 (March 2010) 985\u20131042."},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACRIM61180.2024.10690214"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW63119.2024.00105"},{"key":"e_1_3_3_1_24_2","volume-title":"ACM SIGKDD Conference on Knowledge Discovery and Data Mining","author":"Nguyen L.\u00a0H.","year":"2024","unstructured":"L.\u00a0H. Nguyen and Y. Yan. 2024. Evaluating the structural awareness of large language models on graphs: Can they count substructures?. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining."},{"key":"e_1_3_3_1_25_2","unstructured":"S. Pandey Z. Wang S. Zhong C. Tian B. Zheng X. Li L. Li A. Hoisie C. Ding D. Li and H. Liu. 2021. TRUST: Triangle Counting Reloaded on GPUs. arXiv:https:\/\/arXiv.org\/abs\/2103.08053 (2021)."},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"crossref","unstructured":"H. Park F. Silvestri R. Pagh C. Chung S. Myaeng and U. Kang. 2018. Enumerating Trillion Subgraphs On Distributed Systems. ACM Trans. Knowl. Discov. Data 12 6 Article 71 (Oct. 2018) 30\u00a0pages. doi:10.1145\/3237191","DOI":"10.1145\/3237191"},{"key":"e_1_3_3_1_27_2","series-title":"Advances in Computers","first-page":"233","volume-title":"Principles of Big Graph: In-depth Insight","author":"Ravichandran K.","year":"2023","unstructured":"K. Ravichandran, A. Subramaniasivam, P.S. Aishwarya, and N.S. Kumar. 2023. Chapter Eight - Fast exact triangle counting in large graphs using SIMD acceleration. In Principles of Big Graph: In-depth Insight , Ripon Patgiri, Ganesh\u00a0Chandra Deka, and Anupam Biswas (Eds.). Advances in Computers, Vol.\u00a0128. Elsevier, 233\u2013250. doi:10.1016\/bs.adcom.2021.10.003"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_54"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3123939.3124544"},{"key":"e_1_3_3_1_30_2","unstructured":"A. Shekar M. Baradaran S. Tajdari and K. Skadron. 2023. HashMem: PIM-based Hashmap Accelerator. doi:arXiv:2306.17721 [cs.AR]"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC63097.2024.00030"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"crossref","unstructured":"G. Singh M. Alser D. Senol\u00a0Cali D. Diamantopoulos J. G\u00f3mez-Luna H. Corporaal and O. Mutlu. 2021. FPGA-Based Near-Memory Acceleration of Modern Data-Intensive Applications. IEEE Micro PP (06 2021) 1\u20131. doi:10.1109\/MM.2021.3088396","DOI":"10.1109\/MM.2021.3088396"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"crossref","unstructured":"L.\u00a0De Stefani A. Epasto M. Riondato and E. Upfal. 2017. TRI\u00c8ST: Counting Local and Global Triangles in Fully Dynamic Streams with Fixed Memory Size. ACM Trans. Knowl. Discov. Data 11 4 Article 43 (June 2017) 50\u00a0pages. doi:10.1145\/3059194","DOI":"10.1145\/3059194"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091054"},{"key":"e_1_3_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.72"},{"key":"e_1_3_3_1_38_2","doi-asserted-by":"crossref","unstructured":"C.\u00a0E. Tsourakakis P. Drineas E. Michelakis I. Koutis and C. Faloutsos. 2011. Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation. Social Network Analysis and Mining 1 (2011) 75\u201381. doi:10.1007\/s13278-010-0001-9","DOI":"10.1007\/s13278-010-0001-9"},{"key":"e_1_3_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_3_1_40_2","volume-title":"UPMEM Website","year":"2020","unstructured":"UPMEM. 2020. UPMEM Website. https:\/\/www.upmem.com"},{"key":"e_1_3_3_1_41_2","doi-asserted-by":"crossref","unstructured":"J. Wang and J. Cheng. 2012. Truss decomposition in massive networks. Proc. VLDB Endow. 5 9 (May 2012) 812\u2013823. doi:10.14778\/2311906.2311909","DOI":"10.14778\/2311906.2311909"},{"key":"e_1_3_3_1_42_2","doi-asserted-by":"crossref","unstructured":"D.\u00a0J. Watts and S.\u00a0H. Strogatz. 1998. Collective dynamics of \u2019small-world\u2019 networks. Nature 393 (1998) 440\u2013442. doi:10.1038\/30918","DOI":"10.1038\/30918"}],"event":{"name":"MemSys '25: International Symposium on Memory Systems","location":"Washington USA","acronym":"MemSys '25"},"container-title":["Proceedings of the International Symposium on Memory Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3767110.3767137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T04:36:45Z","timestamp":1769747805000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3767110.3767137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,6]]},"references-count":41,"alternative-id":["10.1145\/3767110.3767137","10.1145\/3767110"],"URL":"https:\/\/doi.org\/10.1145\/3767110.3767137","relation":{},"subject":[],"published":{"date-parts":[[2025,10,6]]},"assertion":[{"value":"2026-01-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}