{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T21:10:21Z","timestamp":1780434621339,"version":"3.54.1"},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001409","name":"Department of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001409","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006757","name":"Centre for Quantum Technologies","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006757","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.tcs.2026.116050","type":"journal-article","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T15:49:37Z","timestamp":1779292177000},"page":"116050","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Near uniform triangle sampling over adjacency list graph streams"],"prefix":"10.1016","volume":"1081","author":[{"given":"Arijit","family":"Bishnu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arijit","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gopinath","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5875-5252","authenticated-orcid":false,"given":"Sayantan","family":"Sen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.tcs.2026.116050_bib0001","doi-asserted-by":"crossref","DOI":"10.1561\/0400000002","article-title":"Data streams: algorithms and applications","volume":"1","author":"Muthukrishnan","year":"2005","journal-title":"Found. Trend. Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.116050_bib0002","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/2627692.2627694","article-title":"Graph stream algorithms: a survey","volume":"43","author":"McGregor","year":"2014","journal-title":"SIGMOD Rec."},{"issue":"2","key":"10.1016\/j.tcs.2026.116050_bib0003","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1089\/cmb.2006.13.133","article-title":"Efficient algorithms for detecting signaling pathways in protein interaction networks","volume":"13","author":"Scott","year":"2006","journal-title":"J. Comput. Biol."},{"key":"10.1016\/j.tcs.2026.116050_bib0004","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1186\/1471-2105-7-199","article-title":"QPath: a method for querying pathways in a protein-protein interaction network","volume":"7","author":"Shlomi","year":"2006","journal-title":"BMC Bioinform."},{"issue":"4","key":"10.1016\/j.tcs.2026.116050_bib0005","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1007\/s00224-014-9543-y","article-title":"Structural tractability of counting of solutions to conjunctive queries","volume":"57","author":"Durand","year":"2015","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.116050_bib0006","series-title":"LICS","first-page":"1","article-title":"The logic of counting query answers","author":"Chen","year":"2017"},{"key":"10.1016\/j.tcs.2026.116050_bib0007","series-title":"STOC","first-page":"1015","article-title":"When is approximate counting for conjunctive queries tractable?","author":"Arenas","year":"2021"},{"key":"10.1016\/j.tcs.2026.116050_bib0008","series-title":"WWW","first-page":"1307","article-title":"Subgraph frequencies: mapping the empirical and extremal geography of large graph collections","author":"Ugander","year":"2013"},{"key":"10.1016\/j.tcs.2026.116050_bib0009","series-title":"ICDT","first-page":"7:1","article-title":"Random sampling and size estimation over cyclic joins","author":"Chen","year":"2020"},{"key":"10.1016\/j.tcs.2026.116050_bib0010","series-title":"SIGMOD Conference","first-page":"1525","article-title":"Random sampling over joins revisited","author":"Zhao","year":"2018"},{"key":"10.1016\/j.tcs.2026.116050_bib0011","unstructured":"E. Bloedorn, N.J. Rothleder, D. DeBarr, L. Rosen, Relational graph analysis with real-world constraints: an application in irs tax fraud detection, Grobelnik et al.[63] (2005)."},{"issue":"5594","key":"10.1016\/j.tcs.2026.116050_bib0012","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","article-title":"Network motifs: simple building blocks of complex networks","volume":"298","author":"Milo","year":"2002","journal-title":"Science"},{"key":"10.1016\/j.tcs.2026.116050_bib0013","series-title":"STACS","first-page":"11:1","article-title":"Towards tighter space bounds for counting triangles and other substructures in graph streams","author":"Bera","year":"2017"},{"key":"10.1016\/j.tcs.2026.116050_bib0014","series-title":"PODS","first-page":"119","article-title":"The complexity of counting cycles in the adjacency list streaming model","author":"Kallaugher","year":"2019"},{"key":"10.1016\/j.tcs.2026.116050_bib0015","series-title":"ICALP (1)","first-page":"244","article-title":"How hard is counting triangles in the streaming model?","author":"Braverman","year":"2013"},{"key":"10.1016\/j.tcs.2026.116050_bib0016","series-title":"PODS","first-page":"253","article-title":"Counting triangles in data streams","author":"Buriol","year":"2006"},{"key":"10.1016\/j.tcs.2026.116050_bib0017","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.tcs.2014.07.025","article-title":"A second look at counting triangles in graph streams","volume":"552","author":"Cormode","year":"2014","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.116050_bib0018","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s00453-015-0036-4","article-title":"Triangle counting in dynamic graph streams","volume":"76","author":"Bulteau","year":"2016","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116050_bib0019","series-title":"COCOON","first-page":"710","article-title":"New streaming algorithms for counting triangles in graphs","author":"Jowhari","year":"2005"},{"key":"10.1016\/j.tcs.2026.116050_bib0020","series-title":"SODA","first-page":"1778","article-title":"A hybrid sampling scheme for triangle counting","author":"Kallaugher","year":"2017"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.116050_bib0021","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1080\/15427951.2012.625260","article-title":"Efficient triangle counting in large graphs via degree-based vertex partitioning","volume":"8","author":"Kolountzakis","year":"2012","journal-title":"Internet Math."},{"key":"10.1016\/j.tcs.2026.116050_bib0022","series-title":"PODS","first-page":"401","article-title":"Better algorithms for counting triangles in data streams","author":"McGregor","year":"2016"},{"issue":"7","key":"10.1016\/j.tcs.2026.116050_bib0023","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.ipl.2011.12.007","article-title":"Colorful triangle counting and a MapReduce implementation","volume":"112","author":"Pagh","year":"2012","journal-title":"Inf. Process. Lett."},{"issue":"14","key":"10.1016\/j.tcs.2026.116050_bib0024","doi-asserted-by":"crossref","first-page":"1870","DOI":"10.14778\/2556549.2556569","article-title":"Counting and sampling triangles from a graph stream","volume":"6","author":"Pavan","year":"2013","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.tcs.2026.116050_bib0025","series-title":"ICALP","first-page":"56:1","article-title":"Almost optimal bounds for sublinear-time sampling of k-cliques in bounded arboricity graphs","author":"Eden","year":"2022"},{"key":"10.1016\/j.tcs.2026.116050_bib0026","series-title":"ICALP","first-page":"45:1","article-title":"Sampling arbitrary subgraphs exactly uniformly in sublinear time","author":"Fichtenberger","year":"2020"},{"key":"10.1016\/j.tcs.2026.116050_bib0027","series-title":"FOCS","first-page":"556","article-title":"The sketching complexity of graph and hypergraph counting","author":"Kallaugher","year":"2018"},{"key":"10.1016\/j.tcs.2026.116050_bib0028","series-title":"ICALP (2)","first-page":"598","article-title":"Counting arbitrary subgraphs in data streams","author":"Kane","year":"2012"},{"key":"10.1016\/j.tcs.2026.116050_bib0029","series-title":"ITCS","first-page":"6:1","article-title":"A simple sublinear-time algorithm for counting arbitrary subgraphs via edge sampling","author":"Assadi","year":"2019"},{"issue":"1","key":"10.1016\/j.tcs.2026.116050_bib0030","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/3147.3165","article-title":"Random sampling with a reservoir","volume":"11","author":"Vitter","year":"1985","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"10.1016\/j.tcs.2026.116050_bib0031","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02523189","article-title":"Finding and counting given length cycles","volume":"17","author":"Alon","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116050_bib0032","series-title":"SODA","first-page":"623","article-title":"Reductions in streaming algorithms, with an application to counting triangles in graphs","author":"Bar-Yossef","year":"2002"},{"key":"10.1016\/j.tcs.2026.116050_bib0033","series-title":"APPROX-RANDOM","first-page":"11:1","article-title":"An optimal algorithm for triangle counting in the stream","author":"Jayaram","year":"2021"},{"key":"10.1016\/j.tcs.2026.116050_bib0034","series-title":"SOSA","first-page":"7:1","article-title":"On sampling edges almost uniformly","author":"Eden","year":"2018"},{"key":"10.1016\/j.tcs.2026.116050_bib0035","series-title":"STOC","first-page":"1116","article-title":"Edge sampling and graph parameter estimation via vertex neighborhood accesses","author":"Tetek","year":"2022"},{"key":"10.1016\/j.tcs.2026.116050_bib0036","series-title":"SOSA","first-page":"253","article-title":"Sampling an edge in sublinear time exactly and optimally","author":"Eden","year":"2023"},{"key":"10.1016\/j.tcs.2026.116050_bib0037","series-title":"APPROX-RANDOM","first-page":"55:1","article-title":"Towards a decomposition-optimal algorithm for counting and sampling arbitrary motifs in sublinear time","author":"Biswas","year":"2021"},{"issue":"4","key":"10.1016\/j.tcs.2026.116050_bib0038","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/S0196-8858(02)00037-4","article-title":"Counting cycles and finite dimensional Lp norms","volume":"29","author":"Rivin","year":"2002","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/j.tcs.2026.116050_bib0039","series-title":"PODS","first-page":"445","article-title":"Triangle and four cycle counting in the data stream model","author":"McGregor","year":"2020"},{"key":"10.1016\/j.tcs.2026.116050_bib0040","series-title":"Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, the Netherlands, June 30 - July 5, 2019","first-page":"119","article-title":"The complexity of counting cycles in the adjacency list streaming model","author":"Kallaugher","year":"2019"},{"issue":"6","key":"10.1016\/j.tcs.2026.116050_bib0041","doi-asserted-by":"crossref","first-page":"34:1","DOI":"10.1145\/2629334","article-title":"Communication lower bounds using directional derivatives","volume":"61","author":"Sherstov","year":"2014","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.116050_bib0042","series-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"Dubhashi","year":"2009"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003002?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003002?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T20:59:09Z","timestamp":1780433949000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":42,"alternative-id":["S0304397526003002"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116050","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Near uniform triangle sampling over adjacency list graph streams","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116050","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116050"}}