{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":19,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":19,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"e78c104dd5eb","filters":{"venue":"Journal of Complex Networks"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07814062192789892,"gpt":0.329450734410807,"spread":0.251310112482908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009307479,0.0003511613,0.0007892142,0.0001227511,0.0002447824,0.000179967,0.0007005485,0.0001039852,0.001067363],"category_scores_gemma":[0.00001114539,0.0003196638,0.0005463835,0.0004922891,0.0001207147,0.0002422768,0.0001550189,0.0007156435,0.00001099206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006087159,"about_ca_system_score_gemma":0.00006833092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002722884,"about_ca_topic_score_gemma":0.00002728751,"domain_scores_codex":[0.9973033,0.0003486453,0.001034773,0.0002629757,0.0003966005,0.000653704],"domain_scores_gemma":[0.9975296,0.0003226294,0.001047717,0.0004436862,0.0004028905,0.0002534334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001913016,0.0001186096,0.004868802,0.000003572793,0.0003193596,0.000005505387,0.00001268236,0.9188513,0.00002043887,0.004388168,0.051502,0.01971827],"study_design_scores_gemma":[0.00239782,0.0003397639,0.004175202,0.00007722705,0.0002805485,0.00001474015,0.000040355,0.9530562,0.00001412785,0.001687207,0.03749692,0.0004198654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02532384,0.000249529,0.9677278,0.0001118468,0.0009727933,0.0001356365,0.000002529619,0.00005941934,0.005416537],"genre_scores_gemma":[0.9721959,0.00001228438,0.01855447,0.00008163891,0.008915349,0.000005274243,0.00003151784,0.00004889771,0.0001546885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9491734,"threshold_uncertainty_score":0.9999256,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04547895218473307,"gpt":0.3071416032323553,"spread":0.2616626510476222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273702,0.0001836766,0.0004506853,0.000303009,0.0005077103,0.00009183804,0.0004110449,0.00006201972,0.000191666],"category_scores_gemma":[0.00001834927,0.0001721604,0.000559803,0.0008539359,0.00006723538,0.0001411188,0.00009182627,0.0006213368,0.000005859461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003503466,"about_ca_system_score_gemma":0.00003011448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005936203,"about_ca_topic_score_gemma":0.00005543544,"domain_scores_codex":[0.9983343,0.0002454597,0.0007170882,0.0001134096,0.0002296273,0.0003601137],"domain_scores_gemma":[0.9981385,0.0005362593,0.0005734802,0.0003057353,0.0003321476,0.0001138701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005675292,0.0006574249,0.02036903,0.00003582579,0.00135168,0.000008155484,0.000458907,0.1757118,0.007279351,0.01578039,0.1858111,0.5919688],"study_design_scores_gemma":[0.001158203,0.0008578743,0.03810963,0.0001218899,0.0004585719,0.00001985206,0.0009171013,0.6333472,0.001542589,0.2423415,0.08045559,0.0006700797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2871298,0.00006288876,0.7102544,0.0001953787,0.0004886478,0.0002454985,0.00001188876,0.0001023405,0.001509209],"genre_scores_gemma":[0.9957277,0.00001144594,0.001697941,0.00005537032,0.002351244,0.00001780363,0.00005925551,0.00002808951,0.0000512178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7085978,"threshold_uncertainty_score":0.7020496,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01524263535969104,"gpt":0.2383201986430153,"spread":0.2230775632833243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007367821,0.0001829307,0.0005584316,0.00009694878,0.0006737767,0.00003142533,0.00103939,0.00002732391,0.0003610533],"category_scores_gemma":[0.000002840084,0.00012023,0.0004418734,0.000568112,0.0001476464,0.00008914356,0.000405537,0.001675286,4.103451e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004360664,"about_ca_system_score_gemma":0.00008583611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001590295,"about_ca_topic_score_gemma":0.00004509454,"domain_scores_codex":[0.9978622,0.0007138754,0.0005928187,0.0000942968,0.0005147574,0.0002220285],"domain_scores_gemma":[0.9978842,0.0001587051,0.001055856,0.0005861685,0.0002475198,0.0000675449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002389942,0.0001633309,0.01772353,0.000004536028,0.0003181302,8.2654e-7,0.0001856656,0.9717233,0.000214767,0.003599238,0.004399389,0.001428329],"study_design_scores_gemma":[0.002128633,0.0002374508,0.01227553,0.00005114049,0.0003283537,0.000032866,0.0003858401,0.8825423,0.0001156111,0.1003456,0.001321854,0.0002347389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5438911,0.0001348384,0.4545473,0.0001527961,0.00009118081,0.0001961032,0.00004376808,0.00001323916,0.0009296113],"genre_scores_gemma":[0.9963419,0.000002479013,0.003271244,0.0001018579,0.0002053853,0.000004828539,0.00001798471,0.00002007283,0.00003423529],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4524508,"threshold_uncertainty_score":0.7278379,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0569844298999803,"gpt":0.3639085522797237,"spread":0.3069241223797434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001274436,0.0003513088,0.0008408808,0.000125607,0.0008967034,0.0006884276,0.003437891,0.00007760053,0.0006438206],"category_scores_gemma":[0.0000335406,0.0003181495,0.0003929742,0.0001570591,0.0002268883,0.0009011755,0.001319666,0.000947605,0.00000658417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004566659,"about_ca_system_score_gemma":0.0000748431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002231348,"about_ca_topic_score_gemma":0.00006464886,"domain_scores_codex":[0.9972434,0.000159611,0.001125503,0.0003855055,0.0004436302,0.0006423315],"domain_scores_gemma":[0.9942487,0.0002441893,0.002491161,0.002390366,0.0003624832,0.0002630755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001672442,0.0003334319,0.2317352,0.0000102167,0.001174544,0.0001239318,0.00006629215,0.4087475,0.00008664962,0.01964661,0.1314249,0.2064834],"study_design_scores_gemma":[0.001075296,0.00006863561,0.01231721,0.0001995042,0.0002619451,0.00005183148,0.00005471833,0.9519457,0.00001805034,0.007731598,0.0258506,0.0004248644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02618181,0.0005561896,0.9534218,0.0005026803,0.0006456609,0.000183268,0.00002257828,0.00005795199,0.01842806],"genre_scores_gemma":[0.9784394,0.00005596786,0.01183139,0.0001231651,0.009285593,0.000002816313,0.00009576001,0.00005326828,0.00011262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9522576,"threshold_uncertainty_score":0.999927,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02178669184494291,"gpt":0.2666106937272401,"spread":0.2448240018822972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003322636,0.0001893633,0.0008990741,0.0002429104,0.00008038351,0.00004262356,0.0003484809,0.00003956978,0.0006144417],"category_scores_gemma":[0.00000682151,0.0001728895,0.0005640007,0.001449793,0.00008912514,0.00009796921,0.00008474004,0.0003740058,0.000001107796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000215242,"about_ca_system_score_gemma":0.00005045222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002357601,"about_ca_topic_score_gemma":0.000005610629,"domain_scores_codex":[0.9981809,0.0001187434,0.0008993878,0.0001686871,0.0003712886,0.0002610491],"domain_scores_gemma":[0.998248,0.0002117144,0.0008018944,0.0002053321,0.0003269209,0.0002061146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001172429,0.0001142845,0.1224368,0.00001531589,0.002402755,0.00001028359,0.00007824653,0.8083022,0.00007776767,0.0005349244,0.002738175,0.06317203],"study_design_scores_gemma":[0.0003536053,0.000197194,0.03893807,0.00003037227,0.001468968,0.000001482618,0.00003031461,0.9577373,0.00005931483,0.0002347498,0.0007991346,0.000149559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06177028,0.00005565631,0.937682,0.0001022579,0.00004150743,0.00006462882,0.00001735452,0.00001787789,0.0002484569],"genre_scores_gemma":[0.9143463,0.00000663712,0.08488919,0.0002353444,0.0004648984,0.000001470998,0.00003852749,0.00001542402,0.00000220073],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8527928,"threshold_uncertainty_score":0.7050231,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05553973968489292,"gpt":0.3535089458173422,"spread":0.2979692061324493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002201534,0.0003666956,0.001138301,0.0003198142,0.0005302446,0.00008332753,0.00111269,0.00005606904,0.006399151],"category_scores_gemma":[0.00001697452,0.0003685045,0.0008350482,0.001011026,0.0001371562,0.0001867735,0.0006536091,0.001207965,0.000001803357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001440657,"about_ca_system_score_gemma":0.000112656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007834585,"about_ca_topic_score_gemma":0.000003877799,"domain_scores_codex":[0.995679,0.0005796709,0.001809914,0.000311406,0.000997911,0.0006221245],"domain_scores_gemma":[0.9956391,0.00048479,0.002589564,0.0005424679,0.0005466595,0.0001973469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001470395,0.0002536164,0.01834904,0.00000738511,0.0004559591,0.000007763016,0.0001324026,0.9073238,0.0005728588,0.003327817,0.04371618,0.02570618],"study_design_scores_gemma":[0.001014666,0.0004839542,0.007318106,0.00006642027,0.0002986729,0.00004415059,0.0003584959,0.9673795,0.00003009792,0.004646612,0.01799276,0.0003666387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1569683,0.001020042,0.8323494,0.0003760313,0.0006735985,0.0004580639,0.00003078676,0.00008392549,0.008039882],"genre_scores_gemma":[0.9808835,0.00001585356,0.01675029,0.0002434864,0.001831244,0.00001946169,0.00007481361,0.00006202201,0.000119304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8239153,"threshold_uncertainty_score":0.9998767,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02304013769137507,"gpt":0.3128172266547162,"spread":0.2897770889633411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005844903,0.0002556294,0.0007833348,0.0002016507,0.000140365,0.000167756,0.0006908827,0.00008351344,0.0008583929],"category_scores_gemma":[0.000005850031,0.0002335118,0.0005827748,0.0003888295,0.00004542197,0.0003128385,0.00006393678,0.0005289236,0.00000608801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003433266,"about_ca_system_score_gemma":0.00003584678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000153921,"about_ca_topic_score_gemma":0.000002452618,"domain_scores_codex":[0.9981576,0.00009192154,0.000796393,0.0002341811,0.0002830883,0.0004368152],"domain_scores_gemma":[0.9979098,0.0003398406,0.0007353277,0.0004536957,0.0003601752,0.0002011955],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004132242,0.0005321348,0.4117863,0.00003173988,0.0009372677,0.000003968277,0.0002999815,0.3306409,0.000883684,0.2127744,0.0166976,0.02499885],"study_design_scores_gemma":[0.001342741,0.0005675916,0.01691501,0.0002518078,0.0002330859,0.000009545556,0.0003421611,0.7722154,0.0001230881,0.1958996,0.01158607,0.0005139728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2550268,0.0001178253,0.7430679,0.00006542814,0.0002629938,0.0002403597,0.000003000833,0.00003851733,0.001177221],"genre_scores_gemma":[0.9296379,0.000007285886,0.06823294,0.0001368887,0.001875299,0.000008224414,0.00002932671,0.0000430746,0.00002904318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6748349,"threshold_uncertainty_score":0.9522334,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Modularity (biology); Computer science; Theoretical computer science; Evolutionary biology","retraction":null,"screen_n_in":null,"score":{"opus":0.02080883243451563,"gpt":0.281733364592667,"spread":0.2609245321581513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110276,0.0001614228,0.000369205,0.0003752846,0.0001276609,0.0001263679,0.0003205224,0.00005610414,0.0002667495],"category_scores_gemma":[0.000006211457,0.0001468594,0.0003622497,0.0008117549,0.00005352728,0.0001811636,0.00005726073,0.001313856,0.000002412228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007358329,"about_ca_system_score_gemma":0.00004828005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002912579,"about_ca_topic_score_gemma":0.0001595699,"domain_scores_codex":[0.9984406,0.0004168017,0.0005899786,0.000107648,0.0002113189,0.000233664],"domain_scores_gemma":[0.9990464,0.0002929391,0.0001925989,0.0002666497,0.0001207285,0.00008070228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001811561,0.0008921552,0.0763833,0.00006323368,0.000598838,0.00006564303,0.0002745053,0.4659853,0.002430995,0.008985694,0.009948504,0.4341907],"study_design_scores_gemma":[0.0003207981,0.0001216282,0.02731664,0.000180473,0.00007608751,0.00001027289,0.00006627328,0.9398539,0.0002611107,0.02391404,0.007700924,0.0001778743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2596544,0.0004713168,0.7373991,0.000128385,0.0002572368,0.00009111466,0.000002671849,0.00005428168,0.00194144],"genre_scores_gemma":[0.9974769,0.000008735391,0.001776685,0.00005814289,0.0006305649,0.000004389613,0.00001018109,0.00002035993,0.00001408722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7378224,"threshold_uncertainty_score":0.598875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02803379139131883,"gpt":0.2714451608391518,"spread":0.243411369447833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007835136,0.0002203067,0.0003564194,0.00006138664,0.00008368903,0.00007986929,0.0004618009,0.0002903089,0.00003722277],"category_scores_gemma":[0.00004183502,0.0001881473,0.0002002511,0.0001524518,0.0001751531,0.00001316851,0.0002066447,0.0005701182,0.000006690119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000985455,"about_ca_system_score_gemma":0.0002473052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001180673,"about_ca_topic_score_gemma":0.0001019917,"domain_scores_codex":[0.9982963,0.000158538,0.0006069853,0.0002002409,0.0003221738,0.0004158045],"domain_scores_gemma":[0.9982105,0.00002949702,0.0003688737,0.000340899,0.0006758644,0.0003743732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002031656,0.0001810839,0.0008666678,0.00000810174,0.000575554,0.00007342733,0.0005187248,0.8152006,0.00212393,0.001899609,0.1593747,0.01714589],"study_design_scores_gemma":[0.005118329,0.002723116,0.003084128,0.0001979701,0.000123621,0.0003650516,0.003823488,0.8919533,0.0009792846,0.007222082,0.08353782,0.0008718009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08456375,0.00594996,0.9046215,0.0007166459,0.0005017053,0.0002716019,0.000009381855,0.000009880363,0.003355532],"genre_scores_gemma":[0.990452,0.0001287174,0.005212446,0.0005931659,0.003306812,0.000003673259,0.00004752756,0.00003229801,0.0002233645],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9058883,"threshold_uncertainty_score":0.7672423,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01279907006304856,"gpt":0.2633192313849608,"spread":0.2505201613219122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000757986,0.0002247512,0.0005852985,0.0001902581,0.0001589639,0.00009030977,0.0002801461,0.00004911007,0.0004617676],"category_scores_gemma":[0.000004593567,0.0001734724,0.000354351,0.000836967,0.00009635015,0.0001513892,0.00002977093,0.0004148011,0.000008364222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004658519,"about_ca_system_score_gemma":0.0001026361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005755972,"about_ca_topic_score_gemma":0.00001896346,"domain_scores_codex":[0.9980343,0.0001397584,0.0007806839,0.0001832151,0.0004498067,0.0004122353],"domain_scores_gemma":[0.9982028,0.0002611688,0.0007749516,0.0002713275,0.0003226406,0.0001671121],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005386784,0.0001583303,0.06916305,0.00001091617,0.0004052447,0.00006369841,0.00006829595,0.8415268,0.000109673,0.0005708347,0.04264094,0.04474355],"study_design_scores_gemma":[0.003587669,0.0002368991,0.08626839,0.0001374577,0.0002586221,0.00001098087,0.000130668,0.8974523,0.0002152311,0.00260074,0.0087663,0.0003347247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.135468,0.00003653163,0.8628171,0.0002779522,0.0001188694,0.0001792755,0.000004043963,0.00006843801,0.001029796],"genre_scores_gemma":[0.9956337,0.000008348075,0.003112354,0.00009696102,0.0009539298,0.000009374652,0.000090656,0.00002989518,0.00006479201],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8601657,"threshold_uncertainty_score":0.7074,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1374224000484529,"gpt":0.3135844440732542,"spread":0.1761620440248013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002420747,0.0001388805,0.0003448198,0.00005283405,0.00010247,0.00002635442,0.0002682515,0.00004506824,0.00003670106],"category_scores_gemma":[0.00009730348,0.00008232285,0.0003749354,0.0003164959,0.0001155371,0.0001959421,0.00003112218,0.0004329136,1.438676e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004375702,"about_ca_system_score_gemma":0.0000549463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005404386,"about_ca_topic_score_gemma":9.522877e-7,"domain_scores_codex":[0.9985723,0.0002901955,0.0004280947,0.0001444619,0.0003997163,0.0001652586],"domain_scores_gemma":[0.9980728,0.0007549711,0.0007836394,0.0001364411,0.0001576661,0.0000945023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001041511,0.00004059195,0.0003371187,0.00000839714,0.00001810251,0.00000301799,0.00003724765,0.965346,0.03170793,0.0005284876,0.0001049298,0.0008266394],"study_design_scores_gemma":[0.0004691813,0.0007176238,0.005831637,0.0000188044,0.00001570904,0.00001918375,0.000004282082,0.9879026,0.003226714,0.00171764,0.000004380142,0.00007224081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9306507,0.00001827733,0.06818251,0.0006679714,0.0002316771,0.0001048852,0.00002449655,0.000008655345,0.0001108646],"genre_scores_gemma":[0.9993492,0.000006603637,0.00007650546,0.0003201956,0.0002326249,4.708415e-7,0.000001116971,0.00001109402,0.000002151121],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06869858,"threshold_uncertainty_score":0.3357028,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03184671280473528,"gpt":0.3488992811977379,"spread":0.3170525683930027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004727587,0.000188153,0.0007327402,0.0001026932,0.0001243318,0.00006425818,0.0001936031,0.00004560843,0.0001707867],"category_scores_gemma":[0.00001215965,0.0001519359,0.0002914773,0.0003875316,0.0001959508,0.0001051801,0.0000368088,0.0003679694,1.869876e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002576188,"about_ca_system_score_gemma":0.0001005918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008756249,"about_ca_topic_score_gemma":0.00002126714,"domain_scores_codex":[0.9981964,0.0004052955,0.0007287433,0.000213499,0.0002696832,0.0001863561],"domain_scores_gemma":[0.9975925,0.000879531,0.0006543565,0.0002466547,0.0004881388,0.0001387892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001699203,0.001198676,0.5378059,0.00001140914,0.0001949859,0.000002470955,0.0001448393,0.4327297,0.0001354841,0.004110069,0.001684708,0.0218119],"study_design_scores_gemma":[0.0007043123,0.000476212,0.1894368,0.00009358854,0.00006747031,0.000004636826,0.0003113339,0.7621193,0.0005000669,0.04503292,0.001063175,0.000190139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5047275,0.0001981996,0.4945382,0.0001769143,0.00004060489,0.0000503997,0.00001277953,0.00001083072,0.0002445371],"genre_scores_gemma":[0.992229,0.000002483725,0.007304595,0.0001106906,0.0002920769,0.000002106616,0.00004559755,0.00001211436,0.000001322578],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4875015,"threshold_uncertainty_score":0.6195766,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01571743557623756,"gpt":0.2592275435933588,"spread":0.2435101080171212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001730042,0.0002368261,0.001169059,0.000206061,0.0001760133,0.00002335858,0.0007382785,0.00004787566,0.001461159],"category_scores_gemma":[0.00001247907,0.000226935,0.0008272561,0.0007413282,0.0001499435,0.00010225,0.0003014267,0.0008208152,2.247018e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008176693,"about_ca_system_score_gemma":0.0001119784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006617146,"about_ca_topic_score_gemma":0.000005473356,"domain_scores_codex":[0.9966041,0.0004813457,0.001745002,0.0002001292,0.0006012854,0.0003681098],"domain_scores_gemma":[0.9958138,0.0005995324,0.002509455,0.0003914091,0.0005607592,0.0001250714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003308392,0.0003841042,0.02723239,0.00001028724,0.0004727568,0.000003601713,0.00007824092,0.955147,0.0005982165,0.004770679,0.004307535,0.006664345],"study_design_scores_gemma":[0.001629054,0.0007182,0.004702237,0.00006331614,0.0003942478,0.00001422086,0.0003711555,0.970955,0.0003059368,0.01091647,0.00962912,0.0003010264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2285208,0.001289013,0.7672017,0.0001482238,0.000306422,0.0003037562,0.0000223546,0.00002341206,0.002184322],"genre_scores_gemma":[0.9967557,0.00001498673,0.002239074,0.00005634527,0.0008479701,0.00001052459,0.0000182924,0.0000282412,0.00002884807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7682349,"threshold_uncertainty_score":0.9994516,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","retraction":null,"screen_n_in":null,"score":{"opus":0.03147212870682459,"gpt":0.2994424018640974,"spread":0.2679702731572728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006330818,0.0005326286,0.001608623,0.000301758,0.00007868694,0.0001082891,0.001073463,0.0002312746,0.000542848],"category_scores_gemma":[0.000002962416,0.0004937845,0.00116414,0.0001502928,0.0001350113,0.00007497682,0.001573447,0.00154894,0.000003087564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000179404,"about_ca_system_score_gemma":0.0002834434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001970665,"about_ca_topic_score_gemma":0.00002831626,"domain_scores_codex":[0.9961529,0.0001932756,0.001946562,0.0004078129,0.0008085503,0.0004908924],"domain_scores_gemma":[0.9954283,0.0001150384,0.002883842,0.0007762587,0.000611475,0.000185087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001777717,0.0003233347,0.002742707,0.00006658123,0.0007199921,0.000002083728,0.00008710749,0.9729733,0.00005152266,0.000493651,0.005346434,0.01701554],"study_design_scores_gemma":[0.0006801992,0.0001725713,0.001073525,0.0005766219,0.000473245,0.000004373889,0.00003867111,0.9931345,0.0001255185,0.002392941,0.0009373143,0.000390494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02181885,0.000304169,0.974496,0.00004745256,0.0008055088,0.0004224924,0.00004182419,0.00002672729,0.002036944],"genre_scores_gemma":[0.9897382,0.00003658011,0.00814415,0.00002930338,0.001759135,0.000009998334,0.000129273,0.00006183592,0.00009148641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9679194,"threshold_uncertainty_score":0.9997514,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01644240105669042,"gpt":0.2813572973389369,"spread":0.2649148962822465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008114954,0.0001854518,0.0004617232,0.0001836153,0.0001609238,0.00007789387,0.0003829931,0.00005765879,0.0004633528],"category_scores_gemma":[0.000003710069,0.0001651001,0.0003325428,0.0005297533,0.00008726399,0.000256719,0.00008977649,0.0009273781,0.000002794261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005133745,"about_ca_system_score_gemma":0.00003857397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001026627,"about_ca_topic_score_gemma":0.000004266688,"domain_scores_codex":[0.998423,0.0001729885,0.0007826263,0.0000925495,0.0002806366,0.0002481365],"domain_scores_gemma":[0.9987131,0.0001961512,0.0004874553,0.0002590013,0.0002519463,0.00009230115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00022445,0.000688955,0.02886695,0.0001527721,0.00192319,0.000009857923,0.0008936067,0.06064666,0.02821283,0.0006525486,0.1746918,0.7030364],"study_design_scores_gemma":[0.000310863,0.0003701383,0.005137824,0.0002284062,0.0002369413,0.00003124937,0.0001693248,0.9676784,0.006162806,0.001098363,0.01834236,0.0002333549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6503716,0.00037924,0.3473923,0.00006167955,0.0002279461,0.00007573771,0.0000106633,0.00004790722,0.001432947],"genre_scores_gemma":[0.9976342,0.00004781679,0.001508443,0.00003231944,0.0006330289,0.000003005769,0.00003306859,0.00002703838,0.00008111911],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9070317,"threshold_uncertainty_score":0.6732586,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01592775660514054,"gpt":0.2640757744524916,"spread":0.2481480178473511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007305619,0.00009238781,0.0003258099,0.0006156807,0.0000739665,0.0001208848,0.0009957167,0.00006290693,0.00003864308],"category_scores_gemma":[0.000124727,0.00006971671,0.0001618034,0.002956953,0.00004080461,0.0002725879,0.0002167444,0.0003058324,0.000002477212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003407425,"about_ca_system_score_gemma":0.00004229304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003017779,"about_ca_topic_score_gemma":0.00003195158,"domain_scores_codex":[0.9987538,0.00008401593,0.0005496337,0.0001406385,0.00022518,0.0002466748],"domain_scores_gemma":[0.9990308,0.0003165889,0.0002531711,0.0002132563,0.0001264872,0.00005972018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006485769,0.0004017463,0.1318519,0.00001488048,0.0002469977,0.0002584664,0.00009792227,0.1160699,0.00009418333,0.2128319,0.05455587,0.4835114],"study_design_scores_gemma":[0.001025989,0.0001785474,0.3597928,0.00009085066,0.00004668785,0.00005667776,0.000073979,0.5027856,0.0000100724,0.04895902,0.08672464,0.0002551603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02999748,0.0009202975,0.962069,0.002558383,0.0005338943,0.00004066077,7.905608e-7,0.00002154596,0.0038579],"genre_scores_gemma":[0.9918594,0.00009212286,0.006738205,0.001082189,0.0001627289,5.66539e-7,9.670543e-7,0.000001847187,0.0000620154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9618618,"threshold_uncertainty_score":0.2842965,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Embedding; Node (physics); Theoretical computer science; Graph; Set (abstract data type); Data mining; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05218198339797898,"gpt":0.3594490573058519,"spread":0.3072670739078729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007889205,0.0002209785,0.000478514,0.0002519238,0.0001606036,0.0002249335,0.0006903771,0.0001200918,0.0000108366],"category_scores_gemma":[0.0001446916,0.000182018,0.0002576286,0.0007058849,0.0001029385,0.00075384,0.0001778112,0.0006008901,1.892963e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000267766,"about_ca_system_score_gemma":0.00004827902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.59616e-7,"about_ca_topic_score_gemma":6.457636e-7,"domain_scores_codex":[0.9980056,0.00009558638,0.0008074018,0.0002911273,0.0004100817,0.0003902446],"domain_scores_gemma":[0.9970822,0.001734597,0.0004760911,0.0002646722,0.000292782,0.0001496742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000192988,0.00002037122,0.00141086,0.0002032969,0.000271454,0.0000694742,0.001790487,0.3894187,0.001795108,0.346925,0.001168018,0.2567343],"study_design_scores_gemma":[0.0003487881,0.0003297858,0.001188918,0.0005680486,0.00003442279,0.0001842642,0.00005017944,0.8066233,0.000052099,0.1902862,0.0001793934,0.0001545549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.126709,0.004488491,0.8670892,0.0003570094,0.001117018,0.000159667,0.000002126922,0.00005089011,0.00002655306],"genre_scores_gemma":[0.6210147,0.00008477577,0.3784579,0.0001546555,0.000264232,0.000002803793,9.970067e-7,0.00001700541,0.000003037109],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4943056,"threshold_uncertainty_score":0.7422481,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0219035278739292,"gpt":0.2786115619194021,"spread":0.2567080340454729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005451497,0.0001099783,0.0002710074,0.00009538449,0.0002820207,0.00005457836,0.0002586148,0.00002033688,0.001398426],"category_scores_gemma":[0.00000373734,0.0001134557,0.000154742,0.0002780293,0.00003522581,0.0001066026,0.000126419,0.0005672063,9.803584e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001031062,"about_ca_system_score_gemma":0.00007932958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008921779,"about_ca_topic_score_gemma":0.000007111782,"domain_scores_codex":[0.9986317,0.000139012,0.0006183113,0.000102821,0.0002519432,0.000256188],"domain_scores_gemma":[0.9991035,0.0001089984,0.0005025542,0.0001178028,0.00009281939,0.00007435553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002267327,0.00009762117,0.07782938,0.000001396755,0.00004304767,0.000008006838,0.0001836182,0.891601,0.000009348697,0.02078897,0.001715911,0.007698969],"study_design_scores_gemma":[0.001353785,0.0001145822,0.06680205,0.00004720214,0.00002600657,0.00001237871,0.001586398,0.9068846,8.934034e-7,0.006611336,0.01629929,0.0002614321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.585896,0.001441877,0.3784802,0.002606993,0.00453892,0.0005784269,0.00003873258,0.0000295741,0.02638936],"genre_scores_gemma":[0.9983766,0.00001869114,0.0004885847,0.0003448673,0.0006824857,0.000008640655,0.00001686196,0.00001207698,0.00005118419],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4124807,"threshold_uncertainty_score":0.9995145,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01547967802974184,"gpt":0.2885903414612192,"spread":0.2731106634314774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005288363,0.0002447592,0.0008007489,0.0002682532,0.0001047739,0.00006533245,0.0004104518,0.00006675228,0.0001199543],"category_scores_gemma":[0.000003914048,0.0002224647,0.0003383674,0.0005137014,0.0001377341,0.0001971937,0.0002204933,0.0004813601,2.717305e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003937342,"about_ca_system_score_gemma":0.00005966272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005332136,"about_ca_topic_score_gemma":0.00002789337,"domain_scores_codex":[0.998075,0.0001489791,0.001040263,0.0001955912,0.0002116013,0.000328568],"domain_scores_gemma":[0.9981307,0.0002358204,0.0008568713,0.0003481783,0.0003152986,0.0001130843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001302204,0.0001341532,0.01054382,0.00001263134,0.0005641347,0.00000408274,0.00004311413,0.8986695,0.00005489053,0.02780159,0.007439624,0.05460228],"study_design_scores_gemma":[0.0008926616,0.00007238323,0.003605257,0.0002039062,0.0002381672,0.000007641976,0.00006923526,0.9469403,0.00001273635,0.04681768,0.0009781538,0.0001618754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0455136,0.001822706,0.9459131,0.0001545866,0.0001888125,0.0001584804,0.000003639424,0.00002066092,0.006224441],"genre_scores_gemma":[0.9912983,0.0001432279,0.007891242,0.0001059254,0.0003715681,0.000003545771,0.00001196215,0.00002041285,0.0001538025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9457847,"threshold_uncertainty_score":0.9071848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}