{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1618,"total_is_capped":false,"direct_labels_cover":3,"predictions_cover":1618,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"c3cff002f5b3","filters":{"topic":"Complex Network Analysis Techniques"}},"results":[{"id":"W1554338108","doi":"10.1017/cbo9780511811395","title":"Models and Methods in Social Network Analysis","year":2005,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2444,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Social network analysis; Centrality; Network analysis; Organizational network analysis; Computer science; Data science; Social network (sociolinguistics); Network science; Dynamic network analysis; Complement (music); Network theory; Exponential random graph models; Data mining; Random graph; Theoretical computer science; Complex network; World Wide Web; Statistics; Social media; Knowledge management; Mathematics; Computer network; Graph","authors":[{"name":"Peter J. Carrington","is_ca":true},{"name":"Stanley Wasserman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02429333108308914,"gpt":0.2797863220507283,"spread":0.2554929909676392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005225544,0.002336579,0.002049881,0.004395989,0.00123507,0.004034422,0.002422733,0.003110673,0.01123405],"category_scores_gemma":[0.01337855,0.0008795979,0.001858641,0.005473675,0.003463813,0.005319805,0.002545411,0.005276299,0.006941067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002673527,"about_ca_system_score_gemma":0.002959979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003783202,"about_ca_topic_score_gemma":0.002657776,"domain_scores_codex":[0.9939516,0.002967453,0.0003579195,0.0006812094,0.001853947,0.000187896],"domain_scores_gemma":[0.9920968,0.005979363,0.0003254076,0.0007972556,0.0006576148,0.0001437187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000005760996,0.00002928238,0.0002051416,0.0004159145,0.00007330204,0.00008712464,0.0002394926,0.009720111,0.0001180717,0.8910804,0.04422392,0.05380151],"study_design_scores_gemma":[0.000006026486,0.000007786984,0.00008911451,0.0001533421,0.00001224153,0.00006734753,0.00005049636,0.01145583,0.00005450131,0.8927351,0.09535178,0.0000165162],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008706421,0.0411014,0.8874607,0.008057689,0.002281186,0.0002671878,0.001091704,0.000714063,0.05815545],"genre_scores_gemma":[0.07952081,0.1112335,0.7267684,0.006184073,0.007591281,0.003628574,0.003153211,0.0009940244,0.06092612],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01123405,"threshold_uncertainty_score":0.03758162,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149910108","doi":"10.1073/pnas.0908800106","title":"Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks","year":2009,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1235,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Homophily; Emotional contagion; Social network (sociolinguistics); Social influence; Cluster analysis; Computer science; Node (physics); Econometrics; Data science; Social media; Psychology; Social psychology; Economics; World Wide Web; Machine learning","authors":[{"name":"Sinan Aral","is_ca":false},{"name":"Lev Muchnik","is_ca":false},{"name":"Arun Sundararajan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0156305687378438,"gpt":0.2893821742104498,"spread":0.273751605472606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005117051,0.0002844602,0.0005144694,0.002636838,0.0006168443,0.001447944,0.0006176446,0.0009047286,0.001054344],"category_scores_gemma":[0.04303882,0.000353225,0.0006517504,0.00134522,0.001587291,0.003102076,0.00134648,0.0006931023,0.0001184327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006778599,"about_ca_system_score_gemma":0.0003821786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003312269,"about_ca_topic_score_gemma":0.003478966,"domain_scores_codex":[0.9976627,0.00136296,0.0001249194,0.0004337996,0.0002709614,0.0001447573],"domain_scores_gemma":[0.9725087,0.0217584,0.002705219,0.002100197,0.000492563,0.000434861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003360019,0.0003395436,0.5747691,0.0003444236,0.000999869,0.0005434105,0.004598268,0.1238432,0.005186888,0.1705317,0.0007519783,0.1177556],"study_design_scores_gemma":[0.00003709605,0.0001779312,0.1973706,0.00006344597,0.0002204572,0.000445992,0.001012957,0.6629631,0.001921164,0.1340456,0.00167116,0.00007049764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8594207,0.0002864574,0.1367279,0.0002786047,0.00001297524,0.00008890538,0.0001048741,0.00008313489,0.002996357],"genre_scores_gemma":[0.9959131,0.00006658721,0.003818533,0.00001529382,0.000009681959,0.0000224185,0.00004552635,0.000003144501,0.0001056821],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005117051,"threshold_uncertainty_score":0.02706182,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150443611","doi":"10.1126/science.1106340","title":"Team Assembly Mechanisms Determine Collaboration Network Structure and Team Performance","year":2005,"lang":"en","type":"article","venue":"Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1148,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"National Institute of General Medical Sciences","keywords":"Network structure; Work (physics); Knowledge management; Team composition; Computer science; Phase (matter); Engineering; Distributed computing","authors":[{"name":"Roger Guimerà","is_ca":true},{"name":"Brian Uzzi","is_ca":true},{"name":"Jarrett Spiro","is_ca":true},{"name":"Luı́s A. Nunes Amaral","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005424297446348432,"gpt":0.2468048287048288,"spread":0.2413805312584803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003627582,0.0004040645,0.0003924881,0.002565088,0.000951207,0.002571256,0.0006556545,0.001144355,0.001776679],"category_scores_gemma":[0.03552518,0.0004775654,0.0004370502,0.001159606,0.001743257,0.00500864,0.001500598,0.0005565358,0.0004011872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001124948,"about_ca_system_score_gemma":0.0005822529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001075816,"about_ca_topic_score_gemma":0.0008640828,"domain_scores_codex":[0.9980764,0.0008632676,0.0001127355,0.000371245,0.0003133757,0.0002627951],"domain_scores_gemma":[0.9623914,0.02370036,0.008766008,0.001819885,0.002087294,0.00123499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0006881972,0.0004190013,0.3733058,0.0004938775,0.00065879,0.0004997687,0.00600477,0.3195502,0.03020519,0.1714302,0.002033365,0.09471072],"study_design_scores_gemma":[0.0001228151,0.0002710784,0.2177689,0.000124107,0.000174701,0.0005281626,0.003179296,0.6025072,0.008878048,0.1638901,0.002452576,0.0001029538],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9632337,0.0002473617,0.03278975,0.0002706933,0.000007720811,0.00003416521,0.00006880821,0.00005686,0.003290913],"genre_scores_gemma":[0.99679,0.00005926943,0.002872221,0.000008002723,0.000006029641,0.00002106588,0.00003473825,0.000008085421,0.000200529],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003627582,"threshold_uncertainty_score":0.01918471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135957668","doi":"10.1109/tpami.2007.1115","title":"Weighted Graph Cuts without Eigenvectors A Multilevel Approach","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1038,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"National Science Foundation","keywords":"Cluster analysis; Correlation clustering; Spectral clustering; Rand index; Computer science; Pattern recognition (psychology); Kernel (algebra); Hierarchical clustering; Canopy clustering algorithm; Clustering coefficient; Graph partition; Computation; CURE data clustering algorithm; Graph; Algorithm; Mathematics; Artificial intelligence; Theoretical computer science; Combinatorics","authors":[{"name":"Inderjit S. Dhillon","is_ca":false},{"name":"Yuqiang Guan","is_ca":false},{"name":"Brian Kulis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01933690194146513,"gpt":0.2806329191327215,"spread":0.2612960171912564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001399093,0.0009733629,0.001366768,0.002620845,0.0008793129,0.002153759,0.002391144,0.001866609,0.004093243],"category_scores_gemma":[0.006044087,0.0009262172,0.001455589,0.002984571,0.0009259749,0.002433773,0.002331845,0.002253755,0.001557278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00103297,"about_ca_system_score_gemma":0.001233578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003551642,"about_ca_topic_score_gemma":0.005957366,"domain_scores_codex":[0.9979588,0.0005057623,0.0001025097,0.0004936717,0.0007886507,0.0001505712],"domain_scores_gemma":[0.9978731,0.0007660075,0.0002100492,0.0004625826,0.000594443,0.00009383351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001339509,0.00009699613,0.001057726,0.0003317848,0.0002040432,0.0001489448,0.0002457633,0.4057469,0.01228174,0.1805843,0.01017566,0.3889922],"study_design_scores_gemma":[0.00002253362,0.00003825585,0.0003461943,0.00002531342,0.0000362782,0.00009619355,0.00005091077,0.9068319,0.00282739,0.08259688,0.007104221,0.00002400442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001706839,0.00008825695,0.9969894,0.00007215147,0.00001796225,0.0000241334,0.00005167327,0.000196053,0.0008535358],"genre_scores_gemma":[0.05602477,0.0002482013,0.9400432,0.0001085676,0.00006009703,0.0001686519,0.0003648048,0.0002659188,0.002715849],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004093243,"threshold_uncertainty_score":0.01369321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2558664061","doi":"10.1016/j.tim.2016.11.008","title":"Disentangling Interactions in the Microbiome: A Network Perspective","year":2016,"lang":"en","type":"review","venue":"Trends in Microbiology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":890,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University Health Network; University of Toronto","funders":"Canadian Institutes of Health Research","keywords":"Biology; Microbiome; Perspective (graphical); Computational biology; Evolutionary biology; Ecology; Genetics; Computer science","authors":[{"name":"Mehdi Layeghifard","is_ca":true},{"name":"David Hwang","is_ca":true},{"name":"David S. Guttman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04128318183299028,"gpt":0.3906388598411947,"spread":0.3493556780082044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001464593,0.001363433,0.001790948,0.004183466,0.0002779605,0.002303068,0.001186964,0.001275229,0.001694861],"category_scores_gemma":[0.003107107,0.0003768654,0.0008392712,0.004040927,0.001183695,0.003493858,0.001289411,0.002071671,0.0006628257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007797445,"about_ca_system_score_gemma":0.001684733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001949512,"about_ca_topic_score_gemma":0.003466008,"domain_scores_codex":[0.9995995,0.00009752543,0.00003165704,0.0001137854,0.0001323547,0.00002510256],"domain_scores_gemma":[0.9980918,0.001294968,0.000229441,0.00006993445,0.0002142545,0.00009969594],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000472526,0.00005559139,0.001984118,0.01224223,0.0004567784,0.0001840489,0.0001689019,0.002547303,0.00395846,0.03187402,0.008194329,0.938287],"study_design_scores_gemma":[0.00002223393,0.0001642383,0.009103488,0.01269469,0.0009553825,0.002104352,0.0006142583,0.006375999,0.003682191,0.1535429,0.8105811,0.0001590723],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000587906,0.991231,0.005798286,0.001015329,0.0002038596,0.00000872648,0.00009009703,0.00002560314,0.001039206],"genre_scores_gemma":[0.005101356,0.9881938,0.005343029,0.0003121443,0.0003734785,0.00001478363,0.000109247,0.000006238295,0.0005459202],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004183466,"threshold_uncertainty_score":0.007745564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032005951","doi":"10.1561/2200000005","title":"A Survey of Statistical Network Models","year":2010,"lang":"en","type":"article","venue":"Foundations and Trends® in Machine Learning","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":853,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Statistical survey; Computer science; Statistics; Mathematics","authors":[{"name":"Anna Goldenberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02131490892849552,"gpt":0.3118738352057813,"spread":0.2905589262772857,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004218758,0.001590056,0.002049088,0.004128357,0.0009082966,0.003136321,0.003388696,0.002260275,0.007162476],"category_scores_gemma":[0.01409647,0.0008494913,0.001725195,0.008455548,0.001523434,0.006440427,0.001535049,0.002844415,0.003268943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002232046,"about_ca_system_score_gemma":0.002384762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005216952,"about_ca_topic_score_gemma":0.003271412,"domain_scores_codex":[0.9975938,0.001043819,0.0001576012,0.0003834652,0.0007010201,0.0001202798],"domain_scores_gemma":[0.9921539,0.005810564,0.0003994753,0.0005991127,0.0008769552,0.0001598271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004213899,0.0001044002,0.003810985,0.001134984,0.0001800884,0.0002219723,0.0002056786,0.08963587,0.0003628608,0.6841204,0.04025774,0.1799229],"study_design_scores_gemma":[0.00001376233,0.00004701151,0.001116144,0.0003595233,0.00005698857,0.0004096467,0.00008522724,0.2421496,0.0001629876,0.6416895,0.1138566,0.00005305979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.006304086,0.1175962,0.8304817,0.01008878,0.001115313,0.0001446247,0.003349745,0.0008718786,0.03004772],"genre_scores_gemma":[0.2494059,0.4515632,0.2510453,0.00427914,0.008891169,0.001106597,0.008410886,0.0008678879,0.02443007],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.007162476,"threshold_uncertainty_score":0.02396089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018165284","doi":"10.1145/1807167.1807306","title":"TwitterMonitor","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":818,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Analytics; Data science; World Wide Web","authors":[{"name":"Michael Mathioudakis","is_ca":true},{"name":"Nick Koudas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004123231302920851,"gpt":0.250569348265993,"spread":0.2464461169630721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001643163,0.001401897,0.001038854,0.002206767,0.0009673798,0.002779411,0.002072889,0.0009751223,0.04780181],"category_scores_gemma":[0.007543399,0.0006287004,0.0005801777,0.001845987,0.0003077096,0.005020502,0.002570458,0.0012078,0.03628089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005177747,"about_ca_system_score_gemma":0.0007881442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003213866,"about_ca_topic_score_gemma":0.003631522,"domain_scores_codex":[0.9986797,0.0002537725,0.0001209599,0.0002903053,0.0005348277,0.0001205219],"domain_scores_gemma":[0.996711,0.0008325504,0.0002295961,0.0009594974,0.0007772536,0.0004901086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001413176,0.0001613302,0.007237838,0.0006368702,0.0001422765,0.0002738818,0.0004429409,0.001933634,0.008442339,0.005401046,0.853833,0.1200817],"study_design_scores_gemma":[0.0003421502,0.0002032814,0.006183115,0.00009157422,0.00011033,0.0002326385,0.0001433281,0.05217634,0.01227794,0.00774283,0.9203503,0.0001461926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"software","genre_gemma":"software","genre_scores_codex":[0.01690213,0.001334366,0.07826432,0.002192703,0.001104459,0.001180033,0.1284746,0.6965306,0.07401676],"genre_scores_gemma":[0.1990446,0.002638305,0.1624261,0.003371459,0.001513427,0.003510488,0.4585386,0.05699268,0.1119644],"genre_candidate":"software","genre_consensus":"software","teacher_disagreement_score":0.04780181,"threshold_uncertainty_score":0.159913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001550906","doi":"10.1257/aer.97.3.890","title":"Meeting Strangers and Friends of Friends: How Random Are Social Networks?","year":2007,"lang":"en","type":"article","venue":"American Economic Review","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":649,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Random graph; Dominance (genetics); Network formation; Social network (sociolinguistics); Cluster analysis; Preferential attachment; Stochastic dominance; Computer science; Giant component; Spatial network; Degree (music); Stochastic process; Complex network; Mathematics; Econometrics; Theoretical computer science; Combinatorics; Statistics; Graph; Artificial intelligence; World Wide Web; Physics; Social media","authors":[{"name":"Matthew O. Jackson","is_ca":false},{"name":"Brian W. Rogers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009329629330325499,"gpt":0.2713615775976199,"spread":0.2620319482672944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00432736,0.000510792,0.0009240285,0.001451266,0.001241634,0.003648238,0.001605506,0.001540756,0.003852945],"category_scores_gemma":[0.04324103,0.0004183303,0.0006229375,0.002014896,0.003389193,0.007179835,0.001364957,0.001125847,0.0005835487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001726739,"about_ca_system_score_gemma":0.0004095926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004120826,"about_ca_topic_score_gemma":0.004292051,"domain_scores_codex":[0.9964521,0.00239787,0.00007833751,0.0005448047,0.0003166636,0.0002102207],"domain_scores_gemma":[0.9764446,0.0170843,0.003754296,0.001326826,0.0006714029,0.0007186565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005500289,0.0001661891,0.0863773,0.0004298712,0.0004911484,0.001215817,0.004583065,0.2028455,0.001509283,0.6132782,0.01141875,0.07713497],"study_design_scores_gemma":[0.0001061418,0.00013713,0.02009995,0.0001041043,0.0001571307,0.0009005326,0.0026865,0.2742347,0.0004936717,0.6908363,0.01015339,0.0000905547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7588894,0.00357679,0.2022142,0.01070911,0.0001487658,0.0002154157,0.0009690336,0.0002589311,0.02301834],"genre_scores_gemma":[0.9931038,0.0007772819,0.003995067,0.0001993258,0.00005983132,0.00006329532,0.0001615241,0.00002930336,0.001610656],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00432736,"threshold_uncertainty_score":0.0228855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111347866","doi":"10.1109/tvcg.2007.70582","title":"NodeTrix: a Hybrid Visualization of Social Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Visualization and Computer Graphics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":553,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Ontario Institute for Cancer Research","funders":"","keywords":"Computer science; Visualization; Representation (politics); Data visualization; Set (abstract data type); Key (lock); Social network analysis; Adjacency matrix; Node (physics); Data science; Theoretical computer science; Adjacency list; Information visualization; Graph drawing; Data mining; World Wide Web; Graph; Social media; Algorithm; Programming language","authors":[{"name":"Nathalie Henry","is_ca":false},{"name":"Jean‐Daniel Fekete","is_ca":false},{"name":"Michael J. McGuffin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01199413693648282,"gpt":0.286755499340916,"spread":0.2747613624044332,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009718807,0.0009122142,0.0005096754,0.00279201,0.0007216291,0.00274612,0.001060482,0.0008145921,0.01407861],"category_scores_gemma":[0.00378808,0.0004911607,0.0007609711,0.002232563,0.0004162984,0.003069176,0.003062182,0.001417128,0.001741915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004754229,"about_ca_system_score_gemma":0.0008164941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003650414,"about_ca_topic_score_gemma":0.005023743,"domain_scores_codex":[0.9995587,0.000166606,0.00003006977,0.00006714342,0.000143018,0.00003450859],"domain_scores_gemma":[0.9986615,0.0007204154,0.0001191735,0.0002083903,0.0001735264,0.000116895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001083461,0.0002989343,0.01074393,0.002263456,0.0004210426,0.001519224,0.01200275,0.09853779,0.05117714,0.1214588,0.2134284,0.4870651],"study_design_scores_gemma":[0.0002738262,0.0001877894,0.005624749,0.0003945681,0.0001106397,0.0009645619,0.001677234,0.5290034,0.0266873,0.105848,0.3289789,0.0002490877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03918,0.0008309345,0.8806674,0.001544261,0.0002828671,0.0003456581,0.01302163,0.05027635,0.01385094],"genre_scores_gemma":[0.2129046,0.001748294,0.7572456,0.0002984463,0.0001295337,0.0009351094,0.0120324,0.006824754,0.007881173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01407861,"threshold_uncertainty_score":0.04709768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2478496062","doi":"10.20982/tqmp.11.1.p008","title":"Hierarchical Cluster Analysis: Comparison of Three Linkage Measures and Application to Psychological Data","year":2015,"lang":"en","type":"article","venue":"The Quantitative Methods for Psychology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":543,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"University of Ottawa","keywords":"Linkage (software); Cluster (spacecraft); Hierarchical clustering; Computer science; Psychology; Data mining; Statistics; Cluster analysis; Mathematics; Artificial intelligence; Biology; Genetics","authors":[{"name":"Odilia Yim","is_ca":true},{"name":"Kylee T. Ramdeen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3452505785625193,"gpt":0.5799659791907616,"spread":0.2347154006282424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05673344,0.001785673,0.00166273,0.01524639,0.003272779,0.006600162,0.002840412,0.001488697,0.004922478],"category_scores_gemma":[0.1541349,0.0009541693,0.002351864,0.02032017,0.004207207,0.006991122,0.00555946,0.002020109,0.0009417112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004312165,"about_ca_system_score_gemma":0.006331438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006214106,"about_ca_topic_score_gemma":0.005335717,"domain_scores_codex":[0.9535438,0.02861772,0.002727499,0.003110833,0.01134083,0.000659276],"domain_scores_gemma":[0.8954386,0.07331556,0.007233405,0.006220149,0.01643929,0.001353036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009572912,0.0004176334,0.03565896,0.003826163,0.002225321,0.000298032,0.0207258,0.0345892,0.003644137,0.2810883,0.02115449,0.5954147],"study_design_scores_gemma":[0.0004004166,0.001346848,0.06507696,0.002291391,0.0008623099,0.0008973267,0.01921304,0.286539,0.008272173,0.5461049,0.06802459,0.0009710428],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03090014,0.001724659,0.9485865,0.0009063268,0.0002523499,0.002240876,0.001046947,0.001996517,0.01234576],"genre_scores_gemma":[0.101297,0.001152157,0.8924822,0.00009329693,0.0000596187,0.003086201,0.000643048,0.0003978384,0.0007887172],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05673344,"threshold_uncertainty_score":0.3000387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990570693","doi":"10.1109/icdm.2011.132","title":"SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":505,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Maximization; Greedy algorithm; Computer science; Set (abstract data type); Time complexity; Running time; Algorithm; Approximation algorithm; Simple (philosophy); Mathematical optimization; Mathematics","authors":[{"name":"Amit Goyal","is_ca":true},{"name":"Wei Lu","is_ca":true},{"name":"Laks V. S. Lakshmanan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04184048520806127,"gpt":0.2850095289828672,"spread":0.243169043774806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001513159,0.001312426,0.001408153,0.001964648,0.0007567487,0.001224309,0.002304578,0.001150693,0.00437024],"category_scores_gemma":[0.005907147,0.0006460727,0.001227913,0.002550442,0.0009226913,0.002535688,0.001943363,0.001235952,0.001956303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262378,"about_ca_system_score_gemma":0.002535506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003922119,"about_ca_topic_score_gemma":0.006192392,"domain_scores_codex":[0.9990707,0.0003023317,0.00005192946,0.0002143841,0.0002655244,0.0000951877],"domain_scores_gemma":[0.9977317,0.001444045,0.0001643106,0.0003288963,0.0002444763,0.00008665913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003166561,0.0001860656,0.001994767,0.0003537247,0.000169162,0.0002118969,0.0002596395,0.5311828,0.006539203,0.03731705,0.01828723,0.4031819],"study_design_scores_gemma":[0.00003901593,0.00001924552,0.00007866153,0.000005968986,0.000009196722,0.0000417973,0.00001345807,0.9811458,0.001225428,0.01595323,0.001462264,0.000006007609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006047283,0.0001484217,0.9884689,0.0001345828,0.00002300742,0.0001213003,0.0001945858,0.003137592,0.00172435],"genre_scores_gemma":[0.1263322,0.0002181173,0.8692215,0.0001441762,0.00006344209,0.0004567286,0.0008475204,0.0005433151,0.002172981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00437024,"threshold_uncertainty_score":0.01461995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080243455","doi":"10.1103/physreve.69.046106","title":"Statistical analysis of airport network of China","year":2004,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":469,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Degree (music); Clustering coefficient; Power law; Topology (electrical circuits); Path (computing); Mathematics; Power (physics); Statistical physics; Physics; Cluster analysis; Statistics; Combinatorics; Computer science; Quantum mechanics","authors":[{"name":"W. Li","is_ca":true},{"name":"X. Cai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01169864230698257,"gpt":0.3276967364990397,"spread":0.3159980941920571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007468039,0.0002546607,0.0002766354,0.003146721,0.0005189904,0.0006024422,0.0004773797,0.0002169063,0.001581845],"category_scores_gemma":[0.003240519,0.0001331666,0.0004080342,0.003158892,0.0004483045,0.0006525127,0.0004986302,0.000214092,0.0001062067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001857133,"about_ca_system_score_gemma":0.0007304939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.05039128,"about_ca_topic_score_gemma":0.028428,"domain_scores_codex":[0.9996418,0.00008756644,0.00001984107,0.00009727169,0.00007257686,0.00008100804],"domain_scores_gemma":[0.9980996,0.0005774631,0.0005209897,0.000142966,0.0004540404,0.000204937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0002363669,0.0000591591,0.68562,0.0001755777,0.0003149337,0.001037668,0.0005881267,0.2489901,0.003016778,0.02669051,0.004823825,0.02844691],"study_design_scores_gemma":[0.0000126161,0.00005793311,0.5152649,0.00001515905,0.00007391026,0.0002455915,0.000323495,0.4736112,0.0005702191,0.006834517,0.002957596,0.00003296078],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9929318,0.0001740743,0.003942328,0.0001490796,0.000007000108,0.00001872844,0.001154547,0.00003684616,0.001585542],"genre_scores_gemma":[0.9978979,0.0001013881,0.000572279,0.000007051663,0.000006720426,0.00001171298,0.001067645,0.000003449601,0.0003318889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05039128,"threshold_uncertainty_score":0.1001959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991635064","doi":"10.14778/2047485.2047492","title":"A data-based approach to social influence maximization","year":2011,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":426,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Maximization; Submodular set function; Computer science; Scalability; Perspective (graphical); Set (abstract data type); Function (biology); Expectation–maximization algorithm; Social graph; Social network (sociolinguistics); Mathematical optimization; Theoretical computer science; Artificial intelligence; Social media; Mathematics; Maximum likelihood; World Wide Web; Statistics","authors":[{"name":"Amit Goyal","is_ca":true},{"name":"Francesco Bonchi","is_ca":false},{"name":"Laks V. S. Lakshmanan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05672051885013572,"gpt":0.261899610639344,"spread":0.2051790917892083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004309889,0.001920257,0.002628489,0.002680773,0.0009655249,0.002829244,0.004028468,0.002747652,0.002675511],"category_scores_gemma":[0.02209104,0.001104108,0.001850612,0.004322161,0.002263358,0.005101502,0.002967305,0.003887398,0.0007443896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002906474,"about_ca_system_score_gemma":0.001599906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003881742,"about_ca_topic_score_gemma":0.004190293,"domain_scores_codex":[0.9965501,0.001298967,0.0001898503,0.0009792532,0.0007990678,0.0001828044],"domain_scores_gemma":[0.9871398,0.009606346,0.0008665477,0.00118428,0.0009034892,0.00029952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001296655,0.0001734243,0.003062385,0.000330525,0.0002030631,0.0001608367,0.0002573589,0.7798827,0.001581639,0.1365348,0.005212234,0.07247142],"study_design_scores_gemma":[0.0000112683,0.00001829161,0.0001474789,0.00001417097,0.0000129138,0.00003675374,0.00001659135,0.9315203,0.0005871168,0.0663912,0.001234878,0.000008946231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004838125,0.0002647919,0.9925609,0.0004830493,0.00002867487,0.00009538738,0.000339318,0.0002029189,0.001186804],"genre_scores_gemma":[0.4564472,0.00117393,0.5344872,0.0004963736,0.0005444019,0.0008956415,0.001760273,0.0002489877,0.003946037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004309889,"threshold_uncertainty_score":0.02279317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076916637","doi":"10.1016/j.physa.2010.04.008","title":"The complexity and robustness of metro networks","year":2010,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":424,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Robustness (evolution); Computer science; Computer network; Biology","authors":[{"name":"Sybil Derrible","is_ca":true},{"name":"Christopher Kennedy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01662984353690914,"gpt":0.2789023387438961,"spread":0.2622724952069869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00177785,0.0004661581,0.0009487533,0.002148622,0.0008167754,0.002833075,0.001185206,0.001347084,0.001775408],"category_scores_gemma":[0.02027446,0.0006790714,0.0005566632,0.0009846889,0.002690065,0.005203599,0.001505497,0.001156782,0.0001841514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001220095,"about_ca_system_score_gemma":0.0004959314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001606526,"about_ca_topic_score_gemma":0.0009208496,"domain_scores_codex":[0.9988021,0.0004425338,0.00005216423,0.0002559882,0.0003254036,0.0001217966],"domain_scores_gemma":[0.9755123,0.01809849,0.003530245,0.001243017,0.0008318989,0.0007840075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001817924,0.0000454846,0.007324835,0.0001573234,0.0001416846,0.0002248806,0.0003191491,0.5209403,0.005057564,0.4481684,0.001457265,0.01598138],"study_design_scores_gemma":[0.00001300388,0.00002799962,0.004182187,0.00001927602,0.00002003491,0.000102504,0.0001030782,0.5949643,0.0005101661,0.399081,0.0009440177,0.00003243203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6252525,0.002165118,0.351942,0.003417606,0.0001099422,0.0000534614,0.0006852835,0.0002068559,0.01616719],"genre_scores_gemma":[0.9936668,0.0004740767,0.004386967,0.00006960004,0.0001667759,0.0000270839,0.0001243452,0.00002520316,0.001059071],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002833075,"threshold_uncertainty_score":0.009402215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950146322","doi":"10.1002/asi.20335","title":"Co‐occurrence matrices and their applications in information science: Extending ACA to the Web environment","year":2006,"lang":"en","type":"article","venue":"Journal of the American Society for Information Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":355,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Visualization; Matrix (chemical analysis); Information retrieval; Set (abstract data type); Distance matrix; Citation; Data mining; Data set; Confusion; Data science; Theoretical computer science; Algorithm; World Wide Web; Artificial intelligence","authors":[{"name":"Loet Leydesdorff","is_ca":false},{"name":"Liwen Vaughan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006026340354717904,"gpt":0.269356313451892,"spread":0.2633299730971741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.006861552,0.0008119081,0.001023675,0.01238067,0.001586504,0.004075095,0.001091874,0.00086539,0.004403204],"category_scores_gemma":[0.05786579,0.0003994546,0.001126894,0.01652894,0.002376406,0.00525459,0.002810557,0.001662459,0.0008884104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001284282,"about_ca_system_score_gemma":0.001616492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004700341,"about_ca_topic_score_gemma":0.003965267,"domain_scores_codex":[0.9925752,0.004269633,0.0004855489,0.000837048,0.001653062,0.0001794418],"domain_scores_gemma":[0.9216283,0.06269559,0.003631431,0.004349317,0.00646814,0.001227197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001349262,0.0001903417,0.01074093,0.0005016152,0.0001649509,0.0005905643,0.0018068,0.03627495,0.00168073,0.5947681,0.006923055,0.3462231],"study_design_scores_gemma":[0.00002343996,0.00004805642,0.003500498,0.0001295591,0.00004609695,0.0005052872,0.0004894895,0.422854,0.001061146,0.554985,0.01628561,0.00007192072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0302822,0.001708512,0.9541805,0.001271872,0.0001877419,0.0002012061,0.000599188,0.001023882,0.01054493],"genre_scores_gemma":[0.3835606,0.001258478,0.6120902,0.0001289579,0.0004312113,0.0004329313,0.0003820738,0.0001479333,0.001567504],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9876193,"threshold_uncertainty_score":0.03628778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005498212","doi":"10.1287/orsc.1100.0600","title":"Network Exchange Patterns in Online Communities","year":2010,"lang":"en","type":"article","venue":"Organization Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":346,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Fox School of Business, Temple University; Canada Research Chairs","keywords":"Reciprocity (cultural anthropology); Exponential random graph models; Online participation; Social exchange theory; Online community; Preferential attachment; Information exchange; Norm of reciprocity; Scale (ratio); Complex network; The Internet; Computer science; Social psychology; Sociology; Psychology; Graph; Social capital; World Wide Web; Random graph; Theoretical computer science; Geography; Telecommunications","authors":[{"name":"Samer Faraj","is_ca":true},{"name":"Steven L. Johnson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0147539972098864,"gpt":0.2711749183502127,"spread":0.2564209211403263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002382612,0.0001292618,0.0002824786,0.00242088,0.0007002382,0.001098658,0.0004239864,0.000493817,0.001186171],"category_scores_gemma":[0.02212929,0.000208474,0.0002654998,0.001683681,0.00104548,0.002345191,0.001056451,0.00036428,0.0001600952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006722314,"about_ca_system_score_gemma":0.0003234692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001567657,"about_ca_topic_score_gemma":0.002168762,"domain_scores_codex":[0.9980406,0.0009935234,0.0001119072,0.0004208878,0.0003011517,0.0001319495],"domain_scores_gemma":[0.9832689,0.0102363,0.003355231,0.001253761,0.001383377,0.0005024141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0005610359,0.0003932393,0.7665378,0.0003698131,0.0003444158,0.0005633525,0.0194848,0.0249621,0.01457185,0.06405736,0.001368043,0.1067862],"study_design_scores_gemma":[0.00006657647,0.0002795596,0.7218021,0.00008950381,0.0001125165,0.001216687,0.009316857,0.154676,0.00357742,0.1035116,0.005248883,0.0001023574],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9842603,0.0001092378,0.01362376,0.0001030748,0.000002673657,0.00004548202,0.0001128334,0.00004015907,0.0017025],"genre_scores_gemma":[0.9969235,0.00002711114,0.002692571,0.000007694012,0.000002027563,0.00003101668,0.0000863992,0.000004736695,0.0002247947],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00242088,"threshold_uncertainty_score":0.0126006,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146653491","doi":"10.1136/jech.2003.014530","title":"A glossary of terms for navigating the field of social network analysis","year":2004,"lang":"en","type":"review","venue":"Journal of Epidemiology & Community Health","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":343,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Fondation pour la Recherche Médicale; University of Calgary","keywords":"Glossary; Social network analysis; Field (mathematics); Computer science; Social network (sociolinguistics); Data science; Sociology; Linguistics; World Wide Web; Social media; Mathematics","authors":[{"name":"Penelope Hawe","is_ca":true},{"name":"Cynthia Webster","is_ca":false},{"name":"Alan Shiell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1161245272876579,"gpt":0.5037805052009522,"spread":0.3876559779132943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001841371,0.003180107,0.003085328,0.02105413,0.001355416,0.003721058,0.003173428,0.002585762,0.09949004],"category_scores_gemma":[0.0130077,0.001060616,0.001540814,0.02785316,0.001331725,0.007781354,0.002713843,0.003494288,0.08990156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001547848,"about_ca_system_score_gemma":0.002755385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004236483,"about_ca_topic_score_gemma":0.007470193,"domain_scores_codex":[0.9981041,0.0003603993,0.0004614851,0.0001750995,0.0008162544,0.00008261901],"domain_scores_gemma":[0.9938071,0.003607824,0.0005368787,0.0003258163,0.001461112,0.0002611891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000193009,0.00005181855,0.00009482992,0.005403409,0.00002709905,0.0001834013,0.0002114379,0.0003614749,0.0007037346,0.01859995,0.7822415,0.1921021],"study_design_scores_gemma":[0.000004087799,0.000008009966,0.0001990001,0.001934267,0.000009155287,0.0003015497,0.00005053357,0.00007222815,0.0000557864,0.007862569,0.9894863,0.00001657957],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0006329313,0.6885213,0.05755043,0.01088359,0.01369964,0.002253578,0.0380477,0.003300827,0.1851101],"genre_scores_gemma":[0.003171374,0.6830997,0.1108037,0.01398707,0.00634844,0.004920581,0.04018348,0.001876327,0.1356093],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.09949004,"threshold_uncertainty_score":0.3328274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1502487903","doi":"10.1007/978-3-642-17572-5_48","title":"Threshold Models for Competitive Influence in Social Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":316,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Maximization; Competitor analysis; Greedy algorithm; Mathematical optimization; Cascade; Set (abstract data type); Square root; Extension (predicate logic); Conjecture; Product (mathematics); Mathematical economics; Algorithm; Mathematics; Discrete mathematics","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Joel Oren","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01530642877649156,"gpt":0.2650131315491454,"spread":0.2497067027726538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006011104,0.002025806,0.004778017,0.003503743,0.002025428,0.006297521,0.008323451,0.006503798,0.01830346],"category_scores_gemma":[0.03688941,0.001786205,0.002435733,0.003935351,0.005215693,0.01265383,0.003252903,0.006266941,0.002645884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005282579,"about_ca_system_score_gemma":0.001747629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01065423,"about_ca_topic_score_gemma":0.008505534,"domain_scores_codex":[0.9962525,0.001759798,0.0001590152,0.0005441246,0.0006689029,0.0006157663],"domain_scores_gemma":[0.9689435,0.02498971,0.001469487,0.001449683,0.001723567,0.001423994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006518835,0.00005932297,0.0004453617,0.0001349172,0.00005483193,0.00007442641,0.0002663335,0.09563711,0.0002720949,0.8913303,0.00615376,0.005506455],"study_design_scores_gemma":[0.00002661989,0.00001249251,0.0001214408,0.00002068017,0.00002173438,0.00003145913,0.00005133047,0.4689888,0.00004427513,0.5297236,0.000938083,0.00001946667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05955545,0.003655235,0.8894302,0.006138733,0.0004853556,0.0002424766,0.000996398,0.0008914949,0.03860477],"genre_scores_gemma":[0.880125,0.004991588,0.05115781,0.001106312,0.001660595,0.0009613969,0.0009806324,0.0006188222,0.05839793],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01830346,"threshold_uncertainty_score":0.06123114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111289574","doi":"10.1145/1052934.1052942","title":"Link analysis ranking: algorithms, theory, and experiments","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Internet Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":308,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Hyperlink; Link analysis; HITS algorithm; Ranking (information retrieval); Algorithm; Learning to rank; Bayesian network; Web page; Graph; Theoretical computer science; Information retrieval; Machine learning; Web navigation; Web search engine; World Wide Web","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Gareth O. Roberts","is_ca":false},{"name":"Jeffrey S. Rosenthal","is_ca":true},{"name":"Panayiotis Tsaparas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01240196685194532,"gpt":0.292649307197903,"spread":0.2802473403459577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02273889,0.003085953,0.002959409,0.006402074,0.002380145,0.003432254,0.003238625,0.003684587,0.006135751],"category_scores_gemma":[0.1058084,0.0009196938,0.001335236,0.01084836,0.002129252,0.00905446,0.002753918,0.00323033,0.002244035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003821093,"about_ca_system_score_gemma":0.002537938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01007736,"about_ca_topic_score_gemma":0.00622277,"domain_scores_codex":[0.9596909,0.02668191,0.001983063,0.002572831,0.007739837,0.001331398],"domain_scores_gemma":[0.8197877,0.1534998,0.003712797,0.0134131,0.008281492,0.001305083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.006709796,0.01017547,0.01329464,0.003773403,0.001619376,0.0001850442,0.000507498,0.3445356,0.004227208,0.02093831,0.06660368,0.52743],"study_design_scores_gemma":[0.001432816,0.002158929,0.004994758,0.00023362,0.0004275043,0.0003254915,0.0003665319,0.9313905,0.005676478,0.04433439,0.008490214,0.0001686797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4112676,0.04880534,0.4630725,0.005930999,0.002247618,0.004285772,0.01068773,0.01480285,0.03889949],"genre_scores_gemma":[0.586682,0.007871024,0.3871709,0.001080717,0.0008290012,0.002369195,0.008627975,0.001259671,0.004109719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02273889,"threshold_uncertainty_score":0.1202562,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2598116636","doi":"10.25300/misq/2017/41.4.08","title":"Social Media Affordances for Connective Action: An Examination of Microblogging Use During the Gulf of Mexico Oil Spill1","year":2017,"lang":"en","type":"article","venue":"MIS Quarterly","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":285,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Affordance; Social media; Action (physics); Microblogging; Collective action; Oil spill; Public relations; Sociology; Political science; Media studies; Psychology; World Wide Web; Computer science; Engineering; Petroleum engineering; Politics; Cognitive psychology","authors":[{"name":"Emmanuelle Vaast","is_ca":true},{"name":"Hani Safadi","is_ca":false},{"name":"Liette Lapointe","is_ca":true},{"name":"Bogdan Negoita","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03735162908452699,"gpt":0.3061093531635858,"spread":0.2687577240790588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014249,0.0003287999,0.0002662615,0.003182167,0.0034814,0.002271367,0.0005513019,0.0009565563,0.00285727],"category_scores_gemma":[0.006301038,0.0003672747,0.0002189041,0.002057101,0.002351379,0.002868626,0.002696464,0.0008437624,0.0002552572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001614905,"about_ca_system_score_gemma":0.0008406818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03791915,"about_ca_topic_score_gemma":0.09620345,"domain_scores_codex":[0.9991756,0.0003423078,0.00003891812,0.0001109122,0.0001720823,0.0001600971],"domain_scores_gemma":[0.9960033,0.002523695,0.0008711644,0.0001356304,0.0002550446,0.0002111998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"observational","study_design_scores_codex":[0.0001888507,0.0001175216,0.1760019,0.000337101,0.000050369,0.0013941,0.7806425,0.0001337869,0.002636492,0.002260418,0.001637511,0.03459941],"study_design_scores_gemma":[0.000004575441,0.00007491526,0.4345535,0.0002001695,0.00001998084,0.0003095226,0.5485782,0.0002937704,0.0003890881,0.0006950591,0.01484857,0.00003269642],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.994713,0.0003046287,0.0004520213,0.0004670511,0.00001205957,0.00002600723,0.0001607596,0.000008183302,0.003856137],"genre_scores_gemma":[0.9975938,0.0004215379,0.0006712415,0.00008510992,0.00001726704,0.00005418962,0.0001255698,0.00001454089,0.001016751],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03791915,"threshold_uncertainty_score":0.07539684,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2735861106","doi":"10.1126/science.aal4122","title":"Effects of network modularity on the spread of perturbation impact in experimental metapopulations","year":2017,"lang":"en","type":"article","venue":"Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":268,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Metapopulation; Modularity (biology); Perturbation (astronomy); Computer science; Biology; Statistical physics; Evolutionary biology; Physics; Demography; Sociology; Astronomy; Population","authors":[{"name":"Luis J. Gilarranz","is_ca":false},{"name":"Bronwyn Rayfield","is_ca":true},{"name":"G. Liñán","is_ca":false},{"name":"Jordi Bascompte","is_ca":false},{"name":"Andrew Gonzalez","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01970721488104545,"gpt":0.3361135036015257,"spread":0.3164062887204803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001596305,0.0004334445,0.0003556813,0.0006333098,0.0002997249,0.0005527228,0.0005097183,0.0005021014,0.0006820169],"category_scores_gemma":[0.01083638,0.0001989813,0.0003764645,0.0003097269,0.001026822,0.0007614343,0.0007685459,0.0007894675,0.00006228936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007045053,"about_ca_system_score_gemma":0.0002347642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008869848,"about_ca_topic_score_gemma":0.000807267,"domain_scores_codex":[0.9991981,0.0004013782,0.00005194192,0.0001543065,0.000111295,0.00008306005],"domain_scores_gemma":[0.9900649,0.006201989,0.001817241,0.001021667,0.0003829414,0.0005112432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002048948,0.001694306,0.09887525,0.0004995155,0.0009180029,0.0005892327,0.0007646295,0.3130971,0.5410836,0.009214302,0.0006390339,0.03057598],"study_design_scores_gemma":[0.0001886087,0.00334343,0.1184241,0.00007334074,0.0003234028,0.0003535406,0.0003236118,0.7557602,0.1095144,0.01111913,0.0004530108,0.0001231408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9967997,0.00006311973,0.002713778,0.0000501711,0.000005529424,0.000008996555,0.00003684527,0.00002787321,0.000293859],"genre_scores_gemma":[0.9989603,0.00002864592,0.0009113031,0.00001276586,0.000002221523,0.00001073874,0.00002688362,0.000004807746,0.00004236423],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001596305,"threshold_uncertainty_score":0.008442163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064796447","doi":"10.1073/pnas.0912671107","title":"Edge direction and the structure of networks","year":2010,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":259,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development","keywords":"Assortativity; Computer science; Complex network; Class (philosophy); Evolving networks; Theoretical computer science; Adjacency list; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Artificial intelligence; Algorithm; World Wide Web","authors":[{"name":"Jacob G. Foster","is_ca":true},{"name":"David Foster","is_ca":true},{"name":"Peter Grassberger","is_ca":true},{"name":"Maya Paczuski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01211060845096483,"gpt":0.2758726139049613,"spread":0.2637620054539964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008957313,0.0002368422,0.0002414645,0.002736047,0.0005314383,0.001950939,0.0003913403,0.0006606131,0.001021754],"category_scores_gemma":[0.009080419,0.0002377141,0.0001871616,0.001846659,0.001724518,0.002705336,0.0007326852,0.0005847362,0.0002375916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005825951,"about_ca_system_score_gemma":0.0002995315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006795524,"about_ca_topic_score_gemma":0.0008499257,"domain_scores_codex":[0.9994135,0.0002578904,0.00003377741,0.0001292416,0.0001242331,0.0000413358],"domain_scores_gemma":[0.9925967,0.004779846,0.001248681,0.0003956299,0.0007229332,0.0002560418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001350606,0.0000541656,0.04880461,0.0002245376,0.00009813344,0.0001848236,0.0006978897,0.07609597,0.008482369,0.7622755,0.001956731,0.1009902],"study_design_scores_gemma":[0.0000264542,0.00005952433,0.02292122,0.00008095732,0.00005229979,0.0003313115,0.0003599921,0.1356996,0.003171444,0.8273741,0.009886691,0.00003634699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6540198,0.003627546,0.3175985,0.00203292,0.0001162173,0.00008340583,0.0007965049,0.0002759094,0.02144921],"genre_scores_gemma":[0.9614612,0.00119729,0.03561227,0.0001226983,0.00007627116,0.00006089555,0.0002602402,0.00002403884,0.001185143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002736047,"threshold_uncertainty_score":0.004737198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967510236","doi":"10.1209/0295-5075/97/16006","title":"Percolation theory on interdependent networks based on epidemic spreading","year":2012,"lang":"en","type":"article","venue":"Europhysics Letters (EPL)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":252,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Interdependent networks; Dependency (UML); Percolation theory; Percolation (cognitive psychology); Interdependence; Extension (predicate logic); Network theory; Directed percolation","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01046642374614039,"gpt":0.2452813521588726,"spread":0.2348149284127322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000663959,0.000712088,0.0006153625,0.00171346,0.0005701738,0.00124328,0.001383939,0.001296354,0.002376898],"category_scores_gemma":[0.002384256,0.0002763302,0.0007515079,0.0009046221,0.00144904,0.002335835,0.001179528,0.001334909,0.0004121937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008988582,"about_ca_system_score_gemma":0.0003975355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001166323,"about_ca_topic_score_gemma":0.0008760527,"domain_scores_codex":[0.9995809,0.0001754337,0.00001541302,0.00007084439,0.0001136606,0.00004376621],"domain_scores_gemma":[0.9993747,0.0002906234,0.0001016918,0.00007465357,0.00008155288,0.00007669591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001002668,0.00001777305,0.0002105635,0.00003339962,0.00001733713,0.000140527,0.00008960271,0.09226376,0.001249426,0.9023818,0.0007527937,0.002832986],"study_design_scores_gemma":[0.000008289005,0.0000127606,0.0001637481,0.0000129315,0.00001104353,0.00006599819,0.00002172321,0.5515671,0.0002311693,0.4460594,0.001832864,0.00001299919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07297213,0.001881098,0.8903694,0.001399609,0.0002130654,0.00007626095,0.0001613952,0.0001503257,0.03277665],"genre_scores_gemma":[0.9050485,0.002573206,0.07863602,0.0004504297,0.0003338047,0.0001834822,0.0001520721,0.000085672,0.01253678],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002376898,"threshold_uncertainty_score":0.007951498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000922801","doi":"10.1007/978-3-031-01850-3","title":"Information and Influence Propagation in Social Networks","year":2014,"lang":"en","type":"book","venue":"Synthesis lectures on data management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":252,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Social media; Social network (sociolinguistics); Internet privacy; Sociology; Economic geography; Computer science; World Wide Web; Geography","authors":[{"name":"Wei Chen","is_ca":false},{"name":"Laks V. S. Lakshmanan","is_ca":true},{"name":"Carlos Castillo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01122099561622583,"gpt":0.2480253541348997,"spread":0.2368043585186738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006799048,0.0009607204,0.0006758683,0.001694214,0.0006105275,0.002085578,0.0006163667,0.0008951109,0.009895643],"category_scores_gemma":[0.003912513,0.0004581129,0.0005081468,0.002612779,0.001482948,0.00404226,0.0008152945,0.001665541,0.002079458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001062824,"about_ca_system_score_gemma":0.0004741148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002021702,"about_ca_topic_score_gemma":0.002377788,"domain_scores_codex":[0.9995868,0.00009389664,0.00001540945,0.00008195163,0.0001970029,0.00002511366],"domain_scores_gemma":[0.9981111,0.00148438,0.00006915717,0.0001165262,0.0001587344,0.00006012744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001556794,0.00003310732,0.0003544874,0.0002235846,0.00004417661,0.00007687766,0.0002620432,0.02668639,0.000471697,0.7734641,0.06220247,0.1361655],"study_design_scores_gemma":[0.000006056676,0.000008770323,0.0004463541,0.00005151642,0.00001760031,0.00006327636,0.00004452961,0.04244285,0.0002267611,0.8961101,0.06056729,0.00001492796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.01340547,0.04202273,0.592636,0.009660764,0.003888482,0.00008335997,0.0008894881,0.0007695701,0.3366442],"genre_scores_gemma":[0.3596126,0.06427753,0.1316319,0.001663897,0.01276694,0.0004538116,0.001347653,0.0006633847,0.4275823],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.009895643,"threshold_uncertainty_score":0.03310424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621145626","doi":"10.14778/3099622.3099626","title":"Attribute-driven community search","year":2017,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":241,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Node (physics); Theoretical computer science; Relevance (law); Graph; Community structure; Cohesion (chemistry); Data mining; Mathematics; Combinatorics","authors":[{"name":"Xin Huang","is_ca":false},{"name":"Laks V. S. Lakshmanan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04102465157361466,"gpt":0.3032241378313941,"spread":0.2621994862577794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003737529,0.001184398,0.002556851,0.004954778,0.001829028,0.002030328,0.003495515,0.002509891,0.002939781],"category_scores_gemma":[0.01403862,0.0007495718,0.001611041,0.007300162,0.001404411,0.004832463,0.003525081,0.001592025,0.0009970963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001759728,"about_ca_system_score_gemma":0.001706588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004812211,"about_ca_topic_score_gemma":0.005608539,"domain_scores_codex":[0.996046,0.001433999,0.0001904343,0.001007239,0.00108885,0.0002334505],"domain_scores_gemma":[0.9917973,0.004938946,0.0006822974,0.0009126957,0.001280363,0.000388345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004235626,0.0004196332,0.005092202,0.0008740696,0.0005221784,0.0002714834,0.0007636474,0.5084456,0.003964516,0.1194162,0.01959518,0.3402117],"study_design_scores_gemma":[0.00007111157,0.00004869896,0.0002460058,0.00002405989,0.00003935279,0.0001148669,0.00007082218,0.9058746,0.0007551567,0.08918751,0.003549638,0.00001816434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02493704,0.001811277,0.9679136,0.0007425855,0.00009328967,0.0003125884,0.000624452,0.0006334327,0.002931734],"genre_scores_gemma":[0.4121432,0.001487394,0.5760769,0.0007970922,0.0003259825,0.000573586,0.002955321,0.0002162165,0.005424307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004954778,"threshold_uncertainty_score":0.01976615,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026875114","doi":"10.1145/371920.372096","title":"Finding authorities and hubs from link structures on the World Wide Web","year":2001,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":229,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Link (geometry); Computer science; Link analysis; World Wide Web; Computer network","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Gareth O. Roberts","is_ca":false},{"name":"Jeffrey S. Rosenthal","is_ca":true},{"name":"Panayiotis Tsaparas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02283628608296505,"gpt":0.272730496850655,"spread":0.2498942107676899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001781043,0.0006249743,0.0004513937,0.01921096,0.001205544,0.002981254,0.0006121793,0.0008002094,0.004298749],"category_scores_gemma":[0.01011015,0.0003055135,0.0005080901,0.01490849,0.001351522,0.005093684,0.00144862,0.0008986232,0.001427224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001083455,"about_ca_system_score_gemma":0.001129111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006328037,"about_ca_topic_score_gemma":0.01766783,"domain_scores_codex":[0.9990669,0.000371551,0.00006360988,0.0002037874,0.0002094784,0.00008471654],"domain_scores_gemma":[0.9942106,0.003520171,0.0008635046,0.0005391481,0.0005604925,0.0003060857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005284111,0.0003091736,0.225036,0.001709264,0.0003718551,0.0007098572,0.00475319,0.04737892,0.01069974,0.2253141,0.01858634,0.4646031],"study_design_scores_gemma":[0.00006347148,0.0001565977,0.1023667,0.0004272389,0.0004113091,0.0006602706,0.0076252,0.4263726,0.01213514,0.4021101,0.04755372,0.0001176604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.446384,0.005420091,0.5131518,0.001779186,0.00007973106,0.00052454,0.01075095,0.002181737,0.01972803],"genre_scores_gemma":[0.7882112,0.0031739,0.190691,0.00007170128,0.0001330613,0.000181965,0.009971893,0.0001620019,0.007403309],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01921096,"threshold_uncertainty_score":0.01438075,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128965269","doi":"10.1093/bib/bbr069","title":"Hive plots--rational approach to visualizing networks","year":2011,"lang":"en","type":"article","venue":"Briefings in Bioinformatics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":222,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Canada's Michael Smith Genome Sciences Centre","funders":"BC Cancer Agency; BC Cancer Foundation; Canada's Michael Smith Genome Sciences Centre","keywords":"Plug-in; Computer science; Node (physics); Simple (philosophy); Data mining; Theoretical computer science; Artificial intelligence; Programming language","authors":[{"name":"Martin Krzywinski","is_ca":false},{"name":"İnanç Birol","is_ca":true},{"name":"Steven J.M. Jones","is_ca":true},{"name":"Marco A. Marra","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.031427913772389,"gpt":0.2552130692557583,"spread":0.2237851554833693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003720125,0.002050191,0.001173652,0.006074855,0.001608609,0.006148736,0.003528104,0.001690341,0.04138495],"category_scores_gemma":[0.01555585,0.001507924,0.001902559,0.003578716,0.001263391,0.005240666,0.003854025,0.004632675,0.007883846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009912329,"about_ca_system_score_gemma":0.001433148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002736382,"about_ca_topic_score_gemma":0.003125086,"domain_scores_codex":[0.9983727,0.0006527191,0.0001309905,0.0002855148,0.0004647597,0.0000932757],"domain_scores_gemma":[0.9929081,0.004678068,0.0003984156,0.0007138738,0.001021515,0.0002800069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004405795,0.000264897,0.002981344,0.002346771,0.0004209607,0.0007593497,0.002844515,0.06948399,0.02227028,0.4139373,0.2054353,0.2788148],"study_design_scores_gemma":[0.0001940543,0.00007987698,0.001153763,0.000433108,0.00008213158,0.0006126627,0.0005608175,0.3416728,0.0135104,0.3141598,0.3273117,0.0002288273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001945806,0.0004090912,0.9682533,0.0007126149,0.000180029,0.000148599,0.002946584,0.0213635,0.004040533],"genre_scores_gemma":[0.03349516,0.001102135,0.9512039,0.0002765777,0.000124616,0.0006800238,0.003442102,0.006087318,0.00358808],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04138495,"threshold_uncertainty_score":0.1384465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W808055529","doi":"10.14778/2850578.2850581","title":"From competition to complementarity","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":216,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Complementarity (molecular biology); Computer science; Maximization; Competition (biology); Mathematical optimization; Cellular automaton; Set (abstract data type); Margin (machine learning); Theoretical computer science; Artificial intelligence; Machine learning; Mathematics","authors":[{"name":"Wei Lu","is_ca":true},{"name":"Wei Chen","is_ca":false},{"name":"Laks V. S. Lakshmanan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0274108720421482,"gpt":0.2739003839945476,"spread":0.2464895119523994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001652073,0.001436836,0.0015955,0.0009281597,0.001009876,0.001978939,0.001615521,0.00179077,0.005836039],"category_scores_gemma":[0.008870943,0.000811236,0.00158204,0.001208949,0.002117943,0.003622288,0.002514468,0.00225885,0.0004858085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002069453,"about_ca_system_score_gemma":0.001384647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005331788,"about_ca_topic_score_gemma":0.004615034,"domain_scores_codex":[0.9984126,0.0005992377,0.00004951936,0.0004785834,0.0002899018,0.0001701117],"domain_scores_gemma":[0.9947727,0.004141596,0.0003329836,0.0002759018,0.0002215578,0.0002552828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001321359,0.0001268317,0.001914238,0.000262118,0.000119748,0.0003543972,0.0002337441,0.616694,0.001668656,0.3374773,0.007088011,0.03392882],"study_design_scores_gemma":[0.00002399581,0.00003894291,0.0003045998,0.00001812491,0.00002858051,0.0000916241,0.000044695,0.7991658,0.0006436449,0.1976176,0.002007058,0.00001533358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0673905,0.0006615175,0.9090972,0.001788721,0.00005563816,0.0001597781,0.0003695749,0.0003597548,0.02011736],"genre_scores_gemma":[0.8588893,0.0007544078,0.1300892,0.0006618105,0.0001762296,0.0003762351,0.0005057031,0.0002129608,0.008334192],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005836039,"threshold_uncertainty_score":0.0195235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986763531","doi":"10.1103/physreve.82.036116","title":"Adaptive networks: Coevolution of disease and topology","year":2010,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":212,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Rotation formalisms in three dimensions; Coevolution; Topology (electrical circuits); Formalism (music); Computer science; Network topology; Context (archaeology); Mathematics; Biology","authors":[{"name":"Vincent Marceau","is_ca":true},{"name":"Pierre‐André Noël","is_ca":true},{"name":"Laurent Hébert‐Dufresne","is_ca":true},{"name":"Antoine Allard","is_ca":true},{"name":"Louis J. Dubé","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01134011617630887,"gpt":0.3044203574286499,"spread":0.293080241252341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009222742,0.0004341879,0.0004630558,0.0009146102,0.0004474722,0.001407118,0.0008060955,0.00098187,0.001553992],"category_scores_gemma":[0.004349633,0.0003043013,0.000559376,0.0007659084,0.001833474,0.00231142,0.001065392,0.0009477549,0.000154676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007470962,"about_ca_system_score_gemma":0.0002858369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001295267,"about_ca_topic_score_gemma":0.0009712225,"domain_scores_codex":[0.9995716,0.000200914,0.00001595548,0.0001002273,0.00006715664,0.00004406294],"domain_scores_gemma":[0.99822,0.001023654,0.0003677297,0.0001643592,0.000106779,0.0001174451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003969976,0.00002188794,0.004018088,0.00009816141,0.00008806258,0.0002804708,0.0003743182,0.2551298,0.006401715,0.7180561,0.0006797464,0.01481187],"study_design_scores_gemma":[0.0000112052,0.00003959841,0.002364269,0.0000206365,0.00002875962,0.0002586896,0.00007041817,0.6849866,0.0008450979,0.3083527,0.002999919,0.00002217971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1948654,0.001759923,0.7939093,0.000930468,0.00007956623,0.00005240003,0.0001412712,0.0001225493,0.008139043],"genre_scores_gemma":[0.9519438,0.001431392,0.04260696,0.0001297708,0.00009790623,0.00008481567,0.00008177089,0.00002910125,0.003594402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001553992,"threshold_uncertainty_score":0.005420625,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104075446","doi":"10.1109/infvis.2003.1249011","title":"Multiscale visualization of small world networks","year":2003,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":203,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Small-world network; Visualization; Metric (unit); Hierarchy; Theoretical computer science; Graph drawing; Complex network; Zoom; Evolving networks; Graph; Network science; Distributed computing; Data science; Data mining; World Wide Web","authors":[{"name":"David Auber","is_ca":false},{"name":"Yves Chiricota","is_ca":true},{"name":"Fabien Jourdan","is_ca":false},{"name":"Guy Mélançon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02122898444453094,"gpt":0.2885582191907317,"spread":0.2673292347462008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004067049,0.0005326309,0.0003583999,0.002234137,0.0004484768,0.001748477,0.0003490549,0.0004992809,0.005340955],"category_scores_gemma":[0.002528721,0.0002744487,0.0003440221,0.00138634,0.0004514139,0.001914936,0.001184697,0.0006357227,0.0004301782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004597928,"about_ca_system_score_gemma":0.000248077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001445441,"about_ca_topic_score_gemma":0.00143692,"domain_scores_codex":[0.9997683,0.00008457228,0.00001014267,0.00004858027,0.00006610497,0.0000223035],"domain_scores_gemma":[0.9991695,0.0004160786,0.0001127463,0.0001000092,0.0001091936,0.00009241686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003831804,0.00007196667,0.009348913,0.0008455235,0.0002029147,0.001428479,0.004701532,0.199575,0.1365385,0.3970798,0.02526219,0.224562],"study_design_scores_gemma":[0.0000348439,0.00004455204,0.007373556,0.0001069055,0.00005508178,0.0005900203,0.0007529825,0.6933715,0.0158227,0.2384664,0.04332089,0.0000604624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1105253,0.001766702,0.8721647,0.001158486,0.00009355317,0.00006206593,0.000973109,0.003528903,0.009727143],"genre_scores_gemma":[0.7647009,0.001944055,0.2287898,0.0001363455,0.0001205808,0.00009725451,0.0007502217,0.0005517231,0.002908959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005340955,"threshold_uncertainty_score":0.01786733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141363521","doi":"10.1002/asi.10369","title":"Does citation reflect social structure?: Longitudinal evidence from the “Globenet” interdisciplinary research group","year":2003,"lang":"en","type":"article","venue":"Journal of the American Society for Information Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":202,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada); University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Citation; Pairwise comparison; Discipline; Psychology; Sociology; Computer science; Social science; Library science; Developmental psychology","authors":[{"name":"Howard D. White","is_ca":false},{"name":"Barry Wellman","is_ca":true},{"name":"Nancy Nazer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04276435714950744,"gpt":0.3893523946520242,"spread":0.3465880375025168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.01082105,0.0002166068,0.0004681415,0.01051718,0.001663672,0.003127699,0.00132959,0.001722633,0.003900758],"category_scores_gemma":[0.07490436,0.0003090927,0.0003819604,0.02300506,0.001202701,0.005197981,0.003001725,0.001251153,0.0009143528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001009557,"about_ca_system_score_gemma":0.001001424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008093202,"about_ca_topic_score_gemma":0.006919598,"domain_scores_codex":[0.9949945,0.002029892,0.0006831303,0.0008024111,0.00111591,0.0003741446],"domain_scores_gemma":[0.8519082,0.04832085,0.06144391,0.01199019,0.01961089,0.006725998],"domain_codex":null,"domain_gemma":"evaluation","domain_candidate":"evaluation","domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00005195239,0.00007445315,0.9869068,0.00004483251,0.00009056665,0.00009113477,0.005017442,0.00006577049,0.00007985189,0.000628108,0.0007967423,0.006152413],"study_design_scores_gemma":[0.000006158141,0.00006747621,0.9916158,0.00007121927,0.0000375326,0.0001524586,0.003669057,0.0003828439,0.00009926915,0.00107772,0.002803938,0.00001642561],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9933211,0.001475243,0.0002858385,0.001112254,0.0000405409,0.00001765758,0.001415029,0.00001206585,0.002320268],"genre_scores_gemma":[0.9976205,0.0004769804,0.0001646022,0.00006913016,0.00006569752,0.0000303441,0.0009994373,0.000009317961,0.0005639697],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9894828,"threshold_uncertainty_score":0.05722791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077787974","doi":"10.1080/0022250x.2001.9990243","title":"Random graph models for temporal processes in social networks","year":2001,"lang":"en","type":"article","venue":"Journal of Mathematical Sociology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":199,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Graph; Random graph; Theoretical computer science","authors":[{"name":"Garry Robins","is_ca":false},{"name":"Philippa Pattison","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03364774990292631,"gpt":0.3177440464959458,"spread":0.2840962965930195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003491926,0.001188928,0.001068938,0.002865259,0.0009619641,0.002353626,0.003147352,0.002442371,0.01155874],"category_scores_gemma":[0.01633666,0.0008861498,0.001990721,0.003071082,0.001764076,0.006067731,0.001502402,0.002821657,0.00236549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003033053,"about_ca_system_score_gemma":0.001033933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01419705,"about_ca_topic_score_gemma":0.01574782,"domain_scores_codex":[0.9982198,0.0008488359,0.00007221227,0.0003939956,0.0002901041,0.0001750377],"domain_scores_gemma":[0.991083,0.006369921,0.001297325,0.0005210935,0.0004904693,0.0002381832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001457584,0.00002536039,0.0009164503,0.00004405053,0.00003578087,0.0001206931,0.0002255751,0.1867689,0.0001991693,0.8015397,0.002451839,0.007657986],"study_design_scores_gemma":[0.00001346026,0.00001331092,0.0003722922,0.00001605833,0.00001430297,0.00006461068,0.00004473373,0.608521,0.00005022325,0.3858099,0.00506362,0.00001648628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01570033,0.0005650067,0.969042,0.001694788,0.00008717721,0.0001190317,0.000883287,0.0004026293,0.0115058],"genre_scores_gemma":[0.7388822,0.003448548,0.2087046,0.0009254043,0.0005195595,0.001506658,0.002691879,0.0005044984,0.04281652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01419705,"threshold_uncertainty_score":0.03866786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153349054","doi":"10.1098/rsif.2008.0524","title":"Spread of infectious disease through clustered populations","year":2009,"lang":"en","type":"article","venue":"Journal of The Royal Society Interface","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":190,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"BC Centre for Disease Control; University of British Columbia","funders":"","keywords":"Closeness; Cluster analysis; Transmissibility (structural dynamics); Econometrics; Statistics; Population; Infectious disease (medical specialty); Mathematics; Computer science; Disease; Demography; Medicine; Physics","authors":[{"name":"Joel C. Miller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01627671940694296,"gpt":0.2981393177117541,"spread":0.2818625983048111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00142674,0.0004265037,0.0006246796,0.001705885,0.0006468367,0.001433333,0.001071594,0.001056444,0.001752702],"category_scores_gemma":[0.01177839,0.0004638826,0.0006985741,0.0009846813,0.00130302,0.002519934,0.001173623,0.0008132813,0.0002724997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189195,"about_ca_system_score_gemma":0.0008323673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003638906,"about_ca_topic_score_gemma":0.002133487,"domain_scores_codex":[0.99901,0.0005324814,0.00003282377,0.0002050695,0.0001618284,0.00005768491],"domain_scores_gemma":[0.9959024,0.002397326,0.0008335422,0.0004254435,0.0003297784,0.0001115304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007378438,0.0000894574,0.01567618,0.0002465568,0.0002561604,0.000299873,0.0006063677,0.638756,0.00365482,0.3029779,0.001454283,0.03590863],"study_design_scores_gemma":[0.00003490178,0.00006370922,0.005979961,0.00006126341,0.00005519513,0.0001811165,0.0002181811,0.7217625,0.0008158244,0.2688245,0.001965993,0.00003685691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3036079,0.001362302,0.6828317,0.001540333,0.00007667894,0.0001411478,0.0001908165,0.0002879617,0.009961126],"genre_scores_gemma":[0.9378489,0.001575196,0.05778463,0.0002027959,0.00008115459,0.0001463626,0.0001036025,0.00003707493,0.002220406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003638906,"threshold_uncertainty_score":0.008628309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056465001","doi":"10.1007/s11116-009-9227-7","title":"Characterizing metro networks: state, form, and structure","year":2009,"lang":"en","type":"article","venue":"Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":180,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Transport engineering; Key (lock); Network structure; State (computer science); Network planning and design; Network analysis; Graph; Transportation planning; Complex network; Operations research; Land use; Feature (linguistics); Transit (satellite); Public transport; Engineering; Distributed computing; Telecommunications; Civil engineering; Theoretical computer science","authors":[{"name":"Sybil Derrible","is_ca":true},{"name":"Christopher Kennedy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005080035300856293,"gpt":0.228887390308981,"spread":0.2238073550081247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001285276,0.0006267229,0.0005862332,0.001796676,0.0006254432,0.002100708,0.001057835,0.000986927,0.001242462],"category_scores_gemma":[0.01498678,0.0005201954,0.0004672385,0.00228879,0.001129546,0.004856422,0.0008886441,0.0009265892,0.0001821301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00135512,"about_ca_system_score_gemma":0.0007212432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005737924,"about_ca_topic_score_gemma":0.006976436,"domain_scores_codex":[0.9993729,0.0002388397,0.00003010774,0.0001762157,0.0001327481,0.00004916338],"domain_scores_gemma":[0.9922368,0.004531527,0.001596323,0.0007884063,0.0006577704,0.0001891873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00009104193,0.00007707443,0.02721951,0.0001267146,0.00008518679,0.00007931019,0.0002855786,0.736567,0.003241294,0.1741483,0.001555854,0.0565231],"study_design_scores_gemma":[0.000003820683,0.00001346609,0.002979417,0.0000135712,0.00001394753,0.00005398801,0.00009505636,0.91968,0.0006735828,0.07572174,0.0007411679,0.00001032772],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1825905,0.0003741515,0.8125938,0.000671449,0.00001696732,0.00006105933,0.000831194,0.0001618531,0.002698985],"genre_scores_gemma":[0.9519848,0.0005615806,0.04520356,0.00003752652,0.00006197068,0.00007621449,0.0005773677,0.00004064695,0.00145637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005737924,"threshold_uncertainty_score":0.01140904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102920490","doi":"10.1145/2124295.2124368","title":"Maximizing product adoption in social networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":169,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Product (mathematics); Set (abstract data type); Computer science; Opinion leadership; Viral marketing; Social network (sociolinguistics); New product development; Key (lock); Work (physics); Maximization; Marketing; Business; Advertising; World Wide Web; Psychology; Social psychology; Social media; Public relations; Engineering; Mathematics; Computer security; Political science","authors":[{"name":"Smriti Bhagat","is_ca":true},{"name":"Amit Goyal","is_ca":true},{"name":"Laks V. S. Lakshmanan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02053242328576662,"gpt":0.2761302357370934,"spread":0.2555978124513268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004017757,0.001635477,0.00193856,0.002007457,0.0008852594,0.002191331,0.001626353,0.002077334,0.003321121],"category_scores_gemma":[0.02241027,0.0009124842,0.0007724668,0.002844435,0.001178647,0.00613192,0.00204277,0.000894438,0.000776158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00141092,"about_ca_system_score_gemma":0.0007945221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001246837,"about_ca_topic_score_gemma":0.001476476,"domain_scores_codex":[0.9967069,0.001723235,0.0001235901,0.0007015637,0.0004977124,0.0002470136],"domain_scores_gemma":[0.987336,0.009899382,0.0011295,0.0006136014,0.00067425,0.0003473118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007701921,0.0007588891,0.02143279,0.001812468,0.0006182394,0.0006898225,0.001406627,0.5604888,0.01134812,0.1719766,0.005618633,0.2230789],"study_design_scores_gemma":[0.00008290808,0.0004720813,0.005900411,0.0001017829,0.0002076589,0.0004044328,0.0003934162,0.8162157,0.002532814,0.1672415,0.006394527,0.00005273745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3923675,0.003428487,0.5699922,0.001984743,0.00007606272,0.0006355203,0.0003840663,0.0003859297,0.03074543],"genre_scores_gemma":[0.945686,0.001367168,0.04853081,0.000108688,0.00008642067,0.0002872646,0.0001323495,0.0000673671,0.0037339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004017757,"threshold_uncertainty_score":0.02124816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034008825","doi":"10.1287/mnsc.1060.0623","title":"Membership Herding and Network Stability in the Open Source Community: The Ising Perspective","year":2007,"lang":"en","type":"article","venue":"Management Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":164,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"RIKEN; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Herding; Herd behavior; Perspective (graphical); Stability (learning theory); Reciprocal; Computer science; Ising model; Empirical research; Econometrics; Statistical physics; Mathematics; Physics; Statistics; Geography; Artificial intelligence; Machine learning","authors":[{"name":"Wonseok Oh","is_ca":true},{"name":"Sangyong Jeon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04837375157801684,"gpt":0.3359819119875804,"spread":0.2876081604095636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001863699,0.000206967,0.0005539176,0.001938144,0.001444624,0.002162959,0.0007864389,0.001452899,0.002043969],"category_scores_gemma":[0.01222135,0.0002427607,0.0004735737,0.001138781,0.0034846,0.004405083,0.001346626,0.0008957429,0.0001364214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001903187,"about_ca_system_score_gemma":0.0007130373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005769829,"about_ca_topic_score_gemma":0.003646886,"domain_scores_codex":[0.9994216,0.0002049503,0.00002441501,0.0001311566,0.0001166456,0.000101209],"domain_scores_gemma":[0.9929373,0.004389213,0.001403771,0.000481332,0.0003174515,0.0004709839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001285212,0.0001087593,0.03269478,0.0001449364,0.0001273623,0.0005819941,0.002717169,0.1355241,0.003573392,0.7982256,0.00136856,0.02480481],"study_design_scores_gemma":[0.00003131024,0.00006492461,0.01524464,0.00003400358,0.00005554986,0.0002432642,0.0007984097,0.3708587,0.0005144379,0.6107695,0.001339446,0.00004574295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8725004,0.0009326438,0.1062663,0.003084403,0.00003836741,0.00003452331,0.00009257438,0.0001123201,0.01693833],"genre_scores_gemma":[0.9968306,0.0001869032,0.002504179,0.00004093173,0.00002459733,0.000009016248,0.00001134388,0.000004815654,0.000387517],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005769829,"threshold_uncertainty_score":0.01380867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981377410","doi":"10.1145/2020408.2020492","title":"Sparsification of influence networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":152,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Kempe Foundation","keywords":"Computer science; Cascade; Theoretical computer science; Graph; Algorithm; Artificial intelligence","authors":[{"name":"Michael Mathioudakis","is_ca":true},{"name":"Francesco Bonchi","is_ca":false},{"name":"Carlos Castillo","is_ca":false},{"name":"Aristides Gionis","is_ca":false},{"name":"Antti Ukkonen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0232945155324907,"gpt":0.2336198565520808,"spread":0.2103253410195901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001104246,0.001073156,0.001296107,0.002407714,0.000879794,0.001836744,0.001961479,0.001192149,0.004766255],"category_scores_gemma":[0.01204347,0.0007919748,0.001459668,0.001640153,0.001292091,0.003434456,0.002839049,0.002201534,0.001199858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022246,"about_ca_system_score_gemma":0.001072382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004217858,"about_ca_topic_score_gemma":0.006441642,"domain_scores_codex":[0.9988531,0.0003369576,0.00005706771,0.0002865635,0.0003554219,0.0001108651],"domain_scores_gemma":[0.9952808,0.002709521,0.0003983002,0.001079254,0.0003696213,0.0001625638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000284654,0.00009751975,0.003627126,0.0003144926,0.0001557875,0.0003882227,0.0004360753,0.599966,0.005086462,0.1703894,0.01241936,0.2068349],"study_design_scores_gemma":[0.00001497141,0.00001271397,0.0002339752,0.00001560148,0.00001223222,0.00007795882,0.0000325154,0.908868,0.001133261,0.08719742,0.002393854,0.000007528532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02235778,0.0002922389,0.971692,0.0003285487,0.00004115018,0.0001024224,0.0005579706,0.0009931768,0.003634703],"genre_scores_gemma":[0.4730444,0.0007896838,0.5141113,0.0002867655,0.0002868554,0.0004631615,0.003967752,0.0005875746,0.006462436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004766255,"threshold_uncertainty_score":0.01594472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121020155","doi":"10.1109/asonam.2009.14","title":"Local Community Identification in Social Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":152,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Collegiate Athletic Association","keywords":"Computer science; Community structure; Identification (biology); Hierarchy; Data mining; Data science; Outlier; Complex network; Graph; Local community; Machine learning; Theoretical computer science; Artificial intelligence; World Wide Web; Mathematics","authors":[{"name":"Osmar R. Zai͏̈ane","is_ca":true},{"name":"Randy Goebel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01709537810502288,"gpt":0.2942611460251368,"spread":0.2771657679201139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002075789,0.0007332115,0.0009288052,0.00666571,0.001344994,0.001409546,0.001354708,0.001297246,0.001548574],"category_scores_gemma":[0.01149153,0.0004879704,0.000641241,0.003628414,0.001499119,0.003469022,0.002199744,0.000998606,0.0006246128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009608201,"about_ca_system_score_gemma":0.0007115243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002534918,"about_ca_topic_score_gemma":0.003296053,"domain_scores_codex":[0.9976451,0.000899381,0.00008024187,0.000587208,0.0006167041,0.0001712924],"domain_scores_gemma":[0.9933161,0.003429451,0.001232116,0.0007439255,0.0009249275,0.0003535758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000311598,0.0002565921,0.02730882,0.0008569331,0.0003504892,0.0005252131,0.001321571,0.3204353,0.01961651,0.1050157,0.008020256,0.5159811],"study_design_scores_gemma":[0.00002539891,0.00006556768,0.004896926,0.00005703311,0.00004675586,0.0003198259,0.0003556942,0.9000576,0.00523935,0.08549226,0.003392032,0.00005158195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05290132,0.0007697713,0.9430749,0.0001848565,0.0000213448,0.0001361343,0.0001682735,0.0005764996,0.00216689],"genre_scores_gemma":[0.6561687,0.000585376,0.3396626,0.00009084336,0.00009437074,0.0002403516,0.0006329499,0.0001748925,0.002349908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00666571,"threshold_uncertainty_score":0.01097798,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978323161","doi":"10.1103/physreve.84.026105","title":"Modeling the dynamical interaction between epidemics on overlay networks","year":2011,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":150,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Canadian Institutes of Health Research","keywords":"Formalism (music); Computer science; Overlay; Overlay network; Population; Distributed computing; Context (archaeology); Set (abstract data type); Theoretical computer science; Biology; The Internet","authors":[{"name":"Vincent Marceau","is_ca":true},{"name":"Pierre‐André Noël","is_ca":true},{"name":"Laurent Hébert‐Dufresne","is_ca":true},{"name":"Antoine Allard","is_ca":true},{"name":"Louis J. Dubé","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06144235142182627,"gpt":0.3488192019550446,"spread":0.2873768505332183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009439686,0.0006758725,0.0006314288,0.0009550237,0.0006992429,0.001520209,0.001039718,0.001615347,0.001434321],"category_scores_gemma":[0.004998211,0.0005190871,0.000616032,0.0007460904,0.001196537,0.002440259,0.001657183,0.0008875749,0.0002108637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001222495,"about_ca_system_score_gemma":0.0007906726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008559208,"about_ca_topic_score_gemma":0.004698321,"domain_scores_codex":[0.9994318,0.0002503568,0.00002854675,0.00009343308,0.0001036306,0.00009219215],"domain_scores_gemma":[0.99821,0.001204379,0.0002588218,0.00008978128,0.0001221289,0.0001149491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001844583,0.00002526106,0.001052516,0.00002962273,0.00002685799,0.000189634,0.0001469052,0.9282357,0.0009748781,0.06598674,0.0004097821,0.002903691],"study_design_scores_gemma":[0.000004764834,0.000006917509,0.0001395014,0.000003256531,0.000004858774,0.00001461717,0.00002289859,0.9841865,0.00005109243,0.01517224,0.0003887835,0.0000046622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2726078,0.0009013477,0.7094614,0.001230634,0.0001100731,0.0001292772,0.000289977,0.0002795181,0.01498993],"genre_scores_gemma":[0.9621192,0.0008984092,0.03124454,0.00007127245,0.00008769764,0.0001617273,0.0001101238,0.0000449526,0.005261972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008559208,"threshold_uncertainty_score":0.01701874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2895935703","doi":"10.1177/1558689818804060","title":"Social Network Analysis: An Example of Fusion Between Quantitative and Qualitative Methods","year":2018,"lang":"en","type":"article","venue":"Journal of Mixed Methods Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":149,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Michael's Hospital; Public Health Ontario; University of Toronto","funders":"","keywords":"Centrality; Computer science; Social network analysis; Visualization; Quantitative analysis (chemistry); Data science; Subjectivity; Qualitative analysis; Qualitative property; Selection (genetic algorithm); Qualitative research; Data visualization; Social network (sociolinguistics); Data mining; Artificial intelligence; Machine learning; Sociology; Epistemology; Mathematics; Social science; Statistics; World Wide Web; Social media","authors":[{"name":"Reza Yousefi Nooraie","is_ca":true},{"name":"Joanna E. M. Sale","is_ca":true},{"name":"Alexandra Marin","is_ca":true},{"name":"Lori E. Ross","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4537575266037598,"gpt":0.6426087668313554,"spread":0.1888512402275956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.1025731,0.00175941,0.002209967,0.01741291,0.00423252,0.0164679,0.003030888,0.003671874,0.005824566],"category_scores_gemma":[0.1026871,0.001174824,0.001838174,0.01388338,0.02033485,0.0188127,0.01325232,0.006221144,0.001085792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00521665,"about_ca_system_score_gemma":0.005969945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001858461,"about_ca_topic_score_gemma":0.002135298,"domain_scores_codex":[0.8973104,0.08201764,0.003532151,0.004552958,0.01180315,0.0007836499],"domain_scores_gemma":[0.7994167,0.1697525,0.004362969,0.01509341,0.009853183,0.001521212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006964209,0.00008046751,0.001484536,0.001307116,0.0001787262,0.000324187,0.02204836,0.001633856,0.001064899,0.895604,0.00486776,0.07133643],"study_design_scores_gemma":[0.00002367419,0.00006092987,0.000926497,0.001466277,0.00005453703,0.0002892174,0.005779151,0.007706964,0.0009356677,0.8961291,0.08652844,0.00009967518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005291335,0.005622333,0.9441993,0.01374967,0.0006240192,0.0004484445,0.0003465747,0.0004083659,0.02931006],"genre_scores_gemma":[0.1330539,0.004742751,0.8534935,0.002870639,0.0004736951,0.001457852,0.0002636539,0.0005472921,0.003096856],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1025731,"threshold_uncertainty_score":0.542465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070199170","doi":"10.1007/s13278-012-0062-z","title":"On minimizing budget and time in influence propagation over social networks","year":2012,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":147,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Viral marketing; Maximization; Task (project management); Set (abstract data type); Computer science; Budget constraint; Context (archaeology); Mathematical optimization; Selection (genetic algorithm); Mathematics; Artificial intelligence; Economics; Social media","authors":[{"name":"Amit Goyal","is_ca":true},{"name":"Francesco Bonchi","is_ca":false},{"name":"Laks V. S. Lakshmanan","is_ca":true},{"name":"Suresh Venkatasubramanian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006771410045472699,"gpt":0.2553418218687794,"spread":0.2485704118233067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00888128,0.003173009,0.004045143,0.00251528,0.001605999,0.002711965,0.004484131,0.003276102,0.00443726],"category_scores_gemma":[0.05224122,0.002251707,0.00161318,0.003875354,0.002843285,0.009074179,0.003754873,0.002746219,0.0006889818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002971657,"about_ca_system_score_gemma":0.003105487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01066362,"about_ca_topic_score_gemma":0.012432,"domain_scores_codex":[0.9950375,0.002672481,0.0002305703,0.0006825281,0.0008833842,0.0004935034],"domain_scores_gemma":[0.9382812,0.05317807,0.002480492,0.002901643,0.001664484,0.001494083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005634773,0.0002548936,0.002259524,0.0002916504,0.0001756271,0.0001046816,0.0004119737,0.8587077,0.001681293,0.05239239,0.004779169,0.07837772],"study_design_scores_gemma":[0.00004119558,0.00005437786,0.0001914667,0.00001999635,0.00003448967,0.00002574605,0.00003881011,0.9654822,0.0003658866,0.03321659,0.0005213773,0.000007898448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05331512,0.0008237883,0.9402825,0.001508125,0.00009573493,0.0002277404,0.0003593628,0.0005340414,0.002853622],"genre_scores_gemma":[0.5267239,0.001448622,0.4558819,0.0004387515,0.0004761624,0.0008889457,0.0008597083,0.001216043,0.01206612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01066362,"threshold_uncertainty_score":0.04696929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1700368447","doi":"10.25300/misq/2014/38.3.08","title":"Emergence of Power Laws in Online Communities: The Role Of Social Mechanisms and Preferential Attachment1","year":2014,"lang":"en","type":"article","venue":"MIS Quarterly","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":142,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Popularity; Preferential attachment; Power (physics); Online participation; Action (physics); Internet privacy; Online community; Political science; The Internet; Computer science; World Wide Web; Law; Complex network","authors":[{"name":"Steven L. Johnson","is_ca":false},{"name":"Samer Faraj","is_ca":true},{"name":"Srinivas Kudaravalli","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007366537962974608,"gpt":0.2519133967675395,"spread":0.2445468588045649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00537932,0.0003451514,0.0006054759,0.001811011,0.001261439,0.00232524,0.001342001,0.001067036,0.00262301],"category_scores_gemma":[0.03948117,0.0005438837,0.0008354895,0.001092303,0.004077532,0.004978829,0.001570422,0.001231657,0.0003033645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001590049,"about_ca_system_score_gemma":0.0007359746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002866684,"about_ca_topic_score_gemma":0.002290826,"domain_scores_codex":[0.9979797,0.001166079,0.00006690514,0.0003092063,0.0003039815,0.0001741978],"domain_scores_gemma":[0.9568337,0.03134625,0.005299024,0.003481931,0.001740167,0.001298937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002916516,0.0004423339,0.1504524,0.0003804903,0.0002242229,0.001425685,0.008820621,0.1250726,0.006322219,0.6240667,0.003265181,0.07923596],"study_design_scores_gemma":[0.0001059885,0.0002482264,0.04619588,0.000109069,0.00005840555,0.0006245805,0.001932282,0.4186234,0.001805169,0.5270231,0.003175064,0.0000988074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8672202,0.0005003528,0.1203521,0.001144987,0.00002787867,0.0001602631,0.0001072546,0.0001596836,0.01032724],"genre_scores_gemma":[0.9934097,0.0001047528,0.005901548,0.00004258891,0.00001008645,0.00005501647,0.00002890099,0.0000134932,0.0004339349],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00537932,"threshold_uncertainty_score":0.02844888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W67958692","doi":"10.1137/1.9781611972795.51","title":"Mining Cohesive Patterns from Graphs with Feature Vectors","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Correctness; Computer science; Subspace topology; Feature (linguistics); Theoretical computer science; Graph; Data mining; Exploit; Pruning; Feature vector; Pattern recognition (psychology); Artificial intelligence; Algorithm","authors":[{"name":"Flavia Moser","is_ca":true},{"name":"Recep Çolak","is_ca":true},{"name":"Arash Rafiey","is_ca":true},{"name":"Martin Ester","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006170156430280193,"gpt":0.2255315939781663,"spread":0.2193614375478861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009127372,0.0009731603,0.00106558,0.005343813,0.0007100296,0.001149723,0.001284071,0.00100259,0.001294066],"category_scores_gemma":[0.009075912,0.0005325137,0.0008893941,0.00442413,0.0006631975,0.002427548,0.001330007,0.0008568031,0.0005521912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003320267,"about_ca_system_score_gemma":0.0005792726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001743386,"about_ca_topic_score_gemma":0.003005606,"domain_scores_codex":[0.9988814,0.0002572619,0.0001100647,0.0003348298,0.0003093527,0.0001070991],"domain_scores_gemma":[0.9948219,0.003080424,0.0008312193,0.0006713094,0.0004826893,0.0001124564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003980864,0.0004038416,0.03869096,0.0009053733,0.0004998883,0.001595521,0.0009756073,0.1259801,0.02731458,0.02915715,0.008827197,0.7652516],"study_design_scores_gemma":[0.00005198926,0.0001426459,0.006772555,0.00007241927,0.0001150217,0.001169226,0.0006489165,0.8436383,0.01010347,0.1317283,0.005520263,0.00003689584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1291242,0.0004748352,0.8660503,0.0003070357,0.00002259022,0.0001792854,0.001113235,0.001656872,0.00107172],"genre_scores_gemma":[0.4461059,0.0003791422,0.5475803,0.0001107856,0.00003527344,0.0002667137,0.004310249,0.0001469886,0.001064591],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005343813,"threshold_uncertainty_score":0.004827082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041835352","doi":"10.1145/945721.945722","title":"Analysis of SIGMOD's co-authorship graph","year":2003,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Information retrieval; Theoretical computer science","authors":[{"name":"Mário A. Nascimento","is_ca":true},{"name":"Jörg Sander","is_ca":true},{"name":"Jeffrey Pound","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02584356087544954,"gpt":0.3026211155237821,"spread":0.2767775546483325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.002113467,0.000571646,0.0006432474,0.009685114,0.001810418,0.001953223,0.0009709871,0.0009335745,0.004314727],"category_scores_gemma":[0.01867962,0.000224343,0.0006439412,0.01193456,0.001051358,0.003575298,0.001236188,0.0008768305,0.0008257424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001854217,"about_ca_system_score_gemma":0.001011814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004146787,"about_ca_topic_score_gemma":0.003192792,"domain_scores_codex":[0.9974854,0.0005803896,0.00009801961,0.000353078,0.001202085,0.000281133],"domain_scores_gemma":[0.9876963,0.006999244,0.001339321,0.001351241,0.002032941,0.0005808551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0003933238,0.0003944643,0.05511972,0.0006199637,0.0004199161,0.0009561885,0.001643345,0.1149005,0.003981041,0.4933062,0.05902479,0.2692406],"study_design_scores_gemma":[0.00005285068,0.00008966315,0.02762748,0.000116113,0.0001319556,0.001062921,0.0009004821,0.4817961,0.004955302,0.4254534,0.05774006,0.00007377459],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5664118,0.00672678,0.3609331,0.006836903,0.0004600033,0.0003268403,0.01585864,0.001945383,0.04050052],"genre_scores_gemma":[0.9232594,0.001840327,0.05960416,0.000265343,0.0002130341,0.0002011739,0.007917189,0.0002290218,0.00647014],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9903149,"threshold_uncertainty_score":0.01443416,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3184867432","doi":"10.1038/s41467-021-24704-6","title":"Topological measures for identifying and predicting the spread of complex contagions","year":2021,"lang":"en","type":"article","venue":"Nature Communications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":135,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; National Institutes of Health; Robert Wood Johnson Foundation","keywords":"Centrality; Social connectedness; Complex network; Computer science; Path (computing); Path length; Average path length; Betweenness centrality; Shortest path problem; Measure (data warehouse); Node (physics); Network science; Network theory; Theoretical computer science; Social network (sociolinguistics); Topology (electrical circuits); Data science; Mathematics; Data mining; Social media; Computer network; Psychology; Graph; World Wide Web; Statistics; Social psychology; Physics; Combinatorics","authors":[{"name":"Douglas Guilbeault","is_ca":false},{"name":"Damon Centola","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08536638279729919,"gpt":0.3784697302525729,"spread":0.2931033474552737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001612682,0.0006495378,0.0003532565,0.009460049,0.0005130556,0.001310146,0.0006182963,0.0008144838,0.001428606],"category_scores_gemma":[0.01911037,0.0002078601,0.0004680453,0.004934413,0.0008605853,0.002776147,0.0008350222,0.0007867185,0.0002646314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008723272,"about_ca_system_score_gemma":0.0004482508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002682511,"about_ca_topic_score_gemma":0.003093319,"domain_scores_codex":[0.9993556,0.000286067,0.00005538283,0.00009094689,0.0001601284,0.00005181918],"domain_scores_gemma":[0.9858395,0.009096636,0.002885329,0.0008720972,0.0009623382,0.0003440094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001716784,0.0002111074,0.3585409,0.0004153268,0.0004484216,0.0003491375,0.0007604604,0.4166577,0.004702828,0.07285968,0.003029722,0.1418531],"study_design_scores_gemma":[0.0000158454,0.0001135513,0.08346318,0.00007770575,0.0000992947,0.0003454353,0.0007101303,0.8557765,0.001548534,0.05600016,0.00178364,0.00006589646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5935963,0.001318067,0.3952442,0.0006196946,0.00005527799,0.0001990238,0.001722047,0.00049793,0.006747435],"genre_scores_gemma":[0.9629236,0.0003141095,0.03591524,0.00001613521,0.00003082781,0.00006913554,0.0004783151,0.00001485796,0.0002376785],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009460049,"threshold_uncertainty_score":0.008528769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998753427","doi":"10.1016/j.knosys.2013.01.005","title":"An improved mix framework for opinion leader identification in online learning communities","year":2013,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":133,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Novelty; Opinion leadership; Centrality; Identification (biology); Prestige; Social media; Influencer marketing; Social network (sociolinguistics); Computer science; Sentiment analysis; Knowledge management; Public relations; Data science; Psychology; Social psychology; Political science; Marketing; World Wide Web; Artificial intelligence; Business","authors":[{"name":"Yanyan Li","is_ca":false},{"name":"Shaoqian Ma","is_ca":false},{"name":"Ronghuai Huang","is_ca":false},{"name":"Kinshuk Kinshuk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03524039814181307,"gpt":0.3298643976566982,"spread":0.2946239995148851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003774793,0.0009127294,0.001674879,0.003285187,0.001277818,0.002482982,0.002705017,0.001754028,0.004959082],"category_scores_gemma":[0.01066926,0.0006961816,0.001030455,0.002260192,0.0007386922,0.005231831,0.003827186,0.001703287,0.001571604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009575343,"about_ca_system_score_gemma":0.001200767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003073476,"about_ca_topic_score_gemma":0.005365103,"domain_scores_codex":[0.9977747,0.0007745257,0.0001069892,0.0004330117,0.0007364172,0.0001744969],"domain_scores_gemma":[0.9949952,0.002717704,0.000377124,0.0005339655,0.001036703,0.0003392904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008132187,0.0005784413,0.008907473,0.0004267979,0.0005249736,0.0003164861,0.0007741309,0.3249658,0.01101179,0.1633677,0.01018146,0.4781317],"study_design_scores_gemma":[0.000009496736,0.00002125575,0.0002083733,0.000006022359,0.00001318547,0.00001644356,0.00002824763,0.9796951,0.0005035031,0.01878252,0.0007071837,0.000008626352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008739302,0.0001258392,0.9895465,0.000101775,0.00002510778,0.00006683204,0.0001697066,0.000388273,0.0008365592],"genre_scores_gemma":[0.3723556,0.0002399504,0.6178285,0.0001715082,0.0002314762,0.0005547574,0.0009054512,0.0002571893,0.007455427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004959082,"threshold_uncertainty_score":0.01996326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2619906413","doi":"10.14778/3099622.3099623","title":"Revisiting the stop-and-stare algorithms for influence maximization","year":2017,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India","keywords":"Maximization; Scalability; Computer science; Set (abstract data type); Scaling; Order (exchange); Approximation algorithm; Mathematical optimization; Algorithm; Mathematics; Economics","authors":[{"name":"Keke Huang","is_ca":false},{"name":"Sibo Wang","is_ca":false},{"name":"Glenn S. Bevilacqua","is_ca":true},{"name":"Xiaokui Xiao","is_ca":false},{"name":"Laks V. S. Lakshmanan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0194310404711445,"gpt":0.2842343860065044,"spread":0.2648033455353598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006935547,0.001851465,0.0024056,0.002099448,0.001507636,0.003103946,0.002737874,0.002208945,0.005249097],"category_scores_gemma":[0.03871835,0.0008947405,0.002217995,0.002561452,0.002486167,0.006410138,0.003535455,0.004086678,0.002220964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001942327,"about_ca_system_score_gemma":0.0030999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004252749,"about_ca_topic_score_gemma":0.00765274,"domain_scores_codex":[0.9953805,0.002116367,0.0002348956,0.0008689222,0.001044184,0.0003551218],"domain_scores_gemma":[0.9713637,0.02077942,0.0008785013,0.004399718,0.001924522,0.0006540426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004800928,0.0003362755,0.004663488,0.0005103163,0.0002441548,0.000170912,0.0006191935,0.4953064,0.004063027,0.1714075,0.01998568,0.3022128],"study_design_scores_gemma":[0.00003517349,0.00007071879,0.0002226632,0.00003281846,0.00002397126,0.0000773233,0.00004656501,0.9153221,0.001110506,0.07859246,0.004452045,0.0000136351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0112829,0.0008377076,0.9790261,0.001212959,0.0001472214,0.0001227756,0.0002169809,0.001057008,0.006096295],"genre_scores_gemma":[0.3302193,0.001187344,0.659142,0.001111098,0.0006295267,0.0003410921,0.0008054327,0.000831301,0.005732923],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006935547,"threshold_uncertainty_score":0.03667915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159176819","doi":"10.1609/aaai.v26i1.8204","title":"Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":131,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Maximization; Heuristics; Computer science; Mathematical optimization; Greedy algorithm; Heuristic; Constraint (computer-aided design); Set (abstract data type); Process (computing); Algorithm; Mathematics; Artificial intelligence","authors":[{"name":"Wei Chen","is_ca":false},{"name":"Wei Lu","is_ca":true},{"name":"Ning Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02270244581810292,"gpt":0.2931075849506718,"spread":0.2704051391325689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002025636,0.001132279,0.001237921,0.001255605,0.0008715027,0.001569485,0.001587324,0.001277176,0.001661057],"category_scores_gemma":[0.007894456,0.0007356948,0.000919141,0.001591762,0.001590191,0.002471997,0.001289344,0.001186164,0.0002277317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002245594,"about_ca_system_score_gemma":0.001360668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005033753,"about_ca_topic_score_gemma":0.004327615,"domain_scores_codex":[0.9988518,0.0003929347,0.00003902646,0.0002790086,0.000254477,0.0001827354],"domain_scores_gemma":[0.9950442,0.003782352,0.0004976459,0.0001501058,0.0002709297,0.0002548092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009513034,0.00005108132,0.0007943704,0.0001067195,0.00005002314,0.0001857263,0.0001596027,0.9180436,0.002628519,0.06348558,0.0007938967,0.01360574],"study_design_scores_gemma":[0.000016673,0.00002333644,0.0001604318,0.000005507924,0.00001474168,0.00003311939,0.00002835081,0.9663377,0.0009369227,0.03183616,0.0005999511,0.000007104966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06990179,0.0004039615,0.923525,0.0004398546,0.0000244619,0.0001012616,0.0001032628,0.0001789812,0.005321383],"genre_scores_gemma":[0.8782809,0.0007789738,0.1168173,0.0001144887,0.00008904219,0.0002063807,0.000147371,0.00008288286,0.003482794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005033753,"threshold_uncertainty_score":0.01629299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045387243","doi":"10.1103/physreve.82.046112","title":"Column generation algorithms for exact modularity maximization in networks","year":2010,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":130,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; HEC Montréal; Agence Nationale de la Recherche","keywords":"Modularity (biology); Column generation; Heuristics; Clique; Maximization; Column (typography); Mathematics; Linear programming; Computer science; Mathematical optimization; Integer programming; Algorithm; Clique problem; Combinatorics; Connection (principal bundle)","authors":[{"name":"Daniel Aloise","is_ca":false},{"name":"Sonia Cafieri","is_ca":false},{"name":"Gilles Caporossi","is_ca":true},{"name":"Pierre Hansen","is_ca":true},{"name":"Sylvain Perron","is_ca":true},{"name":"Leo Liberti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02811512758379235,"gpt":0.3356441094382786,"spread":0.3075289818544862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001283254,0.00139069,0.00115939,0.001462375,0.0007422309,0.001132495,0.001489307,0.001011836,0.006300635],"category_scores_gemma":[0.005299954,0.0007604234,0.0008565448,0.002382095,0.0009642077,0.001947629,0.001533778,0.001496414,0.001750608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001050956,"about_ca_system_score_gemma":0.001136003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002700601,"about_ca_topic_score_gemma":0.004299513,"domain_scores_codex":[0.9992176,0.0003430119,0.00003455815,0.0001288075,0.0001579872,0.0001180649],"domain_scores_gemma":[0.9964494,0.002553467,0.0002464392,0.0003455359,0.0003081207,0.0000970742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000157269,0.0001384835,0.0006927705,0.000217161,0.00005261524,0.00007764364,0.0001540638,0.725453,0.00296493,0.04848028,0.009319144,0.2122927],"study_design_scores_gemma":[0.0000307919,0.00002131083,0.00008016558,0.000009046977,0.00000891939,0.0000285777,0.0000155367,0.964609,0.0009183839,0.03326184,0.001008261,0.000008160863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007726994,0.0003029821,0.9888526,0.000145054,0.00002350924,0.00007071243,0.0001129706,0.0007072029,0.002057927],"genre_scores_gemma":[0.1519569,0.0005201171,0.8430786,0.0001661053,0.00009076052,0.0003723847,0.0007143802,0.0004427662,0.00265799],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006300635,"threshold_uncertainty_score":0.02107769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046360729","doi":"10.1214/14-aos1208","title":"Community detection in dense random networks","year":2014,"lang":"en","type":"article","venue":"The Annals of Statistics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":129,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Office of Naval Research; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Bounded function; Graph; Random graph; Discrete mathematics; Clique; Upper and lower bounds; Induced subgraph isomorphism problem; Induced subgraph; Time complexity; Line graph; Voltage graph; Vertex (graph theory)","authors":[{"name":"Ery Arias-Castro","is_ca":true},{"name":"Nicolas Verzélen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04442482537466764,"gpt":0.3184144351284185,"spread":0.2739896097537509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006484056,0.0007822764,0.001420788,0.002643181,0.001176706,0.001811319,0.002678947,0.001989975,0.001351089],"category_scores_gemma":[0.05484283,0.0007659072,0.0007975705,0.001909531,0.003390352,0.005139097,0.003046272,0.001895703,0.0003294789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001698244,"about_ca_system_score_gemma":0.0008405609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002580151,"about_ca_topic_score_gemma":0.002148663,"domain_scores_codex":[0.994423,0.002717199,0.0001922858,0.001299048,0.000934413,0.0004341458],"domain_scores_gemma":[0.9289922,0.057445,0.006094465,0.003855814,0.002477467,0.001135033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005889455,0.0002090058,0.02361489,0.0006410147,0.0003087097,0.0008521611,0.0007685284,0.4926838,0.007520759,0.3856292,0.006753321,0.08042971],"study_design_scores_gemma":[0.0000392758,0.00004224179,0.001340806,0.00003000395,0.00001987934,0.0001732021,0.00006533472,0.7825974,0.001046539,0.213548,0.001078375,0.00001894086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1042836,0.0009026112,0.8895975,0.001455674,0.00006260185,0.0001208224,0.000393948,0.0004967788,0.00268639],"genre_scores_gemma":[0.8697509,0.0006622841,0.1264682,0.0004072144,0.0002392019,0.0002511892,0.0007748913,0.00007983869,0.001366334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006484056,"threshold_uncertainty_score":0.03429139,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}