{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Mario Ventresca","is_ca":false},{"name":"Dionne M. Aleman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002725392,0.0008344536,0.0006347985,0.001791233,0.0004353686,0.00098721,0.0008684844,0.0007603329,0.001466051],"category_scores_gemma":[0.01940776,0.0001865558,0.0005860929,0.0007656427,0.00134651,0.002995506,0.00109381,0.0009069212,0.0001766488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001054202,"about_ca_system_score_gemma":0.0005370851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001214291,"about_ca_topic_score_gemma":0.001070458,"domain_scores_codex":[0.9983761,0.0006185431,0.00007852531,0.0003088446,0.0003501484,0.0002677271],"domain_scores_gemma":[0.9799643,0.01361287,0.003047968,0.00193556,0.0009364184,0.0005028179],"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.0004029512,0.0001852936,0.01194473,0.0001330751,0.000268202,0.0002196959,0.0001154207,0.9281871,0.008796253,0.0233805,0.0005603738,0.02580645],"study_design_scores_gemma":[0.00001915399,0.0004930693,0.004297571,0.00002089203,0.00006687018,0.0001869394,0.0001039101,0.9708478,0.004597829,0.01887123,0.0004680544,0.00002663029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8105314,0.0007500369,0.1784886,0.0006624085,0.00005992794,0.0001826494,0.000266373,0.0003007157,0.00875793],"genre_scores_gemma":[0.9920436,0.0001219794,0.00721688,0.00003295495,0.00001335612,0.00004159124,0.00007460522,0.00001636001,0.0004387233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002725392,"threshold_uncertainty_score":0.01441342,"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","authors":[{"name":"Bogumił Kamiński","is_ca":false},{"name":"Paweł Prałat","is_ca":true},{"name":"François Théberge","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04547895218473307,"gpt":0.3071416032323553,"spread":0.2616626510476222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004279549,0.000663752,0.0007502793,0.001927735,0.001016514,0.001713532,0.00194688,0.002069378,0.002160416],"category_scores_gemma":[0.01723284,0.0003065247,0.0008387927,0.001479494,0.00149055,0.001716689,0.001728287,0.001717246,0.0004310189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001868854,"about_ca_system_score_gemma":0.0009482467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006495038,"about_ca_topic_score_gemma":0.005388908,"domain_scores_codex":[0.9965289,0.002063101,0.00009551952,0.0006537841,0.0005193223,0.0001393012],"domain_scores_gemma":[0.9834743,0.01067204,0.0008400945,0.002139711,0.002106785,0.0007670609],"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.0006141788,0.0003350776,0.008604618,0.0004681833,0.0002652956,0.0002836231,0.0001887204,0.8102675,0.004602872,0.07553682,0.03123583,0.06759731],"study_design_scores_gemma":[0.000044365,0.00005718307,0.0006325147,0.00001312065,0.00001022315,0.00006960377,0.00002142019,0.9725425,0.001397826,0.02241737,0.002779476,0.00001447823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3310919,0.002773234,0.6318345,0.005637328,0.001167529,0.0004283059,0.005602672,0.00314582,0.01831868],"genre_scores_gemma":[0.8148412,0.0003742097,0.1749716,0.001067503,0.0002124848,0.0002550214,0.004698413,0.0003145148,0.003265008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006495038,"threshold_uncertainty_score":0.02263272,"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","authors":[{"name":"Bogumił Kamiński","is_ca":false},{"name":"Bartosz Pankratz","is_ca":true},{"name":"Paweł Prałat","is_ca":true},{"name":"François Théberge","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003810584,0.0007551706,0.001103155,0.002741991,0.0009192883,0.001772021,0.002458622,0.00245135,0.003074209],"category_scores_gemma":[0.01788255,0.0005808746,0.0009744611,0.001003241,0.002797227,0.002715057,0.001639255,0.001317972,0.0004127326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001946275,"about_ca_system_score_gemma":0.0006533904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006686679,"about_ca_topic_score_gemma":0.003489491,"domain_scores_codex":[0.998315,0.0009932308,0.00003441171,0.0002896129,0.0001962594,0.0001715028],"domain_scores_gemma":[0.9893664,0.006450472,0.001542313,0.0006633747,0.001034457,0.0009429427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001816877,0.0001033303,0.004591679,0.000154883,0.00008368264,0.0004660057,0.0003143612,0.403202,0.002446738,0.5778689,0.00420024,0.006386434],"study_design_scores_gemma":[0.00002424863,0.00001694481,0.0004934004,0.00001407608,0.00001022295,0.00008807565,0.0000301394,0.9125169,0.0001426474,0.08632835,0.000321379,0.0000136222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5207096,0.0008633049,0.4631143,0.003153667,0.00008992988,0.0001369227,0.00061703,0.0004675054,0.01084767],"genre_scores_gemma":[0.9776718,0.0002059011,0.01899064,0.0001803885,0.00006786771,0.0001022067,0.0001957658,0.00007102484,0.002514451],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006686679,"threshold_uncertainty_score":0.02015251,"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","authors":[{"name":"Steve Kirkland","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002652329,0.0005968004,0.0008089904,0.001253953,0.001148655,0.001963389,0.001749097,0.002178199,0.003344547],"category_scores_gemma":[0.0190642,0.0005976565,0.0005870814,0.0009125195,0.001885476,0.003694025,0.001885192,0.002074391,0.0004099387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001445819,"about_ca_system_score_gemma":0.0004434201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001607734,"about_ca_topic_score_gemma":0.001447635,"domain_scores_codex":[0.998678,0.0006065701,0.00003267742,0.0002853282,0.0002129188,0.0001845985],"domain_scores_gemma":[0.9862152,0.009463678,0.001752264,0.0009061776,0.000767738,0.0008949449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005896494,0.0002509964,0.008413123,0.000240045,0.0001773859,0.001598989,0.0009109712,0.3238906,0.007897164,0.6274897,0.01035202,0.01818942],"study_design_scores_gemma":[0.00004308519,0.00005551538,0.001311305,0.00001894231,0.00001624171,0.0002777801,0.0001898509,0.7854809,0.0008987431,0.2105332,0.00114624,0.00002818547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6311774,0.000568946,0.3497621,0.004192197,0.00008551229,0.0001448131,0.0007553296,0.0003896992,0.01292397],"genre_scores_gemma":[0.9785601,0.0002092298,0.01554824,0.0002627783,0.00007149575,0.0001187174,0.0002906462,0.00005221012,0.004886502],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003344547,"threshold_uncertainty_score":0.01402706,"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","authors":[{"name":"Pierre Miasnikof","is_ca":true},{"name":"Alexander Y. Shestopaloff","is_ca":false},{"name":"Anthony J. Bonner","is_ca":true},{"name":"Yuri Lawryshyn","is_ca":true},{"name":"Pãnos M. Pardalos","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01343524,0.0006060115,0.0007177277,0.006305814,0.0006843018,0.002137486,0.001359359,0.001404766,0.002130079],"category_scores_gemma":[0.1015755,0.0003657322,0.0006851573,0.003802452,0.002102346,0.003288078,0.001638909,0.001431594,0.0004780516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001324319,"about_ca_system_score_gemma":0.0007821461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002537803,"about_ca_topic_score_gemma":0.00147242,"domain_scores_codex":[0.9923912,0.003512289,0.0004436855,0.001217354,0.002133064,0.0003025145],"domain_scores_gemma":[0.8796593,0.09371635,0.006902164,0.01020753,0.008500298,0.001014306],"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.0008244075,0.0003081798,0.1138085,0.0005541129,0.0008291984,0.0003063358,0.001053331,0.6197355,0.01215349,0.07784665,0.005625843,0.1669544],"study_design_scores_gemma":[0.00001797931,0.0002771701,0.02955329,0.00004560047,0.00005283476,0.0003467552,0.0001929492,0.9396584,0.004332611,0.02433282,0.001103974,0.00008556306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3968548,0.001127282,0.5931227,0.0008159066,0.0000973605,0.0002502931,0.001279714,0.001963597,0.004488359],"genre_scores_gemma":[0.9309255,0.0001597037,0.0670734,0.00006661169,0.0000546197,0.0001137177,0.0009964372,0.0001995984,0.0004104173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01343524,"threshold_uncertainty_score":0.07105315,"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","authors":[{"name":"Arash Dehghan-Kooshkghazi","is_ca":true},{"name":"Bogumił Kamiński","is_ca":false},{"name":"Łukasz Kraiński","is_ca":false},{"name":"Paweł Prałat","is_ca":true},{"name":"François Théberge","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05553973968489292,"gpt":0.3535089458173422,"spread":0.2979692061324493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003776716,0.001229732,0.000822823,0.004703999,0.0003358912,0.001982389,0.0009286631,0.001695937,0.001948686],"category_scores_gemma":[0.03050549,0.0003515897,0.0005439591,0.002656338,0.0009887641,0.003879596,0.001699733,0.001252441,0.0005943545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001083877,"about_ca_system_score_gemma":0.0003685663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001603515,"about_ca_topic_score_gemma":0.001689202,"domain_scores_codex":[0.9979668,0.0008679754,0.0001347041,0.000417427,0.00050165,0.000111502],"domain_scores_gemma":[0.9814106,0.01335101,0.001816308,0.001198999,0.00168015,0.0005429747],"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.0006359837,0.000226604,0.04177592,0.0007709242,0.0003984128,0.0002983854,0.0005533007,0.7527266,0.004775041,0.01821564,0.005472004,0.1741512],"study_design_scores_gemma":[0.00001036372,0.0001049571,0.00283103,0.00003974251,0.00001729934,0.00008954379,0.0001262542,0.9803553,0.001351298,0.01417472,0.0008832797,0.00001617937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6060473,0.001939936,0.3834813,0.000738112,0.0002194608,0.0001457925,0.002230539,0.00128241,0.003915193],"genre_scores_gemma":[0.9178995,0.0003735177,0.07744141,0.00005746834,0.00005820396,0.00006478585,0.003159941,0.0001474628,0.0007977978],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004703999,"threshold_uncertainty_score":0.0199734,"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","authors":[{"name":"Bogumił Kamiński","is_ca":false},{"name":"Paweł Prałat","is_ca":true},{"name":"François Théberge","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02304013769137507,"gpt":0.3128172266547162,"spread":0.2897770889633411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005576085,0.001122083,0.001221261,0.009439433,0.0009030496,0.002543635,0.002423552,0.002094936,0.001091805],"category_scores_gemma":[0.02042764,0.0004657029,0.001030883,0.004469103,0.00229351,0.004994712,0.002983439,0.002052868,0.000441038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001684912,"about_ca_system_score_gemma":0.000991949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001595369,"about_ca_topic_score_gemma":0.002352162,"domain_scores_codex":[0.9938146,0.002645716,0.0004291223,0.001406354,0.001441329,0.0002628565],"domain_scores_gemma":[0.9877637,0.005313032,0.001945488,0.002116714,0.002420553,0.0004404983],"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.000466376,0.0004505883,0.01891327,0.0004107002,0.0006308794,0.0002426936,0.0005370764,0.4109255,0.01695962,0.1104828,0.006035901,0.4339446],"study_design_scores_gemma":[0.00001194445,0.00009363819,0.002293434,0.00002784097,0.0000207025,0.0001389511,0.00009715377,0.93561,0.00298236,0.05715363,0.00153442,0.00003600031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03342333,0.000213895,0.9643995,0.0001223773,0.00003714128,0.00007912003,0.0002217574,0.0005468401,0.000955994],"genre_scores_gemma":[0.5855653,0.0001891757,0.4107216,0.0001185077,0.00009313902,0.0002630558,0.001591117,0.0003262456,0.001131889],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009439433,"threshold_uncertainty_score":0.02948952,"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","authors":[{"name":"Bogumił Kamiński","is_ca":false},{"name":"Paweł Misiorek","is_ca":false},{"name":"Paweł Prałat","is_ca":true},{"name":"François Théberge","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02080883243451563,"gpt":0.281733364592667,"spread":0.2609245321581513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002139706,0.0008690287,0.001262079,0.003574528,0.0008888752,0.001291589,0.00206801,0.001461644,0.001486176],"category_scores_gemma":[0.007844072,0.0005343634,0.0009271945,0.001802507,0.00127802,0.002510018,0.0022745,0.00121382,0.0005138203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116786,"about_ca_system_score_gemma":0.0009470612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002547568,"about_ca_topic_score_gemma":0.002735119,"domain_scores_codex":[0.9983659,0.0006120592,0.00005165508,0.0004835282,0.0003709405,0.0001158028],"domain_scores_gemma":[0.9956683,0.002148106,0.0005414962,0.0005929271,0.0008107909,0.0002384476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003396221,0.0002025914,0.00514683,0.000280089,0.0003063593,0.0003561929,0.0003712439,0.5567812,0.03665898,0.03826065,0.003369406,0.3579269],"study_design_scores_gemma":[0.00001192497,0.00002425815,0.000450814,0.000008607248,0.000008752636,0.00004773778,0.00001971801,0.9814374,0.003527791,0.0138969,0.000554816,0.00001116479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01959198,0.0001766598,0.9791093,0.00008328973,0.00001651897,0.00004903823,0.0000305436,0.0005647082,0.0003779735],"genre_scores_gemma":[0.403604,0.0001311254,0.5940376,0.0001328748,0.0000503993,0.0001353155,0.0002238653,0.0001940006,0.00149083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003574528,"threshold_uncertainty_score":0.01131594,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00104917,0.0005768226,0.0009880827,0.001544665,0.0008061843,0.001818677,0.001385525,0.001550763,0.00545278],"category_scores_gemma":[0.00505671,0.0005018311,0.0009327559,0.001126424,0.00142655,0.003438099,0.001197899,0.001060433,0.000690552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001946275,"about_ca_system_score_gemma":0.0009101588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004166521,"about_ca_topic_score_gemma":0.002637831,"domain_scores_codex":[0.9994722,0.0002235341,0.00001868516,0.0001154738,0.000106065,0.00006407379],"domain_scores_gemma":[0.9976527,0.001552887,0.0003035022,0.000159788,0.0001876595,0.0001434846],"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.00006266102,0.00004395613,0.001227944,0.0001744319,0.00006975936,0.0001565351,0.0001160402,0.7589437,0.002051291,0.2221121,0.001195167,0.01384643],"study_design_scores_gemma":[0.00001479926,0.00003955091,0.0002889736,0.00001740045,0.00001800283,0.000050807,0.0000428599,0.8836141,0.0004453224,0.1135027,0.001953131,0.00001245353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1752911,0.004734874,0.7847109,0.002466309,0.00008176136,0.000124068,0.000471083,0.0006414715,0.03147833],"genre_scores_gemma":[0.8714268,0.002848213,0.1122065,0.000328328,0.0001347061,0.0002679104,0.000483631,0.0002417384,0.01206221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00545278,"threshold_uncertainty_score":0.01824135,"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","authors":[{"name":"David Bowater","is_ca":true},{"name":"Emmanuel Stefanakis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003251544,0.0009172558,0.001321997,0.003661047,0.0011614,0.002741733,0.001318434,0.001337202,0.003446622],"category_scores_gemma":[0.02297513,0.0003040637,0.0005562269,0.003595652,0.001717544,0.004359974,0.001796455,0.001159979,0.000628158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001733314,"about_ca_system_score_gemma":0.0007708883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002557978,"about_ca_topic_score_gemma":0.003157488,"domain_scores_codex":[0.9941779,0.002852499,0.00021062,0.0009516499,0.001470653,0.0003366366],"domain_scores_gemma":[0.9706777,0.01995442,0.003028475,0.003216664,0.002130956,0.0009918488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007545789,0.000486878,0.0150896,0.0004887265,0.0002724606,0.0005918582,0.0005981291,0.6817957,0.009926938,0.1660425,0.006083361,0.1178694],"study_design_scores_gemma":[0.00003976272,0.0001697252,0.001883553,0.00002079454,0.0000311864,0.0002874606,0.00009131825,0.9445652,0.002613858,0.04910899,0.001144143,0.00004406742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.349647,0.001100358,0.6360728,0.0008339392,0.0002251749,0.0002693107,0.0006312596,0.001513245,0.009707014],"genre_scores_gemma":[0.960541,0.0001247796,0.03758652,0.00004092203,0.00006877066,0.00006986503,0.0002080333,0.00006784414,0.001292179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003661047,"threshold_uncertainty_score":0.017196,"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","authors":[{"name":"Amelia Padmore","is_ca":false},{"name":"M. R. Nelson","is_ca":false},{"name":"Nadia Chuzhanova","is_ca":false},{"name":"Jonathan J. Crofts","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053636,0.0004576875,0.00036205,0.0007449783,0.0002949698,0.0007220422,0.0007641518,0.001246401,0.001466777],"category_scores_gemma":[0.003410976,0.0003916776,0.0006198599,0.0003176738,0.001007524,0.0009493229,0.0009251561,0.0007018329,0.0001316678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000956119,"about_ca_system_score_gemma":0.0003984212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005953552,"about_ca_topic_score_gemma":0.004819714,"domain_scores_codex":[0.9998537,0.00006683289,0.000005653756,0.00002991347,0.00002033919,0.00002350705],"domain_scores_gemma":[0.9988725,0.0007472248,0.0001750264,0.00006136093,0.00005924486,0.00008455825],"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.00001174746,0.000008837629,0.0007483972,0.000007315997,0.00001194744,0.00003406431,0.00001992962,0.9923428,0.0007939338,0.00541125,0.00005256739,0.0005571623],"study_design_scores_gemma":[0.000001297555,0.000004336311,0.0001372711,0.000001465297,0.000001516137,0.000004517357,0.000002774715,0.9975011,0.00005436476,0.002258328,0.00003136705,0.000001732272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7282619,0.0002683351,0.2640072,0.0006704112,0.00002713489,0.00005683382,0.0002756816,0.0001501174,0.006282271],"genre_scores_gemma":[0.9927843,0.00008913953,0.005741488,0.00002920169,0.000007280794,0.00004985999,0.00004448227,0.00001614406,0.00123804],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005953552,"threshold_uncertainty_score":0.01183778,"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","authors":[{"name":"Pierre Miasnikof","is_ca":true},{"name":"Alexander Y. Shestopaloff","is_ca":false},{"name":"Leonidas Pitsoulis","is_ca":false},{"name":"Alexander Ponomarenko","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005191419,0.0005315494,0.0006721328,0.005702759,0.000565321,0.001479973,0.001122892,0.0009161064,0.001150525],"category_scores_gemma":[0.06716391,0.0002169355,0.0004093089,0.005474584,0.001246772,0.003458539,0.001417183,0.000723227,0.0002092237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001066067,"about_ca_system_score_gemma":0.0004617238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003630826,"about_ca_topic_score_gemma":0.003303859,"domain_scores_codex":[0.996502,0.001490473,0.0002560553,0.0005813677,0.001032499,0.0001376175],"domain_scores_gemma":[0.9244793,0.06154447,0.003889811,0.006335313,0.002876292,0.0008747256],"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.001052442,0.0003974263,0.2368329,0.0009485709,0.001131651,0.0003702907,0.001398789,0.5268801,0.005111009,0.04216639,0.006493065,0.1772173],"study_design_scores_gemma":[0.00006060527,0.0002793663,0.05512716,0.00006861278,0.0000805179,0.0005837044,0.0005872017,0.9079209,0.002604897,0.03090492,0.00170528,0.00007689978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9445552,0.001292919,0.0487577,0.0005384811,0.00006018742,0.00007530865,0.001312349,0.0004170952,0.002990596],"genre_scores_gemma":[0.9785513,0.0001709495,0.02026489,0.00001682744,0.0000267647,0.00003739196,0.0007189358,0.00003097677,0.0001820139],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005702759,"threshold_uncertainty_score":0.02745515,"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","authors":[{"name":"Peng Gang Sun","is_ca":false},{"name":"Robert E. Kooij","is_ca":false},{"name":"Roland Bouffanais","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553325,0.0003978213,0.0003310643,0.0005546329,0.0004516351,0.0009415882,0.0006429971,0.0006127452,0.002312162],"category_scores_gemma":[0.002787085,0.0001695454,0.0003283034,0.0002167436,0.001064869,0.0008743581,0.000527947,0.0005739623,0.0001008843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008492448,"about_ca_system_score_gemma":0.0003818468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003431575,"about_ca_topic_score_gemma":0.001556666,"domain_scores_codex":[0.9997398,0.00006698997,0.000008420189,0.00006809613,0.00006125465,0.00005537971],"domain_scores_gemma":[0.9986298,0.0008156362,0.0002578976,0.00006312764,0.0001375285,0.00009608408],"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.0000948713,0.0000425808,0.001463881,0.00005989326,0.00003209741,0.0002276167,0.0001256833,0.8155707,0.01125557,0.1610567,0.0008389635,0.009231517],"study_design_scores_gemma":[0.000004676348,0.00001140632,0.0001958837,0.000002117534,0.00000188376,0.00001728811,0.00001411968,0.9874593,0.0003319891,0.01179247,0.000165825,0.00000307257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3832388,0.0002348266,0.5991172,0.0004210542,0.00004342885,0.00007045845,0.0001452416,0.0002358335,0.01649324],"genre_scores_gemma":[0.9950116,0.00005230691,0.003480754,0.00002063113,0.00001017009,0.00002896134,0.0000300939,0.000007720413,0.001357768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003431575,"threshold_uncertainty_score":0.007734895,"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","authors":[{"name":"Lenar Iskhakov","is_ca":false},{"name":"Paweł Prałat","is_ca":true},{"name":"Liudmila Prokhorenkova","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483448,0.0006406594,0.0008985662,0.001920321,0.0007630704,0.001104999,0.002046174,0.001276946,0.00302871],"category_scores_gemma":[0.008664638,0.0003694947,0.0007012475,0.001440597,0.001443977,0.002731471,0.001055392,0.0009973262,0.000571676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001773848,"about_ca_system_score_gemma":0.0007898159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007811923,"about_ca_topic_score_gemma":0.004681187,"domain_scores_codex":[0.9989278,0.0003325858,0.00003167211,0.000246274,0.0002563745,0.0002052481],"domain_scores_gemma":[0.9959423,0.001805131,0.0007858549,0.0002980392,0.0008104497,0.0003582099],"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.000146214,0.00005773635,0.00721699,0.0003020091,0.0001490356,0.0005120085,0.0004722195,0.6110238,0.005366151,0.3523785,0.007805347,0.01457004],"study_design_scores_gemma":[0.00001594573,0.00003063979,0.001763946,0.0000221382,0.00003388655,0.0001929729,0.00007572978,0.9244824,0.0006313362,0.07147614,0.001234612,0.00004038147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3618118,0.002820652,0.6097453,0.001912151,0.0001695784,0.0001487946,0.0006561445,0.0004662907,0.02226935],"genre_scores_gemma":[0.9848509,0.0008763199,0.009513624,0.0001333611,0.00007548693,0.00008982103,0.0001667321,0.00005789208,0.00423588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007811923,"threshold_uncertainty_score":0.01553291,"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","authors":[{"name":"Bartosz Pankratz","is_ca":false},{"name":"Bogumił Kamiński","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005296031,0.00149112,0.001800906,0.002800067,0.0009799827,0.002082797,0.002043396,0.002237239,0.001049107],"category_scores_gemma":[0.02520951,0.000487249,0.0006883682,0.00169986,0.0008091099,0.003070622,0.001853556,0.001313334,0.0005261966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001419619,"about_ca_system_score_gemma":0.001445279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007876241,"about_ca_topic_score_gemma":0.00444384,"domain_scores_codex":[0.995986,0.001431479,0.0003381305,0.0008710151,0.0009517609,0.0004215916],"domain_scores_gemma":[0.9787791,0.01396901,0.001407694,0.001892895,0.002855775,0.001095537],"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.006873264,0.001377922,0.02527268,0.0003963885,0.0006597632,0.0001825533,0.0002991393,0.6718979,0.01760548,0.004042206,0.006345135,0.2650476],"study_design_scores_gemma":[0.00004162221,0.0001328549,0.0006632079,0.000006767046,0.00001219848,0.00002573995,0.00004132069,0.9955481,0.002810876,0.0006007192,0.0001073172,0.000009262812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9297717,0.001339986,0.06054262,0.0005903245,0.000256035,0.0001488359,0.0004410124,0.003796207,0.003113148],"genre_scores_gemma":[0.941065,0.000116277,0.05706504,0.00006046219,0.00003683484,0.0000369226,0.00093009,0.00009613091,0.0005933786],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007876241,"threshold_uncertainty_score":0.02800846,"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","authors":[{"name":"Jordan Barrett","is_ca":true},{"name":"Paweł Prałat","is_ca":true},{"name":"Aaron Smith","is_ca":true},{"name":"François Théberge","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003851262,0.0006184051,0.001452193,0.005850321,0.001571988,0.003710525,0.002149785,0.001542633,0.005536622],"category_scores_gemma":[0.03429133,0.0006927282,0.001175268,0.002715816,0.002903511,0.006133088,0.003059024,0.001415242,0.000406905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00220785,"about_ca_system_score_gemma":0.0007286428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003080418,"about_ca_topic_score_gemma":0.003271667,"domain_scores_codex":[0.9955208,0.001917297,0.000266343,0.0009197294,0.000986724,0.0003891528],"domain_scores_gemma":[0.9683018,0.02278244,0.002963742,0.003057092,0.001738019,0.001156775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003089363,0.0001374126,0.02902657,0.0002756731,0.0002264008,0.0004083691,0.001140889,0.3836168,0.008327398,0.5412849,0.001658124,0.03358837],"study_design_scores_gemma":[0.00001181205,0.00003075126,0.002512752,0.00003069951,0.00001833601,0.0001701213,0.0002202633,0.7427898,0.002413471,0.2508459,0.0009149369,0.00004123914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.568302,0.0003701043,0.425945,0.000399533,0.00004348197,0.0001320196,0.0004488879,0.0003370227,0.004022096],"genre_scores_gemma":[0.9321902,0.0001102239,0.06570084,0.00005532068,0.00002763549,0.0001184381,0.0004139044,0.0000988945,0.001284616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005850321,"threshold_uncertainty_score":0.02036768,"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","authors":[{"name":"Ashkan Dehghan","is_ca":true},{"name":"Kinga Siuta","is_ca":true},{"name":"Agata Skorupka","is_ca":true},{"name":"Andrei Betlen","is_ca":false},{"name":"David Miller","is_ca":false},{"name":"Bogumił Kamiński","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00339535,0.001179129,0.0009304442,0.005420888,0.0004445946,0.00195078,0.002050697,0.001956973,0.001435242],"category_scores_gemma":[0.01528093,0.00047188,0.0009601589,0.002783046,0.001348103,0.003581567,0.001597306,0.001596496,0.0005377275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001478847,"about_ca_system_score_gemma":0.0007709155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002654517,"about_ca_topic_score_gemma":0.004381939,"domain_scores_codex":[0.9978331,0.0008783874,0.0001239615,0.000572357,0.0004552887,0.0001368699],"domain_scores_gemma":[0.991994,0.004509693,0.001166885,0.0008968672,0.001192967,0.0002395396],"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.000430751,0.0003078171,0.01749331,0.0004187518,0.0004126652,0.0002028769,0.000439105,0.6795462,0.00663786,0.05612736,0.006134259,0.2318492],"study_design_scores_gemma":[0.000007153363,0.00003594765,0.0008336771,0.0000166236,0.00001551159,0.00003701444,0.00003224989,0.9750863,0.0008280707,0.02263275,0.0004642011,0.00001044544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.074555,0.0005714575,0.9213838,0.0002753384,0.00003647583,0.0001149147,0.0006907235,0.001035795,0.001336477],"genre_scores_gemma":[0.7614515,0.0003274464,0.2337378,0.00008920651,0.00008806067,0.0001874871,0.002492267,0.0002207404,0.001405384],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005420888,"threshold_uncertainty_score":0.01795655,"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","authors":[{"name":"Oscar Goodloe","is_ca":false},{"name":"Zihan Zhou","is_ca":true},{"name":"Joel Nishimura","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005770308,0.0004921732,0.0007723998,0.003094579,0.0007424863,0.001924406,0.0009788629,0.001392849,0.001891185],"category_scores_gemma":[0.06308035,0.0002854953,0.0003360763,0.002454839,0.001431432,0.003160531,0.001498422,0.001223489,0.0003257472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007560999,"about_ca_system_score_gemma":0.0003332985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002059056,"about_ca_topic_score_gemma":0.002171869,"domain_scores_codex":[0.9965966,0.001684609,0.0001710064,0.0006610665,0.0007033192,0.0001834293],"domain_scores_gemma":[0.937815,0.04821689,0.006683738,0.002831046,0.003364569,0.001088682],"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.002372188,0.0003839615,0.4795362,0.0005154843,0.000792856,0.0005992647,0.002872763,0.2883587,0.01805535,0.05412551,0.003877805,0.1485098],"study_design_scores_gemma":[0.00004810914,0.000210613,0.06417936,0.00004877391,0.00008626049,0.0002141072,0.0005400315,0.8644828,0.007217996,0.06171699,0.001171416,0.0000835662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9212635,0.0002304023,0.07518011,0.0002755745,0.00003045082,0.00004514189,0.0003428067,0.0001843132,0.002447711],"genre_scores_gemma":[0.9920311,0.00002527158,0.007496688,0.00001584864,0.00001854464,0.00001468208,0.0002068244,0.00001698852,0.0001740135],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005770308,"threshold_uncertainty_score":0.03051668,"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","authors":[{"name":"Mindaugas Bloznelis","is_ca":false},{"name":"Dominykas Marma","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008445945,0.0004093873,0.000657721,0.001015692,0.0006418521,0.00188608,0.001747548,0.001822022,0.007377604],"category_scores_gemma":[0.005972772,0.0004872636,0.0006670452,0.001067284,0.001538261,0.002657138,0.001279272,0.001159747,0.000593155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001926771,"about_ca_system_score_gemma":0.0007466232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01150225,"about_ca_topic_score_gemma":0.008636389,"domain_scores_codex":[0.9992006,0.0002683609,0.00002335541,0.0001988404,0.000157203,0.0001515567],"domain_scores_gemma":[0.9973931,0.001295479,0.0003851862,0.0002708579,0.0003539638,0.0003012774],"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.0001386014,0.00007881589,0.001416795,0.00006186236,0.00004355417,0.0002439959,0.0003199011,0.6206897,0.001214135,0.3677256,0.003608782,0.004458203],"study_design_scores_gemma":[0.00004530341,0.00003079285,0.0003620437,0.000008426136,0.0000108997,0.00006988208,0.00007527601,0.888599,0.0001386143,0.1090922,0.001551807,0.00001569931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5898903,0.0005450192,0.3543379,0.005196508,0.0001583352,0.0002104124,0.001764783,0.0006418547,0.04725484],"genre_scores_gemma":[0.9773216,0.0001789752,0.01030002,0.0002622711,0.00005118061,0.0001305864,0.0004026045,0.00004298084,0.01130989],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01150225,"threshold_uncertainty_score":0.0246805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}