{"meta":{"query_hash":"347a799fa0ef","filters":{"venue":"Network Science"},"cohort_total":14,"direct_labels_cover":0,"predictions_cover":14,"exported":14,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/347a799fa0ef","api":"https://metacan.xera.ac/api/v1/cohort?venue=Network+Science"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.003198444830000384,"score_gpt":0.21694753273386544,"score_spread":0.21374908790386504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2310244163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97538936,0.00019640158,0.021898733,0.000287107,0.000050536444,0.00021010186,5.603904e-7,0.000043441505,0.0019237704],"genre_scores_gemma":[0.9979067,0.00004175559,0.0018347685,0.000033802287,0.0001468052,0.000013731448,3.3053607e-7,0.000006181448,0.000015943551],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988596,0.00007492103,0.00026924,0.0002640775,0.00021833045,0.00031384357],"domain_scores_gemma":[0.9990342,0.00032429677,0.00017040335,0.00031776086,0.00010608425,0.000047231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013940977,0.00010188927,0.00018762152,0.000070326474,0.0001893104,0.000051084822,0.00042106927,0.00002100851,0.000020408372],"category_scores_gemma":[0.000015794303,0.000057648347,0.00003691812,0.0014879683,0.00074706326,0.00029546215,0.00022263113,0.000092495444,0.0000016345494],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024140896,0.000044986962,0.6024598,0.0000033710717,0.000021420807,5.2596897e-7,0.00038936027,0.014746019,0.0014739111,0.31401223,0.00022862571,0.06659562],"study_design_scores_gemma":[0.0028966677,0.00008916725,0.51144713,0.0006463018,0.000100429024,0.000005041859,0.00015607078,0.18695118,0.0052325074,0.2906564,0.0010811232,0.00073803193],"about_ca_topic_score_codex":0.00011902742,"about_ca_topic_score_gemma":0.000028168448,"teacher_disagreement_score":0.17220517,"about_ca_system_score_codex":0.000028316945,"about_ca_system_score_gemma":0.000057120764,"threshold_uncertainty_score":0.27525857},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009963911779965395,"score_gpt":0.30165893104311464,"score_spread":0.2916950192631492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402216016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52514756,0.0074172486,0.20500632,0.0027332308,0.01184593,0.005832021,0.0000280193,0.000894926,0.24109474],"genre_scores_gemma":[0.9953583,0.000108956425,0.00087288144,0.000036003396,0.0030479091,0.00023873906,0.000016935099,0.000031384683,0.0002888935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957825,0.00033883617,0.00056464603,0.0011302081,0.0008028949,0.0013809275],"domain_scores_gemma":[0.99591947,0.0007482138,0.00055525877,0.0024414826,0.00012116736,0.00021439655],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0050617736,0.00047238247,0.00064337807,0.00014131896,0.0019653419,0.0013778979,0.004663268,0.00017701014,0.000053354044],"category_scores_gemma":[0.00007065384,0.00033859414,0.0003529772,0.00072370813,0.0014316358,0.00017826859,0.003993003,0.0023518628,0.000015589627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046458357,0.0000874115,0.33704653,0.000013034905,0.00008869017,0.00001716716,0.00006804516,0.2184475,0.000009562466,0.040133834,0.010046486,0.39399529],"study_design_scores_gemma":[0.0002935048,0.000071169285,0.07291169,0.0004753807,0.00007971146,0.0000013348161,0.000007947813,0.56344944,0.000029851963,0.35662812,0.0052459245,0.00080590346],"about_ca_topic_score_codex":0.0004807296,"about_ca_topic_score_gemma":0.00036432003,"teacher_disagreement_score":0.47021073,"about_ca_system_score_codex":0.0001488985,"about_ca_system_score_gemma":0.0004648941,"threshold_uncertainty_score":0.99994975},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.008107822286294569,"score_gpt":0.2518100767904448,"score_spread":0.24370225450415026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516965256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65982425,0.0011285114,0.32640478,0.0011712246,0.0004738056,0.00076074916,0.000020221798,0.0003027973,0.00991368],"genre_scores_gemma":[0.9670454,0.000033888096,0.03128804,0.00011564448,0.0011136462,0.000018154686,0.0000072681823,0.000021950602,0.0003559837],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971547,0.0001126113,0.00039449864,0.0007891649,0.0005345943,0.0010144179],"domain_scores_gemma":[0.9988282,0.0001732214,0.00020891835,0.0005462804,0.00012765628,0.00011574709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007214382,0.00030502185,0.0004124341,0.00006540187,0.0004428721,0.00014995023,0.00070494704,0.00008341764,0.00038787903],"category_scores_gemma":[0.000021441283,0.00022589973,0.00007072636,0.0023968532,0.0008134327,0.00081816135,0.0004301186,0.00021095561,0.000033421085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009902528,0.0001188191,0.5639611,0.00001051211,0.0000805095,0.0000068425047,0.0006627253,0.024292476,0.0050531765,0.3388221,0.03550622,0.031386513],"study_design_scores_gemma":[0.0013371594,0.00010430052,0.06464579,0.0006395554,0.000066198845,0.000006589726,0.00006196652,0.02022605,0.0011198126,0.876239,0.034416415,0.0011371667],"about_ca_topic_score_codex":0.00034780253,"about_ca_topic_score_gemma":0.00011940937,"teacher_disagreement_score":0.53741693,"about_ca_system_score_codex":0.00021544233,"about_ca_system_score_gemma":0.00018800187,"threshold_uncertainty_score":0.92119235},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017431105289494254,"score_gpt":0.2574856976997779,"score_spread":0.24005459241028365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792828486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80491346,0.00005671093,0.19266368,0.000050825674,0.00020883876,0.0001458,0.0000028924185,0.000014747056,0.0019430227],"genre_scores_gemma":[0.99886674,7.812838e-7,0.00073418865,0.000010782312,0.0003639479,0.000005103643,0.000004519017,0.000003799938,0.000010168342],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998856,0.00005903985,0.00030671782,0.00020676538,0.00026839616,0.00030305708],"domain_scores_gemma":[0.99919605,0.000039928556,0.00023528592,0.00035636322,0.00014027297,0.000032068452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000886209,0.000083249215,0.00015874954,0.000047005506,0.00017427331,0.000014828495,0.00053645787,0.000021835986,0.00002219556],"category_scores_gemma":[0.0000111991685,0.00006420622,0.000085675034,0.002379386,0.0008528266,0.00021741555,0.00020912568,0.00010736084,6.670207e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008813614,0.000042257332,0.9171911,0.000002018624,0.0000072440375,5.4745744e-8,0.000046405385,0.024087152,0.00053263165,0.0470767,0.0009990421,0.010006606],"study_design_scores_gemma":[0.00016133624,0.000059744438,0.644463,0.0001654141,0.000021258733,2.9683764e-7,0.00007602591,0.3346076,0.002339336,0.017549302,0.00041602176,0.00014069253],"about_ca_topic_score_codex":0.0006692659,"about_ca_topic_score_gemma":0.00011526034,"teacher_disagreement_score":0.31052044,"about_ca_system_score_codex":0.0000857677,"about_ca_system_score_gemma":0.00009827191,"threshold_uncertainty_score":0.3142275},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02740876028085889,"score_gpt":0.3002532802814959,"score_spread":0.272844520000637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978645537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95587647,0.0012668227,0.0002997862,0.0021255803,0.0025051862,0.0007043904,0.0000098210185,0.00006178119,0.03715016],"genre_scores_gemma":[0.9963904,0.000043736196,0.00026311984,0.00095604884,0.0020916348,0.000018182145,0.000003679867,0.000008865602,0.00022434499],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9973649,0.00025866204,0.00021737022,0.0004072833,0.0010912648,0.0006605652],"domain_scores_gemma":[0.9981583,0.00086241297,0.0002231671,0.00048257626,0.00020575756,0.00006778932],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0054752138,0.00011779052,0.00016118634,0.00002592551,0.0020321568,0.00021210144,0.0014864128,0.00007452876,0.00024951753],"category_scores_gemma":[0.00032248252,0.00007292798,0.00006807569,0.0018440235,0.0021324616,0.0004948123,0.00029857084,0.0002915889,0.00003657329],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031904207,0.0001123942,0.6187623,0.000035702364,0.00007092413,0.0000042188813,0.21561313,0.033448547,0.00026409677,0.077287,0.025355095,0.02872754],"study_design_scores_gemma":[0.00058395235,0.00022249433,0.66891307,0.00036093174,0.00008645169,0.0000013559277,0.050929327,0.22557332,0.00004847953,0.016881026,0.035631314,0.00076829054],"about_ca_topic_score_codex":0.0008002155,"about_ca_topic_score_gemma":0.0016845909,"teacher_disagreement_score":0.19212477,"about_ca_system_score_codex":0.000114071954,"about_ca_system_score_gemma":0.00041597206,"threshold_uncertainty_score":0.99926704},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013209948970897998,"score_gpt":0.28416302776144386,"score_spread":0.27095307879054586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984649464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9697747,0.0019854077,0.000011496465,0.02344681,0.0008116863,0.0011660922,0.0000038046128,0.00007406069,0.0027259183],"genre_scores_gemma":[0.9969253,0.00073229073,0.00001743438,0.0015972893,0.00035982797,0.000037305068,0.00000341071,0.000011663458,0.00031547496],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9955981,0.00091752544,0.00030161464,0.0005126154,0.0013476008,0.0013225415],"domain_scores_gemma":[0.9972275,0.0016713944,0.00025408342,0.0006504276,0.000066586865,0.00013004548],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.0074520507,0.0002457059,0.00025836352,0.00008541197,0.0023434036,0.0024383103,0.0023649975,0.00019805081,0.000010213119],"category_scores_gemma":[0.00093566836,0.0001279249,0.000054742828,0.0021481633,0.003311753,0.0006241446,0.00037407418,0.00071747927,0.00001604063],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003446937,0.000088886794,0.9607325,0.0000032053385,0.0000100216685,0.0000049619584,0.0036478615,0.0006287972,0.0000031121087,0.0141279185,0.008536201,0.012182073],"study_design_scores_gemma":[0.0006193522,0.00011763615,0.96779066,0.00013656735,0.000016339438,0.0000067482156,0.008076574,0.0016937784,0.0000013428049,0.0044799014,0.01680526,0.00025581341],"about_ca_topic_score_codex":0.0001546709,"about_ca_topic_score_gemma":0.0033937492,"teacher_disagreement_score":0.02715058,"about_ca_system_score_codex":0.0001850706,"about_ca_system_score_gemma":0.00021886097,"threshold_uncertainty_score":0.9994007},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020289072426919665,"score_gpt":0.2689334541712341,"score_spread":0.24864438174431444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004293141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.514788,0.00001735563,0.48301724,0.000029303525,0.00008083143,0.00022949735,0.000026948119,0.000065574735,0.001745273],"genre_scores_gemma":[0.9832982,0.0000011162051,0.016074257,0.00007977418,0.0003383549,0.00004761877,0.0001011579,0.00001602596,0.000043530606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820584,0.00037318352,0.000283513,0.0002827859,0.000335011,0.0005196895],"domain_scores_gemma":[0.998061,0.0003086619,0.00017162727,0.00091529894,0.0004219773,0.00012140886],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001376085,0.00021104167,0.0003164478,0.00008113059,0.0034102008,0.00023121304,0.0006920454,0.000046118428,0.0000595358],"category_scores_gemma":[0.00001909606,0.00018702222,0.00014347667,0.0017566979,0.00053587137,0.0002804678,0.00027044126,0.0008175599,8.138422e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047262112,0.00071249466,0.010267129,0.00004223565,0.000204891,0.0000013313245,0.0020249032,0.76868546,0.041196533,0.027366385,0.0020025373,0.14702348],"study_design_scores_gemma":[0.0007516316,0.00017558169,0.002345322,0.00008260837,0.00014969653,0.00000431199,0.00090016116,0.5953511,0.03238889,0.36689997,0.000426123,0.000524633],"about_ca_topic_score_codex":0.0004610464,"about_ca_topic_score_gemma":0.0027819958,"teacher_disagreement_score":0.46851018,"about_ca_system_score_codex":0.00005246312,"about_ca_system_score_gemma":0.00020979597,"threshold_uncertainty_score":0.9978872},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005407935555924417,"score_gpt":0.23657153526029065,"score_spread":0.23116359970436623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134772369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99367344,0.0007135269,0.00036047332,0.001268964,0.0003896252,0.00015310152,0.0000017972008,0.0000072078033,0.0034318806],"genre_scores_gemma":[0.999173,0.00011771131,0.00009515638,0.00014232633,0.00033347963,0.000008418048,0.0000056436675,0.0000023039242,0.00012196565],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988812,0.00010824532,0.00015242306,0.00023376913,0.00039658358,0.00022773752],"domain_scores_gemma":[0.99952096,0.00012518343,0.0000533363,0.00013064261,0.00012047619,0.000049376857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014453493,0.000053485637,0.000092496106,0.00001194083,0.00058259815,0.000060770697,0.00018408481,0.00003790111,0.000053963657],"category_scores_gemma":[0.00014594774,0.000031188796,0.00003673277,0.00069223845,0.0019286758,0.00014360977,0.00012808137,0.0001052984,4.6746828e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031485713,0.000047867274,0.71458375,0.0000013937384,0.0000027721685,2.996808e-7,0.002363159,0.0164058,0.000030875595,0.25335485,0.00015454169,0.013023227],"study_design_scores_gemma":[0.00026906197,0.0000046682717,0.9126918,0.00004942767,0.000002896336,9.704155e-7,0.0021093795,0.077256836,0.000006250609,0.007435747,0.00011228983,0.000060718008],"about_ca_topic_score_codex":0.000541403,"about_ca_topic_score_gemma":0.0052413745,"teacher_disagreement_score":0.2459191,"about_ca_system_score_codex":0.000055307908,"about_ca_system_score_gemma":0.00017036707,"threshold_uncertainty_score":0.7106286},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.13148311854481365,"score_gpt":0.515090289661629,"score_spread":0.3836071711168153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157446178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7210436,0.0046083573,0.25709313,0.00054378936,0.0026684983,0.0017755384,0.000020895912,0.00009532841,0.012150866],"genre_scores_gemma":[0.9131479,0.00020690654,0.084411904,0.001522255,0.0002029944,0.00012945216,0.000018587885,0.000015479462,0.00034449104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946815,0.0017397124,0.0011938047,0.00055559544,0.0006565908,0.0011728125],"domain_scores_gemma":[0.9935005,0.0031756419,0.0005571808,0.0009171841,0.0013656839,0.00048384524],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.009434963,0.00024036413,0.0011193947,0.000402895,0.0015921622,0.00001464622,0.0005730266,0.00012069452,0.00016049758],"category_scores_gemma":[0.0009785388,0.00020449188,0.00020045695,0.009835487,0.0005768319,0.00012429869,0.001039141,0.0006427659,0.000004633455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019889118,0.00078682444,0.07824619,0.001565051,0.0018038192,0.0002519247,0.19647448,0.6290826,0.000060703587,0.006006667,0.027471045,0.05805181],"study_design_scores_gemma":[0.0013161394,0.00020526072,0.030603833,0.000782787,0.001187212,0.000121578174,0.16569686,0.7976067,0.00001971208,0.00040024114,0.0014249905,0.00063467206],"about_ca_topic_score_codex":0.0002481465,"about_ca_topic_score_gemma":0.001343589,"teacher_disagreement_score":0.19210434,"about_ca_system_score_codex":0.00027996252,"about_ca_system_score_gemma":0.001867038,"threshold_uncertainty_score":0.99970764},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06435775719973422,"score_gpt":0.30856005783608176,"score_spread":0.24420230063634754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208496800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69090635,0.006282455,0.0024023382,0.0017293587,0.007314143,0.0004114869,0.0000016264338,0.00032337382,0.29062888],"genre_scores_gemma":[0.9804795,0.0017123035,0.010717949,0.0008561155,0.005241517,0.000019473651,0.0000021973963,0.000013520769,0.0009574613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974901,0.000120255376,0.00022456361,0.00054100674,0.0007162509,0.0009077919],"domain_scores_gemma":[0.99883,0.00018577032,0.00012347155,0.00019632658,0.00036353312,0.00030088006],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002298649,0.00013115896,0.00021968258,0.000030302948,0.003229219,0.00042292674,0.00030846157,0.00012137171,0.00009183208],"category_scores_gemma":[0.00019843136,0.00014034443,0.000052727402,0.0023666264,0.0023874238,0.0005403465,0.00020274446,0.00025222515,0.00001625011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008072004,0.000047395613,0.080082595,0.000016153806,0.000029426645,0.00002468845,0.008999517,0.003091614,0.00026978727,0.7075653,0.008988522,0.19080424],"study_design_scores_gemma":[0.0021069972,0.00014323575,0.06526312,0.0005929072,0.00010192044,0.00008372343,0.01861716,0.0015649485,0.00052393886,0.19567071,0.71355647,0.0017748309],"about_ca_topic_score_codex":0.00036170759,"about_ca_topic_score_gemma":0.0024948178,"teacher_disagreement_score":0.70456797,"about_ca_system_score_codex":0.0002010168,"about_ca_system_score_gemma":0.00074247376,"threshold_uncertainty_score":0.99806845},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028061766804376314,"score_gpt":0.283082251646283,"score_spread":0.25502048484190665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217035451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27687448,0.00081808324,0.7192971,0.00019214257,0.0012001905,0.00088268984,0.000007122169,0.0006008348,0.00012737335],"genre_scores_gemma":[0.59751517,0.000017921026,0.40214118,0.00018447932,0.000029945324,0.00008247309,0.0000019694544,0.000011799141,0.000015058161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971008,0.00010975456,0.00040318046,0.00091731723,0.0006402637,0.0008286996],"domain_scores_gemma":[0.99796236,0.00064912316,0.00028612916,0.00069441303,0.0002000087,0.00020795927],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00097406656,0.0002274324,0.00039223564,0.00027479086,0.0013375519,0.00013584355,0.0020203434,0.00005089386,0.0000069831167],"category_scores_gemma":[0.00020515258,0.00023379676,0.00009625195,0.005859909,0.0005926386,0.00058937335,0.0012700544,0.00037301905,4.7489397e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029191098,0.0006227974,0.047220524,0.00011402546,0.00008964725,0.00003272872,0.0041648396,0.28809553,0.030184105,0.57458514,0.0015183747,0.05308035],"study_design_scores_gemma":[0.0006920433,0.00018923255,0.018822419,0.000052112853,0.000010216516,0.000015924601,0.000053911957,0.9301725,0.0004981831,0.048700668,0.0004733296,0.00031945994],"about_ca_topic_score_codex":0.00001351858,"about_ca_topic_score_gemma":0.000010416412,"teacher_disagreement_score":0.64207697,"about_ca_system_score_codex":0.00006658425,"about_ca_system_score_gemma":0.000107531516,"threshold_uncertainty_score":0.99996257},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010503109158524485,"score_gpt":0.24564266366614398,"score_spread":0.2351395545076195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379512678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99844944,0.00022603478,0.0003479413,0.000069150694,0.00014461835,0.000093201495,0.000016710073,0.0000263963,0.00062650704],"genre_scores_gemma":[0.99838936,0.00008723343,0.00072329864,0.00008836474,0.0001948356,0.00001321943,0.00010466995,0.0000118357475,0.00038715414],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99847883,0.000049429258,0.00018274313,0.0004522412,0.00043338467,0.00040335167],"domain_scores_gemma":[0.9990695,0.00003104943,0.00012197364,0.0004822766,0.00018001969,0.000115191775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085528544,0.00012794888,0.00015246992,0.000099946374,0.00018382375,0.000021091657,0.0003194445,0.00006459158,0.00003114425],"category_scores_gemma":[0.000063173946,0.00010700903,0.0000923739,0.0021345238,0.00063609285,0.000010536409,0.0001255949,0.000056706445,0.00001343912],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016482912,0.0001300835,0.42309573,0.00003992545,0.00021188188,0.00002206474,0.0000448501,0.30989763,0.18741183,0.0007658609,0.07254544,0.005669849],"study_design_scores_gemma":[0.000443367,0.00054766954,0.9617661,0.00007714281,0.00008491738,0.000024391245,0.00004099068,0.002509605,0.023022484,0.003863653,0.007112662,0.0005069852],"about_ca_topic_score_codex":0.000014808998,"about_ca_topic_score_gemma":0.00009748959,"teacher_disagreement_score":0.53867036,"about_ca_system_score_codex":0.000016349926,"about_ca_system_score_gemma":0.00024839657,"threshold_uncertainty_score":0.43637016},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.02093150770126085,"score_gpt":0.31378465379297715,"score_spread":0.2928531460917163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394576516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13605948,0.0006674475,0.8598322,0.0001601524,0.0009925214,0.00030090866,7.1705773e-7,0.00039195278,0.0015945963],"genre_scores_gemma":[0.9179769,0.000024100596,0.081408925,0.00010220454,0.00020901827,0.000057109122,8.420073e-7,0.000014059123,0.00020679922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654686,0.00009276345,0.0002251399,0.0009855328,0.0011244249,0.0010252933],"domain_scores_gemma":[0.99876255,0.0001708113,0.00005511727,0.00063819584,0.000117320255,0.00025598842],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001645107,0.00019632364,0.00015853505,0.0003095013,0.00092885643,0.0011072739,0.0018096567,0.000038991304,0.000021908802],"category_scores_gemma":[0.000026258509,0.00014895537,0.000055605862,0.0047990456,0.0006640783,0.0015335068,0.0006999959,0.00032826082,0.000039739447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055021574,0.00010563109,0.0036218103,0.00007043628,0.00005991571,0.00021533573,0.0021333992,0.17267805,0.042546824,0.6025784,0.0016135846,0.1743216],"study_design_scores_gemma":[0.00022505215,0.00037921194,0.00058370375,0.00021505907,0.000008227549,0.000087517925,0.00003754198,0.952013,0.004294072,0.040018585,0.0017275108,0.00041053162],"about_ca_topic_score_codex":0.0000066024586,"about_ca_topic_score_gemma":0.000018103388,"teacher_disagreement_score":0.78191745,"about_ca_system_score_codex":0.00013342848,"about_ca_system_score_gemma":0.00031306216,"threshold_uncertainty_score":0.99992967},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0264256621298199,"score_gpt":0.30061781989457526,"score_spread":0.27419215776475536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411500587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1124138,0.0001719677,0.8808723,0.0016133803,0.0023945293,0.0015249954,0.000037818936,0.0001354681,0.0008357451],"genre_scores_gemma":[0.99436975,0.00000699814,0.0024778072,0.0021493086,0.0002181819,0.00043404318,0.0000053736376,0.0000132798705,0.0003252664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678636,0.00006381823,0.00038625448,0.0012203805,0.0004452105,0.0010979862],"domain_scores_gemma":[0.9891488,0.009917223,0.00016786912,0.0004317284,0.00026275884,0.000071606475],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.0020002585,0.00023358759,0.00041783552,0.0004743079,0.0013192855,0.00014254318,0.0006892418,0.000071657865,0.0000037879445],"category_scores_gemma":[0.008474317,0.00022718623,0.00019543448,0.009742586,0.0005586251,0.0005627596,0.00030713293,0.00017622333,0.0000017977653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010531609,0.000039424605,0.00079044927,0.000013560462,0.000025151832,3.830672e-7,0.00008735571,0.97013336,0.0006999926,0.02556594,0.0013522028,0.0011868785],"study_design_scores_gemma":[0.00045323913,0.00005083485,0.0032865151,0.000056818037,0.000086879125,4.132436e-7,0.000059915732,0.9648156,0.000049163664,0.030061068,0.00087460654,0.00020490194],"about_ca_topic_score_codex":0.000031179272,"about_ca_topic_score_gemma":0.00076308846,"teacher_disagreement_score":0.8819559,"about_ca_system_score_codex":0.00042128636,"about_ca_system_score_gemma":0.0003358275,"threshold_uncertainty_score":0.99998087},"labels":[],"label_agreement":null}]}