{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,2]],"date-time":"2026-09-02T15:02:04Z","timestamp":1788361324520,"version":"build-2803163510"},"reference-count":35,"publisher":"Oxford University Press (OUP)","funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006132","name":"Office of Science","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100006132","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100006234","name":"Sandia National Laboratories","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006234","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcomplexnetw"],"DOI":"10.1093\/comnet\/cnv032","type":"journal-article","created":{"date-parts":[[2016,4,11]],"date-time":"2016-04-11T22:23:15Z","timestamp":1460413395000},"page":"cnv032","source":"Crossref","is-referenced-by-count":6,"title":["Directed closure measures for networks with reciprocity"],"prefix":"10.1093","author":[{"given":"C.","family":"Seshadhri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali","family":"Pinar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nurcan","family":"Durak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tamara G.","family":"Kolda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2016,4,11]]},"reference":[{"key":"2016041119230259000_cnv032v1.1","doi-asserted-by":"publisher","DOI":"10.1086\/224954"},{"key":"2016041119230259000_cnv032v1.2","doi-asserted-by":"publisher","DOI":"10.1086\/421787"},{"key":"2016041119230259000_cnv032v1.3","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"2016041119230259000_cnv032v1.4","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"2016041119230259000_cnv032v1.5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.056109"},{"key":"2016041119230259000_cnv032v1.6","doi-asserted-by":"crossref","unstructured":"Durak N. , Pinar A. , Kolda T. G. & Seshadhri C. (2012) Degree relations of triangles in real-world networks and graph models. ACM International Conference on Information and Knowledge Management.","DOI":"10.1145\/2396761.2398503"},{"key":"2016041119230259000_cnv032v1.7","doi-asserted-by":"crossref","first-page":"035101","DOI":"10.1103\/PhysRevE.66.035101","article-title":"Email networks and the spread of computer viruses","volume":"66","author":"Newman","year":"2002","journal-title":"Phys. Rev. E"},{"key":"2016041119230259000_cnv032v1.8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.268701"},{"key":"2016041119230259000_cnv032v1.9","first-page":"015101","article-title":"Multispecies grand-canonical models for networks with reciprocity","volume":"73","author":"Garlaschelli","year":"2006","journal-title":"Phys. Rev. Lett."},{"key":"2016041119230259000_cnv032v1.10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.77.016106"},{"key":"2016041119230259000_cnv032v1.11","doi-asserted-by":"crossref","unstructured":"Mislove A. , Koppula H. S. , Gummadi K. P. , Druschel P. & Bhattacharjee B. (2008) Growth of the flickr social network. WOSN'08. Seattle, WA: ACM, pp. 25\u201330.","DOI":"10.1145\/1397735.1397742"},{"key":"2016041119230259000_cnv032v1.12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.016117"},{"key":"2016041119230259000_cnv032v1.13","doi-asserted-by":"crossref","unstructured":"Kwak H. , Lee C. , Park H. & Moon S. (2010) WWW '10. Rayleigh, NC: ACM, pp. 591\u2013600.","DOI":"10.1145\/1772690.1772751"},{"key":"2016041119230259000_cnv032v1.14","doi-asserted-by":"crossref","unstructured":"Squartini T. , Picciolo F. , Ruzzenenti F. & Garlaschelli D. (2013) Reciprocity of weighted networks. Sci. Rep., 3.","DOI":"10.1038\/srep02729"},{"key":"2016041119230259000_cnv032v1.15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.026107"},{"key":"2016041119230259000_cnv032v1.16","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.03.004"},{"key":"2016041119230259000_cnv032v1.17","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0033918"},{"key":"2016041119230259000_cnv032v1.18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28583-7_3"},{"key":"2016041119230259000_cnv032v1.19","doi-asserted-by":"crossref","unstructured":"Wasserman S. & Faust K. (1994) Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.","DOI":"10.1017\/CBO9780511815478"},{"key":"2016041119230259000_cnv032v1.20","unstructured":"Durak N. , Kolda T. G. , Pinar A. & Seshadhri C. (2013) A scalable directed graph model with reciprocal edges. Proceedings of IEEE 2nd International Workshop on Network Science. arXiv:1210.5288."},{"key":"2016041119230259000_cnv032v1.21","doi-asserted-by":"publisher","DOI":"10.1007\/s11403-012-0104-7"},{"key":"2016041119230259000_cnv032v1.22","unstructured":"Davis J. & Leinhardt S. (1967) The Structure of Positive Interpersonal Relations in Small Groups. Dartmouth College."},{"key":"2016041119230259000_cnv032v1.23","unstructured":"Homans G. (1950) The Human Group. New York: Harcourt, Brace and Company."},{"key":"2016041119230259000_cnv032v1.24","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(90)90006-U"},{"key":"2016041119230259000_cnv032v1.25","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.01.005"},{"key":"2016041119230259000_cnv032v1.26","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2010.05.006"},{"key":"2016041119230259000_cnv032v1.27","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.06.001"},{"key":"2016041119230259000_cnv032v1.28","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1004008107"},{"key":"2016041119230259000_cnv032v1.29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.036112"},{"key":"2016041119230259000_cnv032v1.30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.022805"},{"key":"2016041119230259000_cnv032v1.31","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2012.4"},{"key":"2016041119230259000_cnv032v1.32","unstructured":"SNAP. Stanford Network Analysis Project. Available at http:\/\/snap.stanford.edu\/ ."},{"key":"2016041119230259000_cnv032v1.33","doi-asserted-by":"crossref","unstructured":"Chierichetti F. , Kumar R. , Lattanzi S. , Mitzenmacher M. , Panconesi A. & Raghavan P. (2009) On compressing social networks. KDD, pp. 219\u2013288.","DOI":"10.1145\/1557019.1557049"},{"key":"2016041119230259000_cnv032v1.34","unstructured":"Laboratory for Web Algorithmics. Available at http:\/\/law.di.unimi.it\/webdata\/ljournal-2008\/ ."},{"key":"2016041119230259000_cnv032v1.35","doi-asserted-by":"crossref","unstructured":"Britton T. , Deijfen M. & Martin-L\u00f6f A. (2006) Generating simple random graphs with prescribed degree distribution. J. Stat. Phys., 124.","DOI":"10.1007\/s10955-006-9168-x"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T10:06:00Z","timestamp":1567764360000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article-lookup\/doi\/10.1093\/comnet\/cnv032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,11]]},"references-count":35,"alternative-id":["10.1093\/comnet\/cnv032"],"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnv032","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,11]]}}}