{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T11:46:10Z","timestamp":1753875970127,"version":"3.41.2"},"reference-count":15,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Many signed, directed social networks can be viewed as being composed of positive (endorsements) and negative (accusations) directed edges, and these networks can in turn be created through a variety of different processes. The recently proposed consistency dynamics supposes that when nodes expect to be judged based on their associations in the network, they may create edges out of a desire to appear as having consistent judgements. We develop a quantifiable score that can rate the level of consistency in a node\u2019s judgement. We demonstrate that this consistency score can be efficiently estimated using a modification of the popular personalized PageRank algorithm and evaluate the score\u2019s properties. In order to validate this score\u2019s relevance to empirical networks, we use consistency scores to perform an edge prediction task, and demonstrate that it performs competitively with, and adds complementary information to, more complicated measures designed specifically for that task. We also demonstrate that the nodes in these networks exhibit specific behaviours that consistency can identify across a range of parameterization values and which are not recoverable by other measures in isolation.<\/jats:p>","DOI":"10.1093\/comnet\/cnac011","type":"journal-article","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T11:12:11Z","timestamp":1649934731000},"source":"Crossref","is-referenced-by-count":0,"title":["Gauging node consistency in accusation\u2013endorsement networks"],"prefix":"10.1093","volume":"10","author":[{"given":"Oscar","family":"Goodloe","sequence":"first","affiliation":[{"name":"School of Computer Science, Georgia Institute of Technology , 266 Ferst Drive, Atlanta, GA 30332, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihan","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of British Columbia , Vancouver, BC 2178-2207, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1910-5131","authenticated-orcid":false,"given":"Joel","family":"Nishimura","sequence":"additional","affiliation":[{"name":"School of Mathematical and Natural Sciences, Arizona State University , 4701 W. Thunderbird Rd, Glendale, AZ 85306, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"2022061010101207500_B1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1037\/h0046049","article-title":"Structural balance: a generalization of Heider\u2019s theory","volume":"63","author":"Cartwright,","year":"1956","journal-title":"Psychol. Rev."},{"key":"2022061010101207500_B2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/00223980.1946.9917275","article-title":"Attitudes and cognitive organization","volume":"21","author":"Heider,","year":"1946","journal-title":"J. Psychol."},{"key":"2022061010101207500_B3","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1145\/1772690.1772756","article-title":"Predicting positive and negative links in online social networks","volume-title":"Proceedings of the 19th International Conference on World Wide Web","author":"Leskovec,","year":"2010"},{"key":"2022061010101207500_B4","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1145\/1753326.1753532","article-title":"Signed networks in social media","volume-title":"Proceedings of the SIGCHI Conference on Human Factors in Computing Systems","author":"Leskovec,","year":"2010"},{"key":"2022061010101207500_B5","doi-asserted-by":"crossref","DOI":"10.1109\/ICDM.2016.0033","article-title":"Edge weight prediction in weighted signed networks","author":"Kumar,","year":"2016","journal-title":"2016 IEEE 16th International Conference on Data Mining (ICDM)"},{"key":"2022061010101207500_B6","doi-asserted-by":"crossref","first-page":"cnz047","DOI":"10.1093\/comnet\/cnz047","article-title":"Consistency dynamics in accusation-endorsement networks with an external judge","volume":"8","author":"Nishimura,","year":"2020","journal-title":"J. Complex Netw."},{"key":"2022061010101207500_B7","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1109\/ICDM.2016.0122","article-title":"Personalized ranking in signed networks using signed random walk with restart","volume-title":"2016 IEEE 16th International Conference on Data Mining (ICDM)","author":"Jung,","year":"2016"},{"key":"2022061010101207500_B8","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1145\/2835776.2835816","article-title":"The troll-trust model for ranking in signed networks","author":"Wu,","year":"2016","journal-title":"Proceedings of the Ninth ACM international conference on Web Search and Data Mining"},{"key":"2022061010101207500_B9","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/s13278-014-0172-x","article-title":"Ranking nodes in signed social networks","volume":"4","author":"Shahriari,","year":"2014","journal-title":"Soc. Netw. Anal. Mining"},{"key":"2022061010101207500_B10","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/978-3-642-16567-2_14","article-title":"Exponential ranking: taking into account negative links","volume-title":"International Conference on Social Informatics","author":"Traag,","year":"2010"},{"key":"2022061010101207500_B11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/1367497.1367525","article-title":"Trust-based recommendation systems: an axiomatic approach","author":"Andersen,","year":"2008","journal-title":"Proceedings of the 17th International Conference on World Wide Web"},{"key":"2022061010101207500_B12","article-title":"Combating web spam with trustrank","author":"Gyongyi,","year":"2004","journal-title":"Proceedings of the 30th International Conference on Very Large Data Bases (VLDB)"},{"key":"2022061010101207500_B13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/3159652.3159729","article-title":"Rev2: fraudulent user prediction in rating platforms","volume-title":"Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining","author":"Kumar,","year":"2018"},{"key":"2022061010101207500_B14","article-title":"The pagerank citation ranking: bringing order to the web","volume-title":"Technical Report","author":"Page,","year":"1999"},{"article-title":"SNAP datasets: Stanford large network dataset collection","year":"2014","author":"Leskovec,","key":"2022061010101207500_B15"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/10\/3\/cnac011\/44003030\/cnac011.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/10\/3\/cnac011\/44003030\/cnac011.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T10:10:29Z","timestamp":1654855829000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnac011\/6573836"}},"subtitle":[],"editor":[{"given":"Ernesto","family":"Estrada","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,4,25]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnac011","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"type":"print","value":"2051-1310"},{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2022,6,1]]},"published":{"date-parts":[[2022,4,25]]},"article-number":"cnac011"}}