{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17529112,0.0047348742,0.78471094,0.0024663087,0.00008176136,0.00012406796,0.00047108298,0.00064147153,0.031478327],"genre_scores_gemma":[0.8714268,0.0028482126,0.11220655,0.00032832802,0.0001347061,0.00026791036,0.000483631,0.00024173838,0.012062208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994722,0.00022353414,0.000018685161,0.00011547379,0.000106065,0.000064073785],"domain_scores_gemma":[0.9976527,0.0015528873,0.00030350217,0.00015978805,0.00018765949,0.00014348465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010491697,0.00057682255,0.0009880827,0.0015446652,0.00080618425,0.0018186771,0.0013855249,0.0015507628,0.00545278],"category_scores_gemma":[0.0050567104,0.00050183106,0.00093275594,0.0011264242,0.0014265501,0.003438099,0.001197899,0.0010604332,0.000690552],"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.00006266102,0.00004395613,0.0012279436,0.00017443195,0.000069759364,0.0001565351,0.000116040246,0.7589437,0.0020512906,0.22211207,0.0011951666,0.01384643],"study_design_scores_gemma":[0.000014799264,0.00003955091,0.0002889736,0.00001740045,0.000018002831,0.000050806997,0.0000428599,0.88361406,0.0004453224,0.1135027,0.0019531313,0.000012453533],"about_ca_topic_score_codex":0.004166521,"about_ca_topic_score_gemma":0.0026378315,"teacher_disagreement_score":0.00545278,"about_ca_system_score_codex":0.0019462752,"about_ca_system_score_gemma":0.0009101588,"threshold_uncertainty_score":0.018241346},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81053144,0.00075003685,0.17848857,0.00066240854,0.000059927945,0.00018264943,0.00026637295,0.0003007157,0.00875793],"genre_scores_gemma":[0.99204355,0.00012197944,0.00721688,0.000032954948,0.000013356119,0.000041591236,0.00007460522,0.000016360014,0.00043872328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837613,0.00061854307,0.000078525314,0.0003088446,0.0003501484,0.00026772713],"domain_scores_gemma":[0.9799643,0.013612873,0.0030479685,0.0019355599,0.0009364184,0.0005028179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002725392,0.00083445356,0.0006347985,0.0017912332,0.0004353686,0.00098721,0.0008684844,0.0007603329,0.0014660507],"category_scores_gemma":[0.019407757,0.0001865558,0.00058609294,0.00076564273,0.0013465098,0.0029955064,0.0010938096,0.0009069212,0.00017664877],"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.00040295118,0.00018529363,0.011944725,0.00013307513,0.000268202,0.00021969587,0.00011542068,0.92818713,0.008796253,0.0233805,0.0005603738,0.025806453],"study_design_scores_gemma":[0.000019153988,0.0004930693,0.004297571,0.000020892028,0.000066870176,0.00018693939,0.000103910104,0.97084785,0.004597829,0.018871227,0.00046805438,0.000026630287],"about_ca_topic_score_codex":0.001214291,"about_ca_topic_score_gemma":0.0010704579,"teacher_disagreement_score":0.002725392,"about_ca_system_score_codex":0.0010542023,"about_ca_system_score_gemma":0.0005370851,"threshold_uncertainty_score":0.014413416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63117737,0.00056894595,0.34976214,0.004192197,0.000085512285,0.00014481311,0.00075532956,0.0003896992,0.01292397],"genre_scores_gemma":[0.97856015,0.00020922982,0.015548242,0.00026277834,0.00007149575,0.00011871738,0.00029064616,0.00005221012,0.0048865024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998678,0.0006065701,0.000032677424,0.00028532825,0.00021291882,0.00018459848],"domain_scores_gemma":[0.9862152,0.009463678,0.001752264,0.00090617756,0.00076773803,0.00089494494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002652329,0.0005968004,0.00080899044,0.001253953,0.0011486553,0.0019633893,0.0017490967,0.0021781994,0.0033445468],"category_scores_gemma":[0.019064203,0.00059765653,0.0005870814,0.00091251946,0.0018854756,0.0036940253,0.001885192,0.002074391,0.00040993874],"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.00058964937,0.00025099644,0.008413123,0.00024004497,0.0001773859,0.0015989887,0.0009109712,0.32389057,0.007897164,0.62748975,0.01035202,0.018189415],"study_design_scores_gemma":[0.000043085187,0.000055515382,0.001311305,0.000018942312,0.000016241715,0.00027778005,0.00018985092,0.7854809,0.0008987431,0.21053319,0.00114624,0.000028185468],"about_ca_topic_score_codex":0.0016077344,"about_ca_topic_score_gemma":0.0014476349,"teacher_disagreement_score":0.0033445468,"about_ca_system_score_codex":0.001445819,"about_ca_system_score_gemma":0.00044342005,"threshold_uncertainty_score":0.014027059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36181176,0.0028206524,0.60974526,0.0019121509,0.00016957843,0.0001487946,0.0006561445,0.0004662907,0.02226935],"genre_scores_gemma":[0.9848509,0.00087631994,0.009513624,0.00013336114,0.00007548693,0.00008982103,0.00016673212,0.000057892077,0.0042358795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989278,0.00033258583,0.000031672113,0.000246274,0.0002563745,0.0002052481],"domain_scores_gemma":[0.9959423,0.0018051311,0.0007858549,0.00029803917,0.00081044965,0.00035820986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014834476,0.0006406594,0.0008985662,0.001920321,0.0007630704,0.0011049985,0.002046174,0.0012769464,0.0030287101],"category_scores_gemma":[0.008664638,0.00036949472,0.00070124754,0.0014405971,0.0014439767,0.0027314706,0.0010553921,0.0009973262,0.000571676],"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.00014621396,0.000057736353,0.00721699,0.00030200914,0.00014903564,0.0005120085,0.00047221946,0.6110238,0.005366151,0.35237846,0.0078053474,0.014570044],"study_design_scores_gemma":[0.000015945727,0.000030639792,0.001763946,0.000022138198,0.000033886547,0.00019297286,0.00007572978,0.9244824,0.0006313362,0.07147614,0.0012346117,0.000040381474],"about_ca_topic_score_codex":0.0078119226,"about_ca_topic_score_gemma":0.004681187,"teacher_disagreement_score":0.0078119226,"about_ca_system_score_codex":0.0017738484,"about_ca_system_score_gemma":0.0007898159,"threshold_uncertainty_score":0.015532911},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03342333,0.00021389502,0.96439946,0.00012237731,0.000037141283,0.00007912003,0.00022175736,0.0005468401,0.000955994],"genre_scores_gemma":[0.5855653,0.00018917568,0.41072157,0.00011850772,0.000093139024,0.0002630558,0.0015911175,0.00032624562,0.0011318891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938146,0.0026457158,0.00042912233,0.0014063544,0.0014413289,0.0002628565],"domain_scores_gemma":[0.9877637,0.0053130323,0.0019454884,0.0021167141,0.002420553,0.00044049832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005576085,0.001122083,0.0012212611,0.009439433,0.0009030496,0.0025436347,0.0024235523,0.0020949356,0.0010918052],"category_scores_gemma":[0.020427642,0.0004657029,0.0010308832,0.004469103,0.0022935104,0.004994712,0.0029834388,0.002052868,0.00044103802],"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.000466376,0.0004505883,0.018913269,0.00041070022,0.0006308794,0.00024269357,0.0005370764,0.41092548,0.016959624,0.110482834,0.006035901,0.43394464],"study_design_scores_gemma":[0.000011944449,0.00009363819,0.002293434,0.000027840968,0.0000207025,0.00013895112,0.000097153774,0.93561,0.00298236,0.05715363,0.0015344204,0.000036000314],"about_ca_topic_score_codex":0.0015953691,"about_ca_topic_score_gemma":0.0023521618,"teacher_disagreement_score":0.009439433,"about_ca_system_score_codex":0.0016849121,"about_ca_system_score_gemma":0.000991949,"threshold_uncertainty_score":0.029489517},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39685485,0.0011272823,0.5931227,0.00081590656,0.0000973605,0.00025029306,0.0012797143,0.001963597,0.004488359],"genre_scores_gemma":[0.9309255,0.00015970369,0.067073405,0.00006661169,0.000054619697,0.00011371765,0.0009964372,0.00019959839,0.00041041733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99239117,0.0035122887,0.00044368548,0.0012173543,0.0021330644,0.00030251453],"domain_scores_gemma":[0.8796593,0.09371635,0.006902164,0.010207535,0.0085002985,0.0010143056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013435237,0.00060601154,0.0007177277,0.006305814,0.00068430183,0.002137486,0.0013593588,0.0014047661,0.0021300793],"category_scores_gemma":[0.1015755,0.00036573224,0.00068515725,0.0038024525,0.0021023464,0.0032880781,0.0016389092,0.0014315936,0.00047805157],"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.0008244075,0.00030817976,0.113808505,0.0005541129,0.0008291984,0.00030633577,0.0010533307,0.61973554,0.012153494,0.07784665,0.005625843,0.16695441],"study_design_scores_gemma":[0.00001797931,0.0002771701,0.029553292,0.000045600475,0.00005283476,0.00034675517,0.0001929492,0.9396584,0.0043326113,0.024332823,0.0011039742,0.00008556306],"about_ca_topic_score_codex":0.002537803,"about_ca_topic_score_gemma":0.0014724201,"teacher_disagreement_score":0.013435237,"about_ca_system_score_codex":0.001324319,"about_ca_system_score_gemma":0.00078214606,"threshold_uncertainty_score":0.07105315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72826195,0.0002683351,0.26400724,0.00067041116,0.000027134893,0.000056833822,0.00027568158,0.00015011735,0.006282271],"genre_scores_gemma":[0.99278426,0.00008913953,0.005741488,0.00002920169,0.0000072807943,0.000049859987,0.000044482273,0.000016144062,0.0012380396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985373,0.000066832894,0.000005653756,0.000029913474,0.000020339192,0.000023507047],"domain_scores_gemma":[0.99887246,0.00074722484,0.00017502639,0.00006136093,0.000059244863,0.00008455825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053636,0.00045768748,0.00036205002,0.00074497826,0.0002949698,0.0007220422,0.0007641518,0.0012464011,0.0014667768],"category_scores_gemma":[0.003410976,0.00039167757,0.0006198599,0.0003176738,0.0010075244,0.00094932294,0.0009251561,0.0007018329,0.00013166781],"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.000011747458,0.000008837629,0.0007483972,0.000007315997,0.00001194744,0.000034064313,0.000019929623,0.99234277,0.0007939338,0.00541125,0.000052567386,0.0005571623],"study_design_scores_gemma":[0.0000012975553,0.0000043363107,0.00013727114,0.0000014652974,0.0000015161366,0.000004517357,0.0000027747149,0.9975011,0.000054364762,0.0022583276,0.00003136705,0.0000017322719],"about_ca_topic_score_codex":0.005953552,"about_ca_topic_score_gemma":0.004819714,"teacher_disagreement_score":0.005953552,"about_ca_system_score_codex":0.00095611904,"about_ca_system_score_gemma":0.00039842117,"threshold_uncertainty_score":0.0118377805},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6060473,0.0019399363,0.38348126,0.000738112,0.0002194608,0.00014579247,0.0022305385,0.0012824105,0.003915193],"genre_scores_gemma":[0.9178995,0.00037351775,0.07744141,0.00005746834,0.00005820396,0.000064785854,0.0031599407,0.00014746281,0.00079779775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796677,0.00086797535,0.00013470408,0.00041742699,0.00050165,0.00011150196],"domain_scores_gemma":[0.98141056,0.013351013,0.0018163082,0.001198999,0.00168015,0.0005429747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037767156,0.0012297321,0.00082282297,0.004703999,0.0003358912,0.0019823886,0.0009286631,0.0016959372,0.001948686],"category_scores_gemma":[0.030505491,0.00035158973,0.00054395915,0.002656338,0.0009887641,0.0038795958,0.0016997333,0.0012524406,0.00059435447],"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.0006359837,0.00022660397,0.04177592,0.0007709242,0.00039841278,0.00029838542,0.00055330066,0.7527266,0.0047750412,0.01821564,0.0054720044,0.17415123],"study_design_scores_gemma":[0.000010363717,0.0001049571,0.0028310302,0.00003974251,0.000017299344,0.00008954379,0.00012625422,0.98035526,0.0013512982,0.014174725,0.0008832797,0.000016179369],"about_ca_topic_score_codex":0.001603515,"about_ca_topic_score_gemma":0.0016892023,"teacher_disagreement_score":0.004703999,"about_ca_system_score_codex":0.0010838768,"about_ca_system_score_gemma":0.00036856625,"threshold_uncertainty_score":0.019973397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9445552,0.0012929186,0.048757702,0.00053848105,0.000060187416,0.00007530865,0.0013123493,0.0004170952,0.002990596],"genre_scores_gemma":[0.9785513,0.00017094953,0.020264894,0.00001682744,0.000026764705,0.000037391957,0.0007189358,0.000030976767,0.00018201387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650204,0.0014904732,0.00025605527,0.0005813677,0.0010324992,0.00013761749],"domain_scores_gemma":[0.9244793,0.061544474,0.003889811,0.006335313,0.0028762924,0.00087472564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051914193,0.00053154945,0.00067213277,0.005702759,0.00056532095,0.0014799732,0.0011228925,0.0009161064,0.0011505246],"category_scores_gemma":[0.06716391,0.00021693546,0.00040930885,0.005474584,0.0012467721,0.003458539,0.0014171826,0.00072322704,0.00020922374],"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.0010524425,0.00039742634,0.23683286,0.0009485709,0.001131651,0.0003702907,0.0013987885,0.52688015,0.005111009,0.04216639,0.0064930646,0.17721735],"study_design_scores_gemma":[0.00006060527,0.0002793663,0.055127162,0.000068612775,0.0000805179,0.0005837044,0.00058720174,0.9079209,0.002604897,0.030904917,0.0017052804,0.00007689978],"about_ca_topic_score_codex":0.0036308256,"about_ca_topic_score_gemma":0.003303859,"teacher_disagreement_score":0.005702759,"about_ca_system_score_codex":0.001066067,"about_ca_system_score_gemma":0.00046172383,"threshold_uncertainty_score":0.027455151},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9212635,0.00023040228,0.075180106,0.00027557454,0.000030450816,0.000045141885,0.00034280666,0.00018431322,0.0024477113],"genre_scores_gemma":[0.9920311,0.000025271576,0.007496688,0.00001584864,0.000018544635,0.0000146820785,0.00020682444,0.000016988519,0.00017401355],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659663,0.0016846091,0.00017100635,0.0006610665,0.0007033192,0.00018342928],"domain_scores_gemma":[0.937815,0.048216894,0.0066837375,0.0028310455,0.0033645686,0.0010886819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005770308,0.0004921732,0.0007723998,0.003094579,0.00074248627,0.001924406,0.0009788629,0.0013928488,0.0018911851],"category_scores_gemma":[0.06308035,0.00028549533,0.00033607634,0.0024548394,0.0014314321,0.0031605314,0.0014984217,0.001223489,0.00032574718],"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.002372188,0.00038396145,0.47953624,0.00051548425,0.00079285604,0.0005992647,0.0028727627,0.2883587,0.018055348,0.05412551,0.0038778048,0.14850979],"study_design_scores_gemma":[0.00004810914,0.00021061298,0.06417936,0.00004877391,0.000086260494,0.00021410725,0.00054003147,0.86448276,0.0072179963,0.061716992,0.001171416,0.0000835662],"about_ca_topic_score_codex":0.0020590562,"about_ca_topic_score_gemma":0.002171869,"teacher_disagreement_score":0.005770308,"about_ca_system_score_codex":0.00075609994,"about_ca_system_score_gemma":0.0003332985,"threshold_uncertainty_score":0.030516684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3832388,0.00023482656,0.59911716,0.00042105417,0.000043428852,0.00007045845,0.00014524159,0.00023583348,0.016493237],"genre_scores_gemma":[0.99501157,0.00005230691,0.0034807543,0.000020631127,0.000010170092,0.000028961344,0.000030093901,0.000007720413,0.0013577683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997398,0.000066989975,0.000008420189,0.00006809613,0.00006125465,0.000055379714],"domain_scores_gemma":[0.9986298,0.00081563625,0.00025789763,0.00006312764,0.00013752848,0.00009608408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553325,0.0003978213,0.00033106428,0.0005546329,0.00045163513,0.0009415882,0.0006429971,0.00061274524,0.002312162],"category_scores_gemma":[0.0027870848,0.00016954537,0.00032830337,0.00021674359,0.0010648688,0.0008743581,0.000527947,0.0005739623,0.000100884325],"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.0000948713,0.000042580796,0.0014638811,0.000059893264,0.000032097407,0.00022761674,0.00012568333,0.8155707,0.011255566,0.16105667,0.0008389635,0.009231517],"study_design_scores_gemma":[0.0000046763475,0.00001140632,0.00019588365,0.0000021175345,0.0000018837603,0.000017288112,0.000014119677,0.9874593,0.00033198908,0.011792466,0.000165825,0.00000307257],"about_ca_topic_score_codex":0.003431575,"about_ca_topic_score_gemma":0.0015566658,"teacher_disagreement_score":0.003431575,"about_ca_system_score_codex":0.0008492448,"about_ca_system_score_gemma":0.00038184682,"threshold_uncertainty_score":0.0077348948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52070963,0.00086330494,0.4631143,0.0031536673,0.000089929876,0.0001369227,0.00061703,0.00046750542,0.010847665],"genre_scores_gemma":[0.9776718,0.0002059011,0.01899064,0.00018038848,0.00006786771,0.00010220673,0.00019576578,0.00007102484,0.002514451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998315,0.0009932308,0.000034411714,0.00028961286,0.00019625943,0.00017150276],"domain_scores_gemma":[0.98936635,0.006450472,0.0015423129,0.0006633747,0.0010344567,0.0009429427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038105838,0.0007551706,0.0011031554,0.0027419913,0.00091928826,0.0017720212,0.0024586222,0.0024513495,0.003074209],"category_scores_gemma":[0.017882548,0.00058087456,0.0009744611,0.0010032414,0.002797227,0.0027150565,0.0016392549,0.0013179717,0.0004127326],"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.00018168775,0.00010333032,0.004591679,0.00015488303,0.00008368264,0.00046600573,0.00031436115,0.40320197,0.0024467383,0.5778689,0.0042002397,0.0063864337],"study_design_scores_gemma":[0.000024248631,0.000016944812,0.00049340044,0.00001407608,0.000010222952,0.00008807565,0.0000301394,0.9125169,0.00014264739,0.08632835,0.000321379,0.000013622202],"about_ca_topic_score_codex":0.006686679,"about_ca_topic_score_gemma":0.003489491,"teacher_disagreement_score":0.006686679,"about_ca_system_score_codex":0.0019462752,"about_ca_system_score_gemma":0.0006533904,"threshold_uncertainty_score":0.02015251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34964696,0.0011003579,0.63607275,0.0008339392,0.00022517488,0.00026931072,0.00063125964,0.0015132447,0.009707014],"genre_scores_gemma":[0.96054095,0.00012477959,0.037586518,0.000040922027,0.00006877066,0.00006986503,0.00020803334,0.00006784414,0.0012921791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99417794,0.002852499,0.00021062003,0.00095164985,0.0014706529,0.00033663659],"domain_scores_gemma":[0.9706777,0.019954417,0.0030284752,0.0032166638,0.002130956,0.0009918488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003251544,0.00091725576,0.0013219966,0.0036610465,0.0011614005,0.002741733,0.0013184337,0.0013372023,0.0034466216],"category_scores_gemma":[0.022975134,0.00030406372,0.00055622694,0.003595652,0.001717544,0.004359974,0.0017964552,0.0011599787,0.00062815804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075457885,0.00048687798,0.015089598,0.00048872654,0.00027246057,0.0005918582,0.00059812906,0.68179566,0.0099269375,0.16604248,0.0060833613,0.11786937],"study_design_scores_gemma":[0.00003976272,0.00016972523,0.0018835533,0.000020794543,0.000031186402,0.00028746063,0.00009131825,0.9445652,0.002613858,0.04910899,0.0011441429,0.00004406742],"about_ca_topic_score_codex":0.0025579785,"about_ca_topic_score_gemma":0.0031574876,"teacher_disagreement_score":0.0036610465,"about_ca_system_score_codex":0.0017333142,"about_ca_system_score_gemma":0.00077088835,"threshold_uncertainty_score":0.017196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33109185,0.0027732342,0.6318345,0.0056373277,0.0011675295,0.00042830594,0.005602672,0.0031458205,0.01831868],"genre_scores_gemma":[0.8148412,0.00037420966,0.17497163,0.0010675035,0.00021248484,0.00025502144,0.004698413,0.0003145148,0.0032650076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965289,0.0020631007,0.00009551952,0.00065378414,0.0005193223,0.00013930122],"domain_scores_gemma":[0.9834743,0.01067204,0.00084009446,0.0021397108,0.0021067848,0.0007670609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042795492,0.000663752,0.0007502793,0.0019277353,0.0010165141,0.0017135319,0.0019468802,0.0020693778,0.0021604162],"category_scores_gemma":[0.01723284,0.00030652466,0.0008387927,0.001479494,0.0014905497,0.0017166891,0.001728287,0.0017172457,0.00043101888],"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.00061417883,0.00033507755,0.008604618,0.0004681833,0.00026529562,0.00028362314,0.00018872043,0.8102675,0.0046028723,0.075536825,0.031235835,0.067597315],"study_design_scores_gemma":[0.000044364995,0.000057183068,0.0006325147,0.000013120647,0.000010223147,0.00006960377,0.000021420186,0.9725425,0.0013978257,0.022417374,0.002779476,0.0000144782325],"about_ca_topic_score_codex":0.006495038,"about_ca_topic_score_gemma":0.005388908,"teacher_disagreement_score":0.006495038,"about_ca_system_score_codex":0.0018688544,"about_ca_system_score_gemma":0.0009482467,"threshold_uncertainty_score":0.022632718},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074555,0.0005714575,0.9213838,0.00027533836,0.000036475834,0.00011491468,0.0006907235,0.0010357947,0.001336477],"genre_scores_gemma":[0.76145154,0.00032744635,0.23373781,0.000089206515,0.00008806067,0.00018748706,0.0024922674,0.00022074043,0.0014053836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978331,0.00087838736,0.00012396151,0.00057235704,0.00045528868,0.00013686994],"domain_scores_gemma":[0.991994,0.0045096925,0.0011668854,0.0008968672,0.0011929667,0.00023953961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033953504,0.0011791285,0.00093044416,0.0054208883,0.00044459457,0.0019507804,0.0020506966,0.001956973,0.0014352417],"category_scores_gemma":[0.015280934,0.00047188005,0.00096015894,0.0027830456,0.0013481034,0.0035815665,0.0015973055,0.0015964959,0.0005377275],"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.00043075095,0.0003078171,0.017493311,0.0004187518,0.0004126652,0.00020287691,0.00043910497,0.6795462,0.00663786,0.056127362,0.006134259,0.23184916],"study_design_scores_gemma":[0.000007153363,0.000035947647,0.0008336771,0.0000166236,0.00001551159,0.00003701444,0.000032249885,0.97508633,0.0008280707,0.022632748,0.00046420106,0.000010445441],"about_ca_topic_score_codex":0.0026545173,"about_ca_topic_score_gemma":0.0043819393,"teacher_disagreement_score":0.0054208883,"about_ca_system_score_codex":0.0014788475,"about_ca_system_score_gemma":0.00077091553,"threshold_uncertainty_score":0.017956555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9297717,0.0013399855,0.060542617,0.00059032446,0.000256035,0.00014883588,0.00044101244,0.0037962075,0.003113148],"genre_scores_gemma":[0.94106495,0.00011627705,0.05706504,0.000060462193,0.000036834845,0.000036922596,0.00093008997,0.00009613091,0.0005933786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598604,0.0014314791,0.00033813049,0.0008710151,0.00095176086,0.00042159163],"domain_scores_gemma":[0.97877914,0.013969011,0.001407694,0.001892895,0.0028557747,0.0010955371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052960315,0.0014911196,0.0018009063,0.0028000667,0.0009799827,0.0020827972,0.0020433958,0.0022372387,0.0010491073],"category_scores_gemma":[0.025209514,0.00048724897,0.0006883682,0.0016998604,0.0008091099,0.0030706222,0.0018535559,0.0013133342,0.0005261966],"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.0068732644,0.0013779224,0.025272677,0.00039638852,0.00065976323,0.00018255333,0.00029913927,0.6718979,0.01760548,0.0040422063,0.006345135,0.26504764],"study_design_scores_gemma":[0.000041622214,0.00013285491,0.0006632079,0.000006767046,0.000012198481,0.000025739946,0.000041320687,0.9955481,0.002810876,0.00060071924,0.00010731721,0.000009262812],"about_ca_topic_score_codex":0.007876241,"about_ca_topic_score_gemma":0.0044438397,"teacher_disagreement_score":0.007876241,"about_ca_system_score_codex":0.0014196187,"about_ca_system_score_gemma":0.0014452793,"threshold_uncertainty_score":0.028008461},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01959198,0.00017665981,0.9791093,0.00008328973,0.000016518969,0.00004903823,0.000030543604,0.0005647082,0.0003779735],"genre_scores_gemma":[0.40360403,0.00013112539,0.5940376,0.00013287477,0.000050399296,0.0001353155,0.00022386531,0.00019400063,0.0014908295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836594,0.0006120592,0.000051655075,0.00048352825,0.0003709405,0.000115802846],"domain_scores_gemma":[0.9956683,0.0021481055,0.0005414962,0.0005929271,0.00081079087,0.00023844757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021397064,0.00086902874,0.0012620786,0.0035745285,0.0008888752,0.0012915885,0.0020680104,0.0014616436,0.0014861759],"category_scores_gemma":[0.007844072,0.00053436344,0.00092719455,0.0018025073,0.0012780196,0.0025100184,0.0022745002,0.0012138197,0.0005138203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033962211,0.00020259139,0.0051468303,0.00028008904,0.00030635932,0.0003561929,0.00037124386,0.5567812,0.036658976,0.038260654,0.003369406,0.35792688],"study_design_scores_gemma":[0.000011924968,0.000024258152,0.00045081403,0.000008607248,0.000008752636,0.00004773778,0.000019718012,0.98143744,0.0035277905,0.013896901,0.000554816,0.0000111647905],"about_ca_topic_score_codex":0.0025475684,"about_ca_topic_score_gemma":0.0027351193,"teacher_disagreement_score":0.0035745285,"about_ca_system_score_codex":0.0011167858,"about_ca_system_score_gemma":0.0009470612,"threshold_uncertainty_score":0.011315942},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5898903,0.00054501917,0.3543379,0.0051965076,0.00015833515,0.00021041239,0.001764783,0.00064185465,0.04725484],"genre_scores_gemma":[0.97732157,0.00017897518,0.010300023,0.0002622711,0.00005118061,0.00013058637,0.00040260452,0.000042980842,0.011309886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920064,0.00026836095,0.000023355407,0.00019884043,0.00015720303,0.00015155673],"domain_scores_gemma":[0.99739313,0.0012954795,0.0003851862,0.00027085794,0.00035396378,0.00030127735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008445945,0.0004093873,0.000657721,0.0010156918,0.0006418521,0.0018860805,0.001747548,0.0018220216,0.0073776045],"category_scores_gemma":[0.0059727724,0.00048726363,0.0006670452,0.0010672845,0.0015382606,0.0026571378,0.0012792716,0.0011597465,0.000593155],"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.0001386014,0.00007881589,0.0014167946,0.00006186236,0.000043554173,0.00024399592,0.00031990107,0.6206897,0.0012141345,0.36772558,0.0036087818,0.0044582034],"study_design_scores_gemma":[0.00004530341,0.000030792853,0.00036204368,0.000008426136,0.000010899697,0.00006988208,0.00007527601,0.88859904,0.00013861431,0.1090922,0.001551807,0.000015699306],"about_ca_topic_score_codex":0.011502248,"about_ca_topic_score_gemma":0.008636389,"teacher_disagreement_score":0.011502248,"about_ca_system_score_codex":0.0019267711,"about_ca_system_score_gemma":0.0007466232,"threshold_uncertainty_score":0.024680495},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.568302,0.00037010433,0.42594495,0.000399533,0.000043481974,0.00013201963,0.00044888793,0.0003370227,0.0040220963],"genre_scores_gemma":[0.9321902,0.00011022393,0.06570084,0.000055320677,0.000027635486,0.00011843812,0.00041390443,0.000098894496,0.0012846163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552083,0.0019172966,0.00026634298,0.00091972935,0.000986724,0.0003891528],"domain_scores_gemma":[0.96830183,0.022782436,0.002963742,0.0030570924,0.001738019,0.0011567748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003851262,0.0006184051,0.0014521928,0.005850321,0.0015719876,0.0037105246,0.0021497847,0.0015426332,0.005536622],"category_scores_gemma":[0.034291327,0.00069272815,0.0011752683,0.0027158158,0.0029035113,0.006133088,0.0030590235,0.0014152424,0.000406905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0003089363,0.00013741256,0.02902657,0.0002756731,0.00022640079,0.00040836915,0.001140889,0.38361683,0.008327398,0.5412849,0.0016581245,0.03358837],"study_design_scores_gemma":[0.000011812046,0.000030751256,0.002512752,0.00003069951,0.000018336008,0.00017012129,0.00022026335,0.7427898,0.0024134705,0.2508459,0.0009149369,0.000041239142],"about_ca_topic_score_codex":0.0030804176,"about_ca_topic_score_gemma":0.0032716668,"teacher_disagreement_score":0.005850321,"about_ca_system_score_codex":0.0022078499,"about_ca_system_score_gemma":0.0007286428,"threshold_uncertainty_score":0.020367682},"labels":[],"label_agreement":null}]}