{"meta":{"query_hash":"e78c104dd5eb","filters":{"venue":"Journal of Complex Networks"},"cohort_total":19,"direct_labels_cover":0,"predictions_cover":19,"exported":19,"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/e78c104dd5eb","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Complex+Networks"},"results":[{"id":"W2138645600","doi":"10.1093/comnet/cnv014","title":"Protein residue networks from a local search perspective","year":2015,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","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":"Memorial University of Newfoundland","funders":"","keywords":"Cluster analysis; Transitive relation; Local search (optimization); Perspective (graphical); Path (computing); Hierarchy; Inverse; Search algorithm","score_opus":0.02803379139131883,"score_gpt":0.2714451608391518,"score_spread":0.24341136944783298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138645600","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.08456375,0.00594996,0.90462154,0.00071664585,0.00050170533,0.00027160186,0.000009381855,0.000009880363,0.003355532],"genre_scores_gemma":[0.990452,0.00012871744,0.0052124457,0.0005931659,0.0033068121,0.0000036732595,0.000047527556,0.00003229801,0.00022336452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829626,0.000158538,0.0006069853,0.00020024095,0.00032217376,0.00041580453],"domain_scores_gemma":[0.9982105,0.000029497016,0.00036887368,0.00034089902,0.0006758644,0.00037437316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078351365,0.00022030671,0.00035641945,0.000061386636,0.00008368903,0.000079869285,0.0004618009,0.00029030888,0.000037222773],"category_scores_gemma":[0.000041835025,0.00018814727,0.00020025113,0.00015245184,0.00017515308,0.000013168512,0.00020664473,0.0005701182,0.000006690119],"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.0020316564,0.00018108395,0.0008666678,0.00000810174,0.000575554,0.000073427334,0.0005187248,0.8152006,0.0021239305,0.0018996089,0.15937474,0.01714589],"study_design_scores_gemma":[0.005118329,0.0027231164,0.003084128,0.00019797009,0.00012362096,0.00036505162,0.0038234883,0.8919533,0.0009792846,0.007222082,0.083537824,0.00087180093],"about_ca_topic_score_codex":0.00011806727,"about_ca_topic_score_gemma":0.000101991725,"teacher_disagreement_score":0.90588826,"about_ca_system_score_codex":0.0000985455,"about_ca_system_score_gemma":0.00024730523,"threshold_uncertainty_score":0.7672423},"labels":[],"label_agreement":null},{"id":"W2153120494","doi":"10.1093/comnet/cnu010","title":"Network robustness versus multi-strategy sequential attack","year":2014,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":49,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Betweenness centrality; Computer science; Greedy algorithm; Centrality; Pairwise comparison; Artificial intelligence; Mathematics; Algorithm; Statistics","score_opus":0.07814062192789892,"score_gpt":0.32945073441080697,"score_spread":0.251310112482908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153120494","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.025323842,0.00024952902,0.96772784,0.00011184678,0.0009727933,0.00013563652,0.0000025296188,0.000059419337,0.0054165367],"genre_scores_gemma":[0.97219586,0.00001228438,0.018554468,0.000081638915,0.008915349,0.0000052742425,0.00003151784,0.00004889771,0.00015468853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973033,0.00034864535,0.0010347728,0.0002629757,0.00039660046,0.00065370405],"domain_scores_gemma":[0.9975296,0.00032262938,0.0010477174,0.00044368618,0.00040289052,0.00025343345],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00093074795,0.00035116132,0.0007892142,0.00012275112,0.00024478242,0.00017996704,0.00070054847,0.000103985214,0.0010673634],"category_scores_gemma":[0.000011145389,0.00031966384,0.0005463835,0.00049228914,0.000120714714,0.0002422768,0.00015501892,0.0007156435,0.000010992059],"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.00019130157,0.00011860964,0.0048688017,0.0000035727926,0.0003193596,0.0000055053865,0.000012682358,0.9188513,0.000020438873,0.004388168,0.051501997,0.019718265],"study_design_scores_gemma":[0.0023978201,0.0003397639,0.004175202,0.00007722705,0.0002805485,0.000014740154,0.000040354997,0.9530562,0.000014127846,0.0016872069,0.037496917,0.00041986536],"about_ca_topic_score_codex":0.000027228843,"about_ca_topic_score_gemma":0.000027287513,"teacher_disagreement_score":0.9491734,"about_ca_system_score_codex":0.00006087159,"about_ca_system_score_gemma":0.00006833092,"threshold_uncertainty_score":0.99992555},"labels":[],"label_agreement":null},{"id":"W2752670111","doi":"10.1093/comnet/cnx039","title":"Two-mode networks exhibiting data loss","year":2017,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalization; Connection (principal bundle); Construct (python library); Matrix (chemical analysis); Computer science; Combinatorics; Matrix analysis; Mode (computer interface); Tournament; Mathematics; Discrete mathematics; Eigenvalues and eigenvectors; Physics","score_opus":0.0569844298999803,"score_gpt":0.3639085522797237,"score_spread":0.30692412237974337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752670111","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.026181806,0.00055618957,0.95342183,0.0005026803,0.00064566085,0.00018326797,0.000022578284,0.000057951987,0.018428061],"genre_scores_gemma":[0.9784394,0.00005596786,0.011831391,0.00012316505,0.009285593,0.000002816313,0.000095760006,0.000053268282,0.000112619986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972434,0.00015961095,0.0011255026,0.00038550553,0.00044363024,0.0006423315],"domain_scores_gemma":[0.99424875,0.0002441893,0.0024911608,0.0023903658,0.0003624832,0.0002630755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012744364,0.00035130876,0.0008408808,0.00012560702,0.0008967034,0.0006884276,0.003437891,0.000077600525,0.00064382056],"category_scores_gemma":[0.000033540604,0.0003181495,0.00039297415,0.0001570591,0.00022688831,0.0009011755,0.0013196664,0.000947605,0.0000065841705],"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.00016724422,0.0003334319,0.23173521,0.000010216699,0.0011745444,0.00012393178,0.00006629215,0.40874752,0.00008664962,0.019646605,0.13142493,0.20648341],"study_design_scores_gemma":[0.0010752963,0.000068635614,0.012317208,0.00019950418,0.0002619451,0.000051831485,0.000054718326,0.9519457,0.000018050343,0.007731598,0.025850598,0.00042486435],"about_ca_topic_score_codex":0.00022313479,"about_ca_topic_score_gemma":0.00006464886,"teacher_disagreement_score":0.95225763,"about_ca_system_score_codex":0.000045666588,"about_ca_system_score_gemma":0.000074843105,"threshold_uncertainty_score":0.99992704},"labels":[],"label_agreement":null},{"id":"W2769227974","doi":"10.1093/comnet/cnz019","title":"Local clustering coefficient of spatial preferential attachment model","year":2019,"lang":"en","type":"preprint","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research","keywords":"Cluster analysis; Clustering coefficient; Preferential attachment; Vertex (graph theory); Computer science; Complex network; Mathematics; Statistical physics; Combinatorics; Physics; Graph; Artificial intelligence","score_opus":0.031472128706824594,"score_gpt":0.29944240186409743,"score_spread":0.26797027315727284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769227974","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.021818852,0.000304169,0.974496,0.00004745256,0.0008055088,0.00042249242,0.00004182419,0.000026727292,0.0020369436],"genre_scores_gemma":[0.9897382,0.000036580106,0.00814415,0.000029303383,0.0017591347,0.000009998334,0.00012927296,0.00006183592,0.000091486414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961529,0.00019327557,0.0019465621,0.00040781294,0.0008085503,0.00049089245],"domain_scores_gemma":[0.9954283,0.00011503837,0.0028838422,0.0007762587,0.00061147497,0.00018508703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006330818,0.0005326286,0.0016086228,0.000301758,0.00007868694,0.00010828909,0.0010734625,0.00023127458,0.00054284796],"category_scores_gemma":[0.0000029624164,0.0004937845,0.0011641396,0.00015029285,0.00013501127,0.00007497682,0.0015734473,0.0015489404,0.0000030875642],"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.00017777165,0.0003233347,0.0027427066,0.00006658123,0.0007199921,0.000002083728,0.00008710749,0.9729733,0.000051522664,0.000493651,0.0053464337,0.017015543],"study_design_scores_gemma":[0.0006801992,0.00017257128,0.0010735246,0.00057662185,0.00047324502,0.000004373889,0.000038671107,0.9931345,0.0001255185,0.002392941,0.0009373143,0.00039049404],"about_ca_topic_score_codex":0.00019706649,"about_ca_topic_score_gemma":0.000028316259,"teacher_disagreement_score":0.9679194,"about_ca_system_score_codex":0.00017940403,"about_ca_system_score_gemma":0.00028344343,"threshold_uncertainty_score":0.9997514},"labels":[],"label_agreement":null},{"id":"W2951770249","doi":"10.1093/comnet/cnz043","title":"An unsupervised framework for comparing graph embeddings","year":2019,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":15,"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; Theoretical computer science; Artificial intelligence","score_opus":0.023040137691375067,"score_gpt":0.31281722665471623,"score_spread":0.28977708896334115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951770249","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.2550268,0.00011782526,0.74306786,0.00006542814,0.00026299377,0.00024035973,0.0000030008325,0.00003851733,0.001177221],"genre_scores_gemma":[0.9296379,0.0000072858857,0.06823294,0.00013688866,0.0018752994,0.000008224414,0.000029326708,0.000043074604,0.000029043182],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981576,0.00009192154,0.00079639297,0.00023418106,0.0002830883,0.00043681517],"domain_scores_gemma":[0.9979098,0.00033984063,0.0007353277,0.0004536957,0.0003601752,0.00020119551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005844903,0.00025562942,0.0007833348,0.0002016507,0.00014036504,0.00016775598,0.00069088273,0.00008351344,0.0008583929],"category_scores_gemma":[0.0000058500314,0.00023351178,0.00058277475,0.00038882947,0.000045421966,0.0003128385,0.00006393678,0.00052892364,0.0000060880097],"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.0004132242,0.0005321348,0.41178632,0.000031739884,0.0009372677,0.000003968277,0.00029998148,0.33064088,0.000883684,0.21277435,0.016697604,0.024998846],"study_design_scores_gemma":[0.0013427411,0.0005675916,0.016915012,0.00025180783,0.00023308593,0.000009545556,0.0003421611,0.77221537,0.00012308809,0.19589958,0.011586068,0.00051397283],"about_ca_topic_score_codex":0.000015392101,"about_ca_topic_score_gemma":0.000002452618,"teacher_disagreement_score":0.6748349,"about_ca_system_score_codex":0.00003433266,"about_ca_system_score_gemma":0.000035846784,"threshold_uncertainty_score":0.9522334},"labels":[],"label_agreement":null},{"id":"W3047166675","doi":"10.1093/comnet/cnaa012","title":"A density-based statistical analysis of graph clustering algorithm performance","year":2020,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"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":"Cluster analysis; Null model; Clustering coefficient; Computer science; Graph; Axiom; Theoretical computer science; Data mining; Cluster (spacecraft); Algorithm; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.021786691844942908,"score_gpt":0.2666106937272401,"score_spread":0.2448240018822972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047166675","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.06177028,0.000055656306,0.937682,0.0001022579,0.000041507432,0.00006462882,0.000017354525,0.00001787789,0.0002484569],"genre_scores_gemma":[0.9143463,0.00000663712,0.08488919,0.00023534444,0.0004648984,0.0000014709981,0.000038527494,0.00001542402,0.0000022007296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818087,0.00011874335,0.0008993878,0.0001686871,0.00037128862,0.00026104908],"domain_scores_gemma":[0.99824804,0.00021171436,0.0008018944,0.00020533208,0.0003269209,0.0002061146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033226356,0.0001893633,0.0008990741,0.00024291039,0.000080383514,0.000042623564,0.0003484809,0.000039569775,0.0006144417],"category_scores_gemma":[0.00000682151,0.00017288954,0.00056400074,0.0014497925,0.00008912514,0.00009796921,0.00008474004,0.0003740058,0.0000011077956],"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.00011724292,0.000114284485,0.12243677,0.000015315893,0.0024027552,0.000010283594,0.00007824653,0.8083022,0.00007776767,0.00053492445,0.0027381747,0.063172035],"study_design_scores_gemma":[0.0003536053,0.000197194,0.038938068,0.000030372266,0.0014689682,0.0000014826185,0.000030314606,0.95773727,0.000059314825,0.00023474982,0.0007991346,0.00014955895],"about_ca_topic_score_codex":0.000023576013,"about_ca_topic_score_gemma":0.000005610629,"teacher_disagreement_score":0.8527928,"about_ca_system_score_codex":0.0000215242,"about_ca_system_score_gemma":0.000050452225,"threshold_uncertainty_score":0.7050231},"labels":[],"label_agreement":null},{"id":"W3092415961","doi":"10.1093/comnet/cnaa033","title":"Modelling the impact of structural directionality on connectome-based models of neural activity","year":2020,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":5,"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":"Trent University; Nottingham Trent University","keywords":"Connectome; Attractor; Directionality; Computer science; Connectomics; Neuroscience; Robustness (evolution); Modularity (biology); Artificial neural network; Network topology; Topology (electrical circuits); Artificial intelligence; Functional connectivity; Biology; Mathematics","score_opus":0.13742240004845294,"score_gpt":0.3135844440732542,"score_spread":0.17616204402480126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092415961","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.93065065,0.000018277326,0.06818251,0.0006679714,0.00023167706,0.00010488524,0.000024496549,0.0000086553455,0.000110864625],"genre_scores_gemma":[0.99934924,0.000006603637,0.000076505465,0.0003201956,0.0002326249,4.708415e-7,0.0000011169709,0.000011094021,0.0000021511212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985723,0.00029019552,0.00042809473,0.00014446185,0.0003997163,0.00016525859],"domain_scores_gemma":[0.9980728,0.0007549711,0.00078363944,0.00013644113,0.00015766612,0.0000945023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002420747,0.00013888047,0.00034481983,0.000052834053,0.00010247002,0.000026354419,0.0002682515,0.00004506824,0.000036701058],"category_scores_gemma":[0.000097303484,0.00008232285,0.00037493542,0.0003164959,0.00011553708,0.00019594208,0.00003112218,0.00043291357,1.4386755e-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.0010415108,0.00004059195,0.00033711872,0.00000839714,0.000018102508,0.0000030179897,0.000037247646,0.96534604,0.03170793,0.00052848755,0.00010492983,0.00082663936],"study_design_scores_gemma":[0.00046918125,0.0007176238,0.005831637,0.000018804403,0.000015709042,0.000019183746,0.000004282082,0.9879026,0.0032267135,0.0017176396,0.000004380142,0.000072240815],"about_ca_topic_score_codex":0.000054043863,"about_ca_topic_score_gemma":9.522877e-7,"teacher_disagreement_score":0.06869858,"about_ca_system_score_codex":0.000043757016,"about_ca_system_score_gemma":0.0000549463,"threshold_uncertainty_score":0.33570284},"labels":[],"label_agreement":null},{"id":"W3131107340","doi":"10.1093/comnet/cnac030","title":"Evaluating node embeddings of complex networks","year":2022,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":17,"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; Embedding; Graph; Theoretical computer science; Node (physics); Set (abstract data type); Graph embedding; Topological graph theory; Machine learning; Artificial intelligence; Data mining","score_opus":0.05553973968489292,"score_gpt":0.3535089458173422,"score_spread":0.2979692061324493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131107340","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.15696825,0.0010200416,0.8323494,0.00037603127,0.0006735985,0.00045806388,0.000030786763,0.000083925486,0.008039882],"genre_scores_gemma":[0.98088354,0.000015853559,0.016750291,0.00024348643,0.0018312436,0.000019461691,0.00007481361,0.00006202201,0.000119303986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99567896,0.00057967094,0.001809914,0.00031140598,0.000997911,0.0006221245],"domain_scores_gemma":[0.99563915,0.00048478995,0.0025895638,0.0005424679,0.00054665946,0.0001973469],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022015343,0.00036669557,0.0011383006,0.0003198142,0.0005302446,0.000083327526,0.00111269,0.000056069035,0.0063991514],"category_scores_gemma":[0.000016974516,0.00036850452,0.0008350482,0.0010110257,0.00013715618,0.00018677345,0.00065360905,0.0012079652,0.0000018033573],"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.00014703946,0.00025361637,0.018349037,0.0000073851097,0.00045595906,0.000007763016,0.00013240264,0.9073238,0.00057285884,0.0033278167,0.043716177,0.025706176],"study_design_scores_gemma":[0.0010146664,0.00048395424,0.007318106,0.000066420274,0.00029867288,0.00004415059,0.00035849595,0.96737945,0.000030097919,0.0046466123,0.017992763,0.00036663873],"about_ca_topic_score_codex":0.00007834585,"about_ca_topic_score_gemma":0.0000038777994,"teacher_disagreement_score":0.8239153,"about_ca_system_score_codex":0.00014406566,"about_ca_system_score_gemma":0.00011265597,"threshold_uncertainty_score":0.9998767},"labels":[],"label_agreement":null},{"id":"W4206988418","doi":"10.1093/comnet/cnac003","title":"An empirical comparison of connectivity-based distances on a graph and their computational scalability","year":2021,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Jaccard index; Pairwise comparison; Vertex (graph theory); Computer science; Distance matrix; Scalability; Geodesic; Computation; Neighbourhood (mathematics); Cluster analysis; Inverse; Cluster (spacecraft); Distance; Mathematics; Shortest path problem; Theoretical computer science; Algorithm; Graph; Artificial intelligence","score_opus":0.031846712804735285,"score_gpt":0.34889928119773794,"score_spread":0.31705256839300267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206988418","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.50472754,0.00019819956,0.4945382,0.00017691434,0.00004060489,0.000050399696,0.000012779529,0.000010830723,0.0002445371],"genre_scores_gemma":[0.992229,0.0000024837245,0.007304595,0.000110690635,0.00029207693,0.0000021066164,0.000045597553,0.000012114359,0.0000013225778],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981964,0.00040529546,0.00072874327,0.000213499,0.0002696832,0.00018635615],"domain_scores_gemma":[0.9975925,0.000879531,0.0006543565,0.00024665467,0.00048813884,0.00013878918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047275866,0.000188153,0.0007327402,0.000102693186,0.00012433178,0.00006425818,0.00019360307,0.000045608427,0.00017078668],"category_scores_gemma":[0.000012159648,0.00015193589,0.0002914773,0.00038753156,0.00019595084,0.00010518007,0.000036808797,0.00036796945,1.8698758e-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.0001699203,0.0011986762,0.53780586,0.000011409143,0.0001949859,0.0000024709545,0.0001448393,0.43272966,0.00013548408,0.0041100695,0.001684708,0.021811897],"study_design_scores_gemma":[0.00070431235,0.00047621204,0.18943682,0.00009358854,0.00006747031,0.000004636826,0.00031133392,0.7621193,0.0005000669,0.04503292,0.001063175,0.00019013896],"about_ca_topic_score_codex":0.000008756249,"about_ca_topic_score_gemma":0.000021267142,"teacher_disagreement_score":0.48750147,"about_ca_system_score_codex":0.000025761885,"about_ca_system_score_gemma":0.0001005918,"threshold_uncertainty_score":0.6195766},"labels":[],"label_agreement":null},{"id":"W4226365174","doi":"10.1093/comnet/cnac011","title":"Gauging node consistency in accusation–endorsement networks","year":2022,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":0,"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 British Columbia","funders":"","keywords":"Consistency (knowledge bases); Computer science; Node (physics); Task (project management); Relevance (law); False accusation; Judgement; Enhanced Data Rates for GSM Evolution; Data mining; Range (aeronautics); Variety (cybernetics); Theoretical computer science; Machine learning; Artificial intelligence; Psychology; Social psychology","score_opus":0.021903527873929202,"score_gpt":0.2786115619194021,"score_spread":0.25670803404547293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226365174","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.58589596,0.0014418773,0.37848017,0.0026069933,0.0045389202,0.00057842693,0.00003873258,0.000029574105,0.026389357],"genre_scores_gemma":[0.9983766,0.000018691138,0.00048858474,0.0003448673,0.0006824857,0.000008640655,0.000016861955,0.000012076983,0.000051184194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986317,0.00013901202,0.00061831134,0.00010282103,0.00025194316,0.000256188],"domain_scores_gemma":[0.9991035,0.0001089984,0.0005025542,0.00011780275,0.00009281939,0.00007435553],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00054514967,0.00010997835,0.00027100742,0.000095384494,0.00028202072,0.000054578362,0.0002586148,0.000020336878,0.0013984258],"category_scores_gemma":[0.0000037373404,0.00011345568,0.00015474204,0.00027802933,0.000035225807,0.00010660258,0.00012641899,0.0005672063,9.803584e-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.000022673274,0.000097621174,0.07782938,0.0000013967555,0.000043047672,0.000008006838,0.00018361822,0.891601,0.000009348697,0.020788973,0.0017159111,0.0076989694],"study_design_scores_gemma":[0.0013537849,0.000114582224,0.066802055,0.000047202142,0.000026006574,0.000012378711,0.0015863983,0.9068846,8.934034e-7,0.0066113356,0.016299292,0.00026143205],"about_ca_topic_score_codex":0.00008921779,"about_ca_topic_score_gemma":0.0000071117815,"teacher_disagreement_score":0.41248065,"about_ca_system_score_codex":0.000103106184,"about_ca_system_score_gemma":0.00007932958,"threshold_uncertainty_score":0.99951446},"labels":[],"label_agreement":null},{"id":"W4310220416","doi":"10.1093/comnet/cnac054","title":"Controllability of a class of swarm signalling networks","year":2022,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Ottawa","funders":"China Scholarship Council","keywords":"Controllability; Degree (music); Computer science; Class (philosophy); Fraction (chemistry); Degree distribution; Swarm behaviour; Complex network; Modal; Distribution (mathematics); Mathematical optimization; Topology (electrical circuits); Mathematics; Applied mathematics; Artificial intelligence; Combinatorics; Physics; Mathematical analysis","score_opus":0.015717435576237556,"score_gpt":0.25922754359335876,"score_spread":0.2435101080171212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310220416","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.22852078,0.0012890126,0.7672017,0.00014822377,0.000306422,0.0003037562,0.000022354596,0.000023412063,0.0021843219],"genre_scores_gemma":[0.9967557,0.0000149867265,0.002239074,0.00005634527,0.0008479701,0.0000105245945,0.000018292396,0.000028241204,0.00002884807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660414,0.0004813457,0.0017450018,0.00020012925,0.00060128537,0.00036810976],"domain_scores_gemma":[0.9958138,0.00059953245,0.0025094547,0.00039140906,0.00056075916,0.00012507135],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017300417,0.00023682612,0.0011690593,0.00020606097,0.00017601326,0.00002335858,0.0007382785,0.000047875663,0.0014611593],"category_scores_gemma":[0.000012479071,0.00022693496,0.0008272561,0.0007413282,0.00014994346,0.00010224998,0.00030142668,0.00082081516,2.2470182e-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.00033083925,0.00038410418,0.027232392,0.000010287245,0.0004727568,0.0000036017132,0.00007824092,0.955147,0.0005982165,0.0047706794,0.0043075355,0.0066643446],"study_design_scores_gemma":[0.0016290541,0.0007182,0.0047022365,0.00006331614,0.0003942478,0.000014220859,0.0003711555,0.970955,0.0003059368,0.010916466,0.00962912,0.00030102636],"about_ca_topic_score_codex":0.00006617146,"about_ca_topic_score_gemma":0.0000054733564,"teacher_disagreement_score":0.7682349,"about_ca_system_score_codex":0.00008176693,"about_ca_system_score_gemma":0.000111978356,"threshold_uncertainty_score":0.99945164},"labels":[],"label_agreement":null},{"id":"W4312051729","doi":"10.1093/comnet/cnac050","title":"Modularity of the ABCD random graph model with community structure","year":2022,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"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":"Community structure; Modularity (biology); Random graph; Computer science; Clique percolation method; Graph; Theoretical computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.015242635359691042,"score_gpt":0.23832019864301532,"score_spread":0.2230775632833243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312051729","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.54389113,0.00013483835,0.45454735,0.00015279613,0.00009118081,0.00019610317,0.00004376808,0.000013239163,0.00092961127],"genre_scores_gemma":[0.9963419,0.0000024790131,0.0032712438,0.00010185788,0.00020538532,0.000004828539,0.000017984708,0.000020072834,0.000034235287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978622,0.0007138754,0.0005928187,0.000094296796,0.0005147574,0.00022202852],"domain_scores_gemma":[0.9978842,0.00015870508,0.0010558558,0.0005861685,0.00024751975,0.000067544905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007367821,0.00018293074,0.00055843155,0.00009694878,0.00067377667,0.00003142533,0.0010393895,0.00002732391,0.00036105327],"category_scores_gemma":[0.0000028400837,0.00012023001,0.00044187345,0.00056811195,0.0001476464,0.000089143556,0.00040553696,0.0016752863,4.1034507e-8],"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.00023899418,0.00016333094,0.017723532,0.0000045360284,0.0003181302,8.2654e-7,0.0001856656,0.97172326,0.00021476703,0.0035992379,0.0043993895,0.0014283289],"study_design_scores_gemma":[0.002128633,0.00023745076,0.012275535,0.000051140494,0.00032835372,0.000032865995,0.00038584007,0.8825423,0.00011561108,0.10034564,0.0013218538,0.00023473891],"about_ca_topic_score_codex":0.0001590295,"about_ca_topic_score_gemma":0.000045094537,"teacher_disagreement_score":0.45245078,"about_ca_system_score_codex":0.00004360664,"about_ca_system_score_gemma":0.00008583611,"threshold_uncertainty_score":0.72783786},"labels":[],"label_agreement":null},{"id":"W4383067313","doi":"10.1093/comnet/cnad024","title":"PageRank centrality with non-local random walk-based teleportation","year":2023,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Centrality; PageRank; Computer science; Katz centrality; Network science; Random walk; Measure (data warehouse); Theoretical computer science; Teleportation; Network theory; Flexibility (engineering); Node (physics); Complex network; Data mining; Quantum entanglement; Mathematics; World Wide Web; Physics; Quantum","score_opus":0.01279907006304856,"score_gpt":0.2633192313849608,"score_spread":0.25052016132191224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383067313","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.135468,0.000036531626,0.8628171,0.00027795217,0.00011886942,0.00017927548,0.000004043963,0.000068438014,0.0010297957],"genre_scores_gemma":[0.99563366,0.000008348075,0.0031123536,0.00009696102,0.00095392985,0.000009374652,0.000090656,0.000029895184,0.00006479201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980343,0.0001397584,0.0007806839,0.0001832151,0.0004498067,0.00041223533],"domain_scores_gemma":[0.9982028,0.00026116878,0.0007749516,0.0002713275,0.00032264058,0.00016711213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000757986,0.00022475122,0.00058529846,0.00019025811,0.00015896394,0.00009030977,0.00028014614,0.00004911007,0.00046176757],"category_scores_gemma":[0.0000045935667,0.00017347244,0.00035435095,0.000836967,0.00009635015,0.00015138922,0.000029770934,0.0004148011,0.000008364222],"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.00053867843,0.00015833028,0.06916305,0.000010916168,0.00040524467,0.00006369841,0.00006829595,0.8415268,0.000109672954,0.0005708347,0.042640936,0.044743553],"study_design_scores_gemma":[0.0035876685,0.0002368991,0.08626839,0.00013745768,0.0002586221,0.000010980872,0.00013066805,0.8974523,0.0002152311,0.0026007404,0.0087663,0.00033472473],"about_ca_topic_score_codex":0.000057559722,"about_ca_topic_score_gemma":0.00001896346,"teacher_disagreement_score":0.86016566,"about_ca_system_score_codex":0.000046585188,"about_ca_system_score_gemma":0.00010263606,"threshold_uncertainty_score":0.7074},"labels":[],"label_agreement":null},{"id":"W4385687128","doi":"10.1093/comnet/cnad028","title":"Hypergraph Artificial Benchmark for Community Detection (h–ABCD)","year":2023,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":28,"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":"Hypergraph; Benchmark (surveying); Computer science; Community structure; Graph; Ground truth; Random graph; Algorithm; Theoretical computer science; Artificial intelligence; Discrete mathematics; Mathematics; Combinatorics; Cartography","score_opus":0.04547895218473307,"score_gpt":0.3071416032323553,"score_spread":0.2616626510476222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385687128","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.2871298,0.000062888765,0.7102544,0.00019537871,0.00048864784,0.00024549846,0.000011888762,0.00010234055,0.0015092094],"genre_scores_gemma":[0.99572766,0.000011445941,0.0016979412,0.000055370325,0.0023512444,0.000017803626,0.00005925551,0.000028089511,0.000051217798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983343,0.00024545973,0.00071708823,0.00011340958,0.00022962729,0.0003601137],"domain_scores_gemma":[0.9981385,0.0005362593,0.0005734802,0.00030573533,0.00033214764,0.00011387008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012737022,0.00018367665,0.00045068533,0.00030300897,0.00050771027,0.00009183804,0.00041104492,0.00006201972,0.00019166595],"category_scores_gemma":[0.00001834927,0.00017216036,0.000559803,0.0008539359,0.00006723538,0.00014111878,0.000091826274,0.0006213368,0.000005859461],"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.00056752923,0.00065742485,0.020369032,0.000035825786,0.0013516797,0.0000081554845,0.00045890696,0.17571183,0.007279351,0.015780393,0.18581113,0.5919688],"study_design_scores_gemma":[0.001158203,0.0008578743,0.03810963,0.000121889854,0.00045857189,0.000019852057,0.0009171013,0.63334715,0.0015425887,0.24234147,0.080455594,0.0006700797],"about_ca_topic_score_codex":0.000059362028,"about_ca_topic_score_gemma":0.000055435445,"teacher_disagreement_score":0.70859784,"about_ca_system_score_codex":0.000035034664,"about_ca_system_score_gemma":0.00003011448,"threshold_uncertainty_score":0.70204955},"labels":[],"label_agreement":null},{"id":"W4392774981","doi":"10.1093/comnet/cnae003","title":"Unsupervised framework for evaluating and explaining structural node embeddings of graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Advanced Graph Neural Networks","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Embedding; Node (physics); Theoretical computer science; Graph; Set (abstract data type); Data mining; Artificial intelligence","score_opus":0.052181983397978984,"score_gpt":0.3594490573058519,"score_spread":0.30726707390787295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392774981","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.12670901,0.0044884905,0.8670892,0.00035700938,0.0011170179,0.00015966703,0.0000021269223,0.000050890107,0.000026553056],"genre_scores_gemma":[0.62101465,0.00008477577,0.37845787,0.00015465553,0.000264232,0.0000028037928,9.970067e-7,0.000017005412,0.0000030371086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800557,0.00009558638,0.0008074018,0.00029112727,0.0004100817,0.00039024462],"domain_scores_gemma":[0.9970822,0.0017345971,0.0004760911,0.0002646722,0.000292782,0.00014967419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007889205,0.00022097846,0.00047851398,0.00025192383,0.00016060355,0.00022493352,0.00069037714,0.00012009178,0.000010836604],"category_scores_gemma":[0.00014469156,0.00018201805,0.00025762856,0.0007058849,0.00010293854,0.00075384,0.0001778112,0.0006008901,1.8929634e-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.00019298801,0.000020371219,0.0014108602,0.0002032969,0.00027145402,0.000069474205,0.0017904865,0.38941866,0.0017951083,0.34692502,0.0011680175,0.25673425],"study_design_scores_gemma":[0.0003487881,0.0003297858,0.0011889182,0.00056804856,0.00003442279,0.00018426422,0.000050179442,0.80662334,0.000052099003,0.19028617,0.00017939336,0.00015455493],"about_ca_topic_score_codex":9.59616e-7,"about_ca_topic_score_gemma":6.457636e-7,"teacher_disagreement_score":0.4943056,"about_ca_system_score_codex":0.000026776595,"about_ca_system_score_gemma":0.00004827902,"threshold_uncertainty_score":0.74224806},"labels":[],"label_agreement":null},{"id":"W4402162138","doi":"10.1093/comnet/cnae035","title":"Performance of community detection algorithms supported by node embeddings","year":2024,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"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; Partition (number theory); Cluster analysis; Algorithm; Embedding; Complex network; Artificial intelligence; Mathematics","score_opus":0.01644240105669042,"score_gpt":0.28135729733893694,"score_spread":0.2649148962822465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402162138","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.6503716,0.00037923997,0.34739226,0.00006167955,0.0002279461,0.000075737706,0.000010663295,0.000047907222,0.001432947],"genre_scores_gemma":[0.9976342,0.000047816786,0.001508443,0.000032319444,0.0006330289,0.0000030057695,0.000033068587,0.000027038383,0.00008111911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842304,0.0001729885,0.0007826263,0.0000925495,0.0002806366,0.0002481365],"domain_scores_gemma":[0.99871314,0.00019615123,0.00048745528,0.0002590013,0.0002519463,0.000092301154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081149535,0.00018545185,0.00046172316,0.00018361528,0.00016092381,0.00007789387,0.0003829931,0.000057658788,0.00046335283],"category_scores_gemma":[0.000003710069,0.00016510008,0.00033254284,0.0005297533,0.00008726399,0.00025671904,0.00008977649,0.00092737813,0.0000027942613],"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.00022445004,0.00068895495,0.028866949,0.00015277206,0.0019231898,0.000009857923,0.00089360675,0.06064666,0.028212834,0.00065254857,0.17469177,0.7030364],"study_design_scores_gemma":[0.00031086302,0.00037013832,0.0051378235,0.00022840616,0.0002369413,0.00003124937,0.0001693248,0.96767837,0.0061628064,0.0010983627,0.01834236,0.00023335486],"about_ca_topic_score_codex":0.0001026627,"about_ca_topic_score_gemma":0.000004266688,"teacher_disagreement_score":0.9070317,"about_ca_system_score_codex":0.00005133745,"about_ca_system_score_gemma":0.000038573973,"threshold_uncertainty_score":0.6732586},"labels":[],"label_agreement":null},{"id":"W4403587905","doi":"10.1093/comnet/cnae041","title":"Modularity based community detection in hypergraphs","year":2024,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"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":"Modularity (biology); Computer science; Theoretical computer science; Evolutionary biology","score_opus":0.02080883243451563,"score_gpt":0.28173336459266696,"score_spread":0.2609245321581513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403587905","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.25965443,0.00047131677,0.7373991,0.00012838496,0.0002572368,0.000091114656,0.0000026718487,0.000054281678,0.0019414397],"genre_scores_gemma":[0.9974769,0.000008735391,0.0017766852,0.000058142887,0.0006305649,0.000004389613,0.000010181091,0.000020359934,0.000014087216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844056,0.00041680172,0.00058997865,0.00010764805,0.00021131885,0.00023366403],"domain_scores_gemma":[0.9990464,0.00029293913,0.00019259886,0.0002666497,0.00012072849,0.00008070228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011027602,0.00016142282,0.00036920502,0.00037528458,0.00012766094,0.00012636792,0.00032052243,0.000056104138,0.0002667495],"category_scores_gemma":[0.000006211457,0.00014685935,0.0003622497,0.0008117549,0.000053527277,0.0001811636,0.00005726073,0.0013138561,0.000002412228],"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.00018115611,0.0008921552,0.0763833,0.00006323368,0.000598838,0.000065643035,0.00027450526,0.4659853,0.0024309945,0.0089856945,0.009948504,0.43419066],"study_design_scores_gemma":[0.00032079808,0.00012162819,0.02731664,0.00018047303,0.00007608751,0.000010272893,0.00006627328,0.9398539,0.00026111072,0.023914037,0.0077009243,0.00017787432],"about_ca_topic_score_codex":0.00029125792,"about_ca_topic_score_gemma":0.00015956987,"teacher_disagreement_score":0.7378224,"about_ca_system_score_codex":0.00007358329,"about_ca_system_score_gemma":0.000048280053,"threshold_uncertainty_score":0.59887505},"labels":[],"label_agreement":null},{"id":"W4412936426","doi":"10.1093/comnet/cnaf008","title":"Two models of sparse and clustered dynamic networks","year":2025,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"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":"Information Technology Research Centre","keywords":"Combinatorics; Adjacency matrix; Markov chain; Prime (order theory); Bipartite graph; Mathematics; Transitive relation; Discrete mathematics; Graph; Statistics","score_opus":0.015479678029741838,"score_gpt":0.2885903414612192,"score_spread":0.2731106634314774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412936426","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.045513604,0.001822706,0.9459131,0.00015458663,0.00018881245,0.00015848043,0.0000036394244,0.000020660922,0.006224441],"genre_scores_gemma":[0.9912983,0.00014322792,0.007891242,0.00010592538,0.00037156808,0.000003545771,0.000011962146,0.000020412846,0.00015380251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998075,0.00014897909,0.0010402628,0.00019559124,0.00021160128,0.00032856798],"domain_scores_gemma":[0.99813074,0.00023582041,0.00085687125,0.00034817826,0.00031529862,0.0001130843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005288363,0.00024475923,0.00080074894,0.00026825318,0.00010477392,0.00006533245,0.0004104518,0.000066752276,0.000119954304],"category_scores_gemma":[0.000003914048,0.00022246473,0.0003383674,0.00051370135,0.00013773408,0.00019719372,0.00022049331,0.00048136007,2.7173053e-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.0001302204,0.00013415322,0.010543817,0.000012631336,0.0005641347,0.0000040827404,0.000043114134,0.8986695,0.000054890526,0.02780159,0.007439624,0.054602284],"study_design_scores_gemma":[0.0008926616,0.00007238323,0.0036052566,0.00020390618,0.00023816717,0.000007641976,0.00006923526,0.9469403,0.000012736354,0.046817683,0.0009781538,0.00016187545],"about_ca_topic_score_codex":0.000053321364,"about_ca_topic_score_gemma":0.000027893373,"teacher_disagreement_score":0.9457847,"about_ca_system_score_codex":0.000039373415,"about_ca_system_score_gemma":0.00005966272,"threshold_uncertainty_score":0.90718484},"labels":[],"label_agreement":null},{"id":"W4415202877","doi":"10.1093/comnet/cnaf021","title":"Counting simplicial pairs in hypergraphs","year":2025,"lang":"en","type":"article","venue":"Journal of Complex Networks","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"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 Ottawa; University of Toronto","funders":"","keywords":"Simplicial manifold; Simplicial homology; h-vector; Simplicial complex; Simplicial approximation theorem; Abstract simplicial complex","score_opus":0.015927756605140543,"score_gpt":0.26407577445249164,"score_spread":0.2481480178473511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415202877","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.02999748,0.0009202975,0.96206903,0.0025583832,0.0005338943,0.000040660772,7.905608e-7,0.00002154596,0.0038579002],"genre_scores_gemma":[0.9918594,0.000092122864,0.0067382054,0.0010821893,0.0001627289,5.66539e-7,9.670543e-7,0.000001847187,0.0000620154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875385,0.00008401593,0.0005496337,0.00014063847,0.00022517999,0.00024667478],"domain_scores_gemma":[0.99903077,0.0003165889,0.00025317108,0.0002132563,0.00012648717,0.000059720183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007305619,0.00009238781,0.00032580987,0.0006156807,0.000073966505,0.00012088479,0.0009957167,0.000062906925,0.000038643077],"category_scores_gemma":[0.00012472703,0.000069716705,0.0001618034,0.002956953,0.00004080461,0.00027258787,0.00021674445,0.0003058324,0.0000024772116],"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.00006485769,0.00040174634,0.13185193,0.000014880484,0.00024699766,0.0002584664,0.00009792227,0.11606985,0.00009418333,0.21283185,0.05455587,0.48351145],"study_design_scores_gemma":[0.0010259888,0.00017854737,0.3597928,0.000090850655,0.00004668785,0.000056677763,0.000073979005,0.50278556,0.0000100724,0.04895902,0.08672464,0.0002551603],"about_ca_topic_score_codex":0.00003017779,"about_ca_topic_score_gemma":0.00003195158,"teacher_disagreement_score":0.96186185,"about_ca_system_score_codex":0.000034074248,"about_ca_system_score_gemma":0.000042293035,"threshold_uncertainty_score":0.28429648},"labels":[],"label_agreement":null}]}