{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":14,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":14,"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":"347a799fa0ef","filters":{"venue":"Network Science"}},"results":[{"id":"W3004293141","doi":"10.1017/nws.2020.45","title":"Artificial Benchmark for Community Detection (ABCD)—Fast random graph model with community structure","year":2021,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":46,"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":"","keywords":"Computer science; Community structure; Benchmark (surveying); Random graph; Scalability; Graph; Theoretical computer science; Artificial intelligence; Complex network; Degree distribution; Algorithm; Machine learning; Mathematics","authors":[{"name":"Bogumił Kamiński","is_ca":false},{"name":"Paweł Prałat","is_ca":true},{"name":"François Théberge","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02028907242691966,"gpt":0.2689334541712341,"spread":0.2486443817443144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002789437,0.0007118247,0.0008327164,0.00187328,0.0008384871,0.001001412,0.00193052,0.001968822,0.001751625],"category_scores_gemma":[0.01468115,0.0002720827,0.000877072,0.00149483,0.001005012,0.001614365,0.000920632,0.001388353,0.0003325041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001522293,"about_ca_system_score_gemma":0.0007623462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006416522,"about_ca_topic_score_gemma":0.005001914,"domain_scores_codex":[0.9981364,0.001017918,0.00004950552,0.0003749383,0.0002937919,0.0001274932],"domain_scores_gemma":[0.9885925,0.007489693,0.0007906193,0.001326749,0.001375223,0.0004252025],"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.0002663773,0.0002438006,0.005664933,0.0003320264,0.0001048659,0.0002582817,0.000105458,0.8955695,0.002348682,0.04972765,0.01532857,0.0300499],"study_design_scores_gemma":[0.00002658928,0.00003453582,0.0004215723,0.000009718367,0.000005848292,0.00006739505,0.00001667465,0.9827718,0.0006941153,0.01483809,0.001105106,0.000008563859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.4926221,0.002479591,0.4795149,0.004090793,0.000469943,0.0004201781,0.006156101,0.002418455,0.01182787],"genre_scores_gemma":[0.8600265,0.0003355716,0.1325459,0.0003964604,0.00007858099,0.0002414461,0.004339451,0.0001566037,0.001879461],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.006416522,"threshold_uncertainty_score":0.01475215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2984649464","doi":"10.1017/nws.2019.28","title":"The networked question in the digital era: How do networked, bounded, and limited individuals connect at different stages in the life course?","year":2019,"lang":"en","type":"article","venue":"Network Science","topic":"Impact of Technology on Adolescents","field":"Social Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Western University","funders":"","keywords":"Individualism; Digital media; Wonder; Social media; Bounded function; Internet privacy; Face (sociological concept); Set (abstract data type); Life course approach; Population; Psychology; Social psychology; Sociology; Computer science; World Wide Web; Political science; Mathematics; Demography; Social science","authors":[{"name":"Barry Wellman","is_ca":false},{"name":"Anabel Quan‐Haase","is_ca":true},{"name":"Molly-Gloria Harper","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.013209948970898,"gpt":0.2841630277614439,"spread":0.2709530787905459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004237362,0.0001634128,0.0003103547,0.001292683,0.003808827,0.004115443,0.0007533216,0.0008218278,0.002411853],"category_scores_gemma":[0.008460735,0.000202142,0.0001721574,0.001244687,0.007873529,0.005687024,0.003626688,0.001417482,0.0001432536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005932042,"about_ca_system_score_gemma":0.002726206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1232482,"about_ca_topic_score_gemma":0.1937677,"domain_scores_codex":[0.9980237,0.001166126,0.00005904878,0.0001843379,0.0001951899,0.0003715403],"domain_scores_gemma":[0.9950752,0.002208025,0.0008613007,0.0001426987,0.0005615457,0.001151245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"qualitative","study_design_scores_codex":[0.00002775868,0.00003594131,0.0886223,0.00004926989,0.000009120891,0.0001866679,0.9017672,0.0000405326,0.0001962373,0.003851502,0.0003796213,0.004833836],"study_design_scores_gemma":[0.000002675921,0.00001517046,0.04186989,0.0000665655,0.000004431176,0.00004926512,0.9535815,0.00005502193,0.00005387637,0.0006375569,0.003657236,0.000006786178],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9922394,0.0004233535,0.0002091166,0.001320899,0.00001375043,0.00002226165,0.0000453379,0.000001453947,0.005724486],"genre_scores_gemma":[0.9989406,0.0002208762,0.00008461355,0.0001533434,0.000003660058,0.00001565577,0.00001744182,0.000001500244,0.0005621846],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1232482,"threshold_uncertainty_score":0.2450616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3208496800","doi":"10.1017/nws.2021.18","title":"Measuring reciprocity: Double sampling, concordance, and network construction","year":2021,"lang":"en","type":"article","venue":"Network Science","topic":"Social Capital and Networks","field":"Social Sciences","cited_by":18,"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; Max-Planck-Institut für Evolutionäre Anthropologie; National Science Foundation","keywords":"Reciprocity (cultural anthropology); Concordance; Interpersonal ties; Social psychology; Exponential random graph models; Psychology; Computer science; Graph; Theoretical computer science; Random graph","authors":[{"name":"Elspeth Ready","is_ca":false},{"name":"Eleanor A. Power","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06435775719973422,"gpt":0.3085600578360818,"spread":0.2442023006363475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.1119614,0.0005607666,0.001390533,0.005468128,0.002270818,0.003972987,0.002870937,0.001488935,0.0009873501],"category_scores_gemma":[0.4022012,0.000812561,0.001081001,0.006534041,0.005546481,0.004406536,0.006658907,0.00222987,0.0001804368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002292701,"about_ca_system_score_gemma":0.001235295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003281305,"about_ca_topic_score_gemma":0.00352812,"domain_scores_codex":[0.7946937,0.1672773,0.008246368,0.01158532,0.01668604,0.001511232],"domain_scores_gemma":[0.4709094,0.3904875,0.0534539,0.06579963,0.01750776,0.001841906],"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.0004918737,0.0002683866,0.7975398,0.0008847495,0.001248597,0.000478547,0.02232539,0.01648899,0.002128486,0.05701572,0.001501915,0.09962755],"study_design_scores_gemma":[0.00009671729,0.0008344357,0.4709397,0.0007843697,0.0007165532,0.001868386,0.0131722,0.2431877,0.008534568,0.2502956,0.009276076,0.0002935963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6359627,0.0005565322,0.3548957,0.0008313503,0.000102567,0.0009147208,0.0005797722,0.0001518627,0.00600481],"genre_scores_gemma":[0.936901,0.00008501894,0.06183159,0.00007846644,0.00004433366,0.0004687957,0.0003304263,0.00002270364,0.0002377086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1119614,"threshold_uncertainty_score":0.5921155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3217035451","doi":"10.1017/nws.2022.27","title":"A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs","year":2022,"lang":"en","type":"article","venue":"Network Science","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":8,"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":"","keywords":"Embedding; Computer science; Scalability; Theoretical computer science; Graph embedding; Graph; Node (physics); Topological graph theory; Set (abstract data type); Representation (politics); Undirected graph; Artificial intelligence; Line graph; Voltage graph","authors":[{"name":"Bogumił Kamiński","is_ca":false},{"name":"Łukasz Kraiński","is_ca":false},{"name":"Paweł Prałat","is_ca":true},{"name":"François Théberge","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02806176680437631,"gpt":0.283082251646283,"spread":0.2550204848419066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004516106,0.001432788,0.001269771,0.007718673,0.000764221,0.002584514,0.002762681,0.001975305,0.001276074],"category_scores_gemma":[0.01409125,0.0005870389,0.001162827,0.003618289,0.001709514,0.003863712,0.003022302,0.001812151,0.0004062821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00166879,"about_ca_system_score_gemma":0.0009497775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002866654,"about_ca_topic_score_gemma":0.00546873,"domain_scores_codex":[0.9961655,0.00153468,0.0002374411,0.001094703,0.0007515275,0.0002161451],"domain_scores_gemma":[0.9931075,0.002714023,0.001206514,0.001035072,0.00158048,0.0003564736],"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.0006173609,0.0005033527,0.0123388,0.0003818319,0.0005695388,0.0002829428,0.0004059911,0.5079826,0.01724847,0.05096642,0.00645169,0.402251],"study_design_scores_gemma":[0.0000120059,0.00006859069,0.001092036,0.0000213027,0.00002246028,0.00006497779,0.00004528063,0.9733266,0.001887985,0.02263247,0.000802742,0.000023631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02485753,0.0002440122,0.9726707,0.0001166095,0.00003087662,0.0001000046,0.0002723025,0.0009384564,0.0007695165],"genre_scores_gemma":[0.4798542,0.0001740198,0.5160235,0.00013309,0.00008704363,0.0002986256,0.001719969,0.0003695607,0.001340008],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007718673,"threshold_uncertainty_score":0.02388376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2516965256","doi":"10.1017/nws.2016.13","title":"Evolution through bursts: Network structure develops through localized bursts in time and space","year":2016,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"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":"Assortativity; Homophily; Network formation; Network dynamics; Computer science; Preferential attachment; Network model; Dynamic network analysis; Kuramoto model; Cluster analysis; Statistical physics; Complex network; Physics; Computer network; Mathematics; Artificial intelligence; Synchronization (alternating current)","authors":[{"name":"Hilla Brot","is_ca":true},{"name":"Lev Muchnik","is_ca":false},{"name":"Jacob Goldenberg","is_ca":false},{"name":"Yoram Louzoun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008107822286294569,"gpt":0.2518100767904448,"spread":0.2437022545041503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001423134,0.0003385126,0.0004792826,0.001708298,0.0005176612,0.002017232,0.000871675,0.0009384767,0.001737318],"category_scores_gemma":[0.01188015,0.000501906,0.0004870545,0.001477768,0.001634312,0.005019497,0.001347654,0.001014524,0.0003103619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001162949,"about_ca_system_score_gemma":0.0003651938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002371361,"about_ca_topic_score_gemma":0.001720831,"domain_scores_codex":[0.9992725,0.0002120125,0.00003881021,0.0002803796,0.000120508,0.00007565452],"domain_scores_gemma":[0.9932535,0.003801981,0.001568547,0.0007691354,0.0003208301,0.0002859851],"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.0002943772,0.0001592628,0.1337534,0.0004434492,0.0002980299,0.00128193,0.006791136,0.3412206,0.01980393,0.3985053,0.003735339,0.09371316],"study_design_scores_gemma":[0.00002410769,0.0000983566,0.04362388,0.00008473534,0.00007162792,0.0005721998,0.001159247,0.6537396,0.002298459,0.2929187,0.005340831,0.00006817838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6135176,0.000942113,0.3770164,0.001116947,0.00004550787,0.00009411723,0.0005208646,0.0005327966,0.006213754],"genre_scores_gemma":[0.9813192,0.0005049767,0.01617743,0.00008407589,0.00003890989,0.00008889879,0.0001835259,0.00005238095,0.001550611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002371361,"threshold_uncertainty_score":0.008437812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3157446178","doi":"10.1017/nws.2021.4","title":"A fused mixed-methods approach to thematic analysis of personal networks: Two case studies of caregiver support networks","year":2021,"lang":"en","type":"article","venue":"Network Science","topic":"Community Health and Development","field":"Health Professions","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Trillium Health Centre","funders":"University of Rochester","keywords":"Computer science; Thematic analysis; Typology; Cluster analysis; Coding (social sciences); Artificial intelligence; Data science; Qualitative research; Human–computer interaction; Mathematics; Sociology","authors":[{"name":"Reza Yousefi‐Nooraie","is_ca":false},{"name":"Bronwyn Lennox Thompson","is_ca":true},{"name":"Chelsea D’Silva","is_ca":true},{"name":"Ian Zenlea","is_ca":true},{"name":"Maryam Tabatabaee","is_ca":false},{"name":"Ardavan Mohammad Aghaei","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1314831185448136,"gpt":0.515090289661629,"spread":0.3836071711168153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02913732,0.000661473,0.0006107756,0.004790225,0.01186251,0.004643016,0.002951027,0.002572029,0.002583166],"category_scores_gemma":[0.03101923,0.0006687817,0.000609725,0.004992708,0.006548096,0.005667306,0.006583448,0.002062781,0.0002389007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008105296,"about_ca_system_score_gemma":0.004144348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01376078,"about_ca_topic_score_gemma":0.03444563,"domain_scores_codex":[0.9756843,0.02116818,0.0004867449,0.0005873431,0.001243634,0.0008298256],"domain_scores_gemma":[0.9573981,0.03616271,0.001615433,0.001662901,0.002335984,0.0008249276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"qualitative","study_design_scores_codex":[0.000149057,0.0003063352,0.01385983,0.0005625649,0.00003596345,0.006936185,0.9016965,0.002064798,0.0009227758,0.03740564,0.001594492,0.03446577],"study_design_scores_gemma":[0.00004727764,0.0001400891,0.006599592,0.0006865389,0.00003478404,0.002176017,0.941323,0.007132043,0.00220356,0.01833919,0.02126191,0.00005595223],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8859615,0.001144881,0.08625498,0.003544469,0.0001076964,0.00231735,0.0002998415,0.00004620972,0.02032293],"genre_scores_gemma":[0.9436758,0.0007276777,0.05098307,0.0001814922,0.00002112443,0.001599356,0.00009100165,0.00002979346,0.002690635],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02913732,"threshold_uncertainty_score":0.1540948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3134772369","doi":"10.1017/nws.2020.48","title":"Functional disability and the role of children in U.S. older adults’ core discussion networks","year":2021,"lang":"en","type":"article","venue":"Network Science","topic":"Intergenerational Family Dynamics and Caregiving","field":"Social Sciences","cited_by":5,"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":"Construct (python library); Psychology; Core (optical fiber); Embeddedness; Developmental psychology; Gee; Perspective (graphical); Gerontology; Medicine; Sociology; Generalized estimating equation","authors":[{"name":"Markus H. Schafer","is_ca":true},{"name":"Laura Upenieks","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005407935555924417,"gpt":0.2365715352602906,"spread":0.2311635997043662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001441909,0.0002255929,0.000176057,0.001043262,0.001073236,0.001119003,0.0003985051,0.0003406251,0.003015578],"category_scores_gemma":[0.007881276,0.0001217463,0.0001367112,0.0006432398,0.0006139477,0.001462386,0.001696228,0.0005507452,0.00009782962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001210741,"about_ca_system_score_gemma":0.00054308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01676782,"about_ca_topic_score_gemma":0.03183213,"domain_scores_codex":[0.9994144,0.0002510144,0.00004362987,0.00009198084,0.00007491051,0.0001240458],"domain_scores_gemma":[0.9954126,0.001230209,0.002122584,0.0001518486,0.0003039969,0.000778646],"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.00005241485,0.00006395421,0.9656211,0.0000268493,0.00002344291,0.0001241586,0.02437102,0.0001104939,0.0001719984,0.0007065118,0.0003616576,0.008366393],"study_design_scores_gemma":[0.000003959027,0.00005528251,0.9652383,0.00004884852,0.00001535462,0.0002509185,0.03094305,0.0003098622,0.00009555643,0.000466059,0.002561774,0.00001111003],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9981337,0.0001560883,0.00007346907,0.0001484787,0.000003319068,0.000006851613,0.0001420467,0.000001819945,0.001334249],"genre_scores_gemma":[0.999595,0.00008059146,0.00005896389,0.00001748293,0.000002757289,0.000005053364,0.00007013503,6.62536e-7,0.0001694901],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01676782,"threshold_uncertainty_score":0.03334045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2310244163","doi":"10.1017/nws.2016.1","title":"Homophily, influence and the decay of segregation in self-organizing networks","year":2016,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Arizona; National Science Foundation","keywords":"Homophily; Vertex (graph theory); Similarity (geometry); Preferential attachment; Computer science; Phenomenon; Network model; Complex network; Theoretical computer science; Mathematics; Artificial intelligence; Combinatorics; Epistemology; Graph; World Wide Web","authors":[{"name":"Adam Douglas Henry","is_ca":false},{"name":"Dieter Mitsche","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003198444830000384,"gpt":0.2169475327338654,"spread":0.213749087903865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390502,0.000169038,0.0004543161,0.0008442919,0.0006197952,0.001229418,0.0005790418,0.0006315374,0.0009470008],"category_scores_gemma":[0.01389568,0.0002138741,0.0002844965,0.000445447,0.001855764,0.001752928,0.0009307252,0.0005583296,0.0001188606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008507092,"about_ca_system_score_gemma":0.0003175397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001683666,"about_ca_topic_score_gemma":0.001168124,"domain_scores_codex":[0.9995835,0.0001917807,0.00001709701,0.00006928878,0.00008425495,0.00005405462],"domain_scores_gemma":[0.9924205,0.004619373,0.001480293,0.0005213894,0.0004256828,0.0005327916],"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.000516557,0.000322172,0.06432629,0.0002634099,0.0002504565,0.0006722624,0.001815953,0.5465838,0.02248875,0.3181468,0.002004171,0.04260935],"study_design_scores_gemma":[0.00003413833,0.0001014766,0.0118693,0.00002202821,0.0000318058,0.0001334088,0.000264657,0.884649,0.002355322,0.09976254,0.000753206,0.00002311837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9451699,0.0002750613,0.05129736,0.0003979518,0.00001103758,0.00001617016,0.00002477209,0.00005797179,0.00274981],"genre_scores_gemma":[0.9983897,0.00004619287,0.001355031,0.00001183481,0.00000505293,0.000005312973,0.000007499792,0.000003728232,0.0001756481],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001683666,"threshold_uncertainty_score":0.007353783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4379512678","doi":"10.1017/nws.2023.11","title":"Exact recovery of Granger causality graphs with unconditional pairwise tests","year":2023,"lang":"en","type":"article","venue":"Network Science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"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":"Pairwise comparison; Granger causality; Causality (physics); Heuristics; Heuristic; Mathematics; Graph; Computer science; Theoretical computer science; Mathematical optimization; Artificial intelligence; Econometrics","authors":[{"name":"Ryan Kinnear","is_ca":true},{"name":"Ravi R. Mazumdar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01050310915852449,"gpt":0.245642663666144,"spread":0.2351395545076195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004264839,0.000852875,0.001030132,0.001222045,0.0006689714,0.0009703244,0.001438924,0.001027936,0.002886379],"category_scores_gemma":[0.04024021,0.0004481693,0.0006783883,0.0009578313,0.001693597,0.002305617,0.001749784,0.002041985,0.0004461558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006375235,"about_ca_system_score_gemma":0.001176257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002011141,"about_ca_topic_score_gemma":0.002315588,"domain_scores_codex":[0.9979631,0.001234569,0.0000653061,0.0003585039,0.0002354626,0.000143065],"domain_scores_gemma":[0.9697371,0.02526776,0.00152788,0.002159506,0.0008784239,0.0004292605],"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.0004632869,0.0001709472,0.005237584,0.0001634199,0.0001142407,0.0002424148,0.0001534955,0.8441486,0.003424715,0.04999479,0.001968247,0.0939182],"study_design_scores_gemma":[0.00002095838,0.00004488719,0.0003786134,0.000007995985,0.000006516958,0.00003325781,0.00002831329,0.9513937,0.0009703496,0.04689422,0.000212419,0.000008833335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05602188,0.0001152778,0.9418737,0.0003168007,0.00002403483,0.00005251934,0.000144839,0.0006186169,0.0008322948],"genre_scores_gemma":[0.7640991,0.00008859274,0.2340444,0.0001552226,0.00004432124,0.0001100519,0.0004794392,0.0001541341,0.0008246243],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004264839,"threshold_uncertainty_score":0.02255493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2792828486","doi":"10.1017/nws.2017.19","title":"Temporal evolution of the degree distribution of alters in growing networks","year":2018,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; James S. McDonnell Foundation","keywords":"Observability; Degree distribution; Preferential attachment; Computer science; Degree (music); Statistical physics; Network topology; Complex network; Synchronization (alternating current); Network dynamics; Evolving networks; Random graph; Interdependent networks; Theoretical computer science; Mathematics; Applied mathematics; Physics; Graph; Discrete mathematics","authors":[{"name":"Babak Fotouhi","is_ca":false},{"name":"Michael Rabbat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01743110528949425,"gpt":0.2574856976997779,"spread":0.2400545924102837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008046466,0.0001377711,0.0002064709,0.000961386,0.0004548498,0.0007500476,0.0006027047,0.0004624376,0.001768019],"category_scores_gemma":[0.008373704,0.0001788125,0.0002499588,0.0005606849,0.0009106958,0.001244745,0.0005647711,0.0004950084,0.0001510955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007857049,"about_ca_system_score_gemma":0.0003191528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002872106,"about_ca_topic_score_gemma":0.002488115,"domain_scores_codex":[0.9997841,0.00006152116,0.000008969088,0.00005691639,0.00005191858,0.00003665296],"domain_scores_gemma":[0.996098,0.00243239,0.0006461532,0.0002415517,0.0003901908,0.0001916195],"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.000142663,0.00007045782,0.03160371,0.0001311397,0.00005775502,0.0008569117,0.001034333,0.5922946,0.02509763,0.3237146,0.001572488,0.02342375],"study_design_scores_gemma":[0.00000612171,0.00002366378,0.00737639,0.00001241049,0.00001347136,0.0002302221,0.0002412371,0.9447829,0.003110528,0.04329192,0.0008897273,0.00002137005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8895551,0.0001818711,0.1049251,0.0004127125,0.00002233298,0.00002243932,0.0001850861,0.00009852299,0.004596802],"genre_scores_gemma":[0.9945779,0.00008546765,0.004285228,0.00001591687,0.000006206449,0.00001189447,0.00004672645,0.00001176041,0.0009589155],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002872106,"threshold_uncertainty_score":0.005914629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2978645537","doi":"10.1017/nws.2019.8","title":"Noting the ties after tying the knot: Photo-based elicitation of retrospective personal network data","year":2019,"lang":"en","type":"article","venue":"Network Science","topic":"Social Capital and Networks","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Tying; Respondent; Knot tying; Data collection; Computer science; Personal network; Knot (papermaking); Psychology; Data science; Artificial intelligence; Statistics; Mathematics; Medicine; Engineering","authors":[{"name":"Alexandra Marin","is_ca":true},{"name":"Chang Z. Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02740876028085889,"gpt":0.3002532802814959,"spread":0.272844520000637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005756703,0.0002863453,0.000181632,0.001641201,0.001591014,0.0009231468,0.000767823,0.0007211575,0.004089905],"category_scores_gemma":[0.02239461,0.0002473701,0.0001335115,0.001310055,0.0007203371,0.00120755,0.001566139,0.0007411049,0.001108375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006159642,"about_ca_system_score_gemma":0.000677598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00222587,"about_ca_topic_score_gemma":0.009887522,"domain_scores_codex":[0.9943089,0.004344719,0.0001598459,0.0003930434,0.0005836199,0.0002097641],"domain_scores_gemma":[0.9700415,0.01920441,0.003657804,0.003936545,0.002715218,0.0004445417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"qualitative","study_design_scores_codex":[0.001038134,0.0009958157,0.219962,0.001804005,0.0001066741,0.002168674,0.2791919,0.003143103,0.08268788,0.009823143,0.01909773,0.3799809],"study_design_scores_gemma":[0.00008207133,0.001251002,0.4138473,0.001081763,0.0001056107,0.001472328,0.340961,0.0121477,0.06538339,0.01209801,0.1513241,0.0002457402],"study_design_candidate":"qualitative","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8954149,0.0002226128,0.07074484,0.001000088,0.0001128552,0.00262855,0.003470424,0.0001478356,0.02625784],"genre_scores_gemma":[0.9295355,0.000316114,0.0584272,0.0003369106,0.00005347308,0.003406075,0.001369678,0.00004067668,0.006514228],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005756703,"threshold_uncertainty_score":0.03044474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411500587","doi":"10.1017/nws.2025.6","title":"Accounting for edge uncertainty in stochastic actor-oriented models for dynamic network analysis","year":2025,"lang":"en","type":"article","venue":"Network Science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke; National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Computer science; Markov chain; Hidden Markov model; Expectation–maximization algorithm; Algorithm; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Theoretical computer science; Machine learning; Mathematics; Maximum likelihood; Statistics","authors":[{"name":"Heather Shappell","is_ca":false},{"name":"Mark Kramer","is_ca":false},{"name":"Catherine J. Chu","is_ca":false},{"name":"Eric D. Kolaczyk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0264256621298199,"gpt":0.3006178198945753,"spread":0.2741921577647554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004976342,0.001223209,0.001530633,0.001436477,0.0007723498,0.001604337,0.002403869,0.002086599,0.001534543],"category_scores_gemma":[0.0187018,0.001342958,0.001381523,0.001408913,0.002076767,0.003100188,0.002059044,0.002434846,0.0002506805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001622599,"about_ca_system_score_gemma":0.001199711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009632556,"about_ca_topic_score_gemma":0.01092441,"domain_scores_codex":[0.9983013,0.0009785893,0.00007606358,0.0003114413,0.0002078379,0.0001248423],"domain_scores_gemma":[0.9874839,0.01061697,0.0007954274,0.0005059356,0.0003740292,0.0002237996],"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.00001854787,0.000009781215,0.0005082348,0.00001933953,0.00002742019,0.00004156384,0.00004457286,0.958632,0.0001562072,0.03666938,0.0001792426,0.003693765],"study_design_scores_gemma":[0.000002013115,0.00000317505,0.00005324314,0.000003051296,0.000003124743,0.000005074232,0.00000332363,0.9775801,0.0000347639,0.02219116,0.0001171494,0.000003849336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008447794,0.0001180598,0.9906632,0.0001884676,0.00002337337,0.00001802783,0.0000547501,0.00008195312,0.0004043509],"genre_scores_gemma":[0.7702101,0.000813611,0.2231479,0.0002866198,0.0001881447,0.0004173975,0.0004324708,0.0001816209,0.00432216],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009632556,"threshold_uncertainty_score":0.02631778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402216016","doi":"10.1017/nws.2017.22","title":"The hourglass effect in hierarchical dependency networks","year":2017,"lang":"en","type":"preprint","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Hourglass; Traverse; Dependency (UML); Computer science; Modular design; Set (abstract data type); Vertex (graph theory); Property (philosophy); Distributed computing; Topology (electrical circuits); Theoretical computer science; Mathematics; Artificial intelligence; Graph; Physics","authors":[{"name":"Kaeser M. Sabrin","is_ca":false},{"name":"Constantine Dovrolis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009963911779965395,"gpt":0.3016589310431146,"spread":0.2916950192631492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070633,0.0002985254,0.0004153526,0.001290124,0.0007816513,0.00102311,0.0005592062,0.0004956635,0.003100064],"category_scores_gemma":[0.007237422,0.000410559,0.0005087417,0.0009326898,0.001518966,0.002748649,0.0009921725,0.0006080049,0.0001399789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001419487,"about_ca_system_score_gemma":0.000413144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005806027,"about_ca_topic_score_gemma":0.005586181,"domain_scores_codex":[0.9994197,0.0001883411,0.00002825635,0.0001866862,0.00008784882,0.00008929345],"domain_scores_gemma":[0.9915795,0.005244994,0.001328077,0.001013755,0.0004705447,0.0003630833],"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.0003088451,0.00007654855,0.02764366,0.0003131003,0.0001889177,0.0007947158,0.001264028,0.3891667,0.01331607,0.4924159,0.003251558,0.07126001],"study_design_scores_gemma":[0.00002168209,0.00006285645,0.01149612,0.00004290294,0.00007233913,0.0002800685,0.0002580472,0.6873522,0.004695766,0.2912447,0.004445514,0.00002781681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4400734,0.0004482318,0.5525876,0.0004339719,0.00001824235,0.00006337568,0.0004060906,0.000291052,0.005677913],"genre_scores_gemma":[0.9667531,0.000215902,0.03117477,0.0000607793,0.00002275864,0.00005553543,0.0001764051,0.00004267765,0.001498175],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005806027,"threshold_uncertainty_score":0.01154447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394576516","doi":"10.1017/nws.2024.3","title":"Generating preferential attachment graphs via a Pólya urn with expanding colors","year":2024,"lang":"en","type":"article","venue":"Network Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Computer science","authors":[{"name":"Somya Singh","is_ca":false},{"name":"Fady Alajaji","is_ca":true},{"name":"Bahman Gharesifard","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02093150770126085,"gpt":0.3137846537929772,"spread":0.2928531460917163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002757095,0.0006150121,0.001013353,0.001280084,0.001053046,0.001685869,0.002620045,0.001690445,0.005432129],"category_scores_gemma":[0.01137332,0.000731381,0.001084991,0.001324819,0.001819165,0.002439244,0.002031571,0.001920505,0.0008277521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001630128,"about_ca_system_score_gemma":0.0008269122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005010513,"about_ca_topic_score_gemma":0.005373149,"domain_scores_codex":[0.9982159,0.0009717955,0.00004774195,0.0003787429,0.0002388113,0.0001470912],"domain_scores_gemma":[0.993282,0.004313212,0.000567308,0.0008427827,0.0005940307,0.0004007213],"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.0001546135,0.0001148602,0.002487338,0.00007190755,0.00005460806,0.0003037813,0.0003334103,0.6589541,0.003085997,0.3090298,0.002207773,0.02320177],"study_design_scores_gemma":[0.00001649411,0.00001954214,0.0001591779,0.000006372116,0.000008066986,0.00003471833,0.00001842945,0.959603,0.0002901992,0.03899561,0.0008376276,0.00001087867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08601817,0.0001620972,0.9086002,0.0004485557,0.00008369824,0.0001308076,0.0001839721,0.000316235,0.00405623],"genre_scores_gemma":[0.7814117,0.0002830829,0.2068814,0.0002112809,0.0000634003,0.0003971474,0.000253431,0.0001355365,0.01036297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005432129,"threshold_uncertainty_score":0.01817226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}