{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1618,"total_is_capped":false,"direct_labels_cover":3,"predictions_cover":1618,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"c3cff002f5b3","filters":{"topic":"Complex Network Analysis Techniques"}},"results":[{"id":"W1554338108","doi":"10.1017/cbo9780511811395","title":"Models and Methods in Social Network Analysis","year":2005,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2444,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Social network analysis; Centrality; Network analysis; Organizational network analysis; Computer science; Data science; Social network (sociolinguistics); Network science; Dynamic network analysis; Complement (music); Network theory; Exponential random graph models; Data mining; Random graph; Theoretical computer science; Complex network; World Wide Web; Statistics; Social media; Knowledge management; Mathematics; Computer network; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02429333108308914,"gpt":0.2797863220507283,"spread":0.2554929909676392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000300973,0.0003766777,0.0009325496,0.0004553967,0.0002222887,0.00006026237,0.0004059907,0.0002296698,0.00001236789],"category_scores_gemma":[6.334396e-7,0.0004792244,0.00052325,0.0001323784,0.000151721,0.00009695112,0.0005148584,0.000565184,7.276635e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002149337,"about_ca_system_score_gemma":0.0001119111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004254162,"about_ca_topic_score_gemma":0.00001879938,"domain_scores_codex":[0.9983097,0.0002649363,0.0002809999,0.0005890665,0.0001640374,0.0003912977],"domain_scores_gemma":[0.9990269,0.0001203333,0.0002812696,0.0003891158,0.00007801034,0.0001043615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002660721,0.00001942693,0.0001441652,0.00001401546,0.001886846,0.0000137308,0.00007393187,0.001923556,0.000001726548,0.874125,0.1048592,0.01691175],"study_design_scores_gemma":[0.0004562241,0.00001371061,0.0001781181,0.00005228791,0.004371905,4.05368e-7,0.00004007816,0.04295995,0.00001326948,0.001799652,0.9493183,0.0007960635],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000062789,0.0001422902,0.1446818,0.000006676621,0.00001908079,0.0002221723,0.00007938076,0.00007632318,0.8547095],"genre_scores_gemma":[0.002890864,0.00002255394,0.01048882,0.00002244581,0.0008806704,0.000002816826,0.0002165405,0.00003670051,0.9854386],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8723254,"threshold_uncertainty_score":0.9997659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149910108","doi":"10.1073/pnas.0908800106","title":"Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks","year":2009,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1235,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Homophily; Emotional contagion; Social network (sociolinguistics); Social influence; Cluster analysis; Computer science; Node (physics); Econometrics; Data science; Social media; Psychology; Social psychology; Economics; World Wide Web; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0156305687378438,"gpt":0.2893821742104498,"spread":0.273751605472606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000480921,0.00009643014,0.0001822432,0.0001395146,0.0001379387,0.00003812951,0.0006675404,0.00004347574,0.00001071524],"category_scores_gemma":[0.00006925027,0.00007109378,0.00008993233,0.000780897,0.0002433333,0.000257221,0.00008053588,0.0001978832,2.050032e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003834741,"about_ca_system_score_gemma":0.00001690652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001114482,"about_ca_topic_score_gemma":6.96058e-7,"domain_scores_codex":[0.9987311,0.000008265839,0.0003406522,0.0002224896,0.0005535893,0.0001439355],"domain_scores_gemma":[0.9992613,0.000124342,0.000439452,0.00001060958,0.0001410616,0.00002327643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00002749159,0.0001944224,0.7962003,0.00000852742,0.00001830967,1.142177e-8,0.0001844388,0.03824032,0.09924994,0.0594105,0.0001911965,0.006274518],"study_design_scores_gemma":[0.0001548177,0.00002050453,0.5774338,0.000187801,0.0000101946,7.711304e-8,0.00003976095,0.2592838,0.004589258,0.1581826,0.00001647168,0.00008095086],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9968274,0.00003943678,0.0001147978,0.0009889714,0.000005958777,0.0001240058,0.00000727591,0.00001470981,0.0018774],"genre_scores_gemma":[0.997672,0.000002911889,0.002099472,0.0001416116,0.00006746042,0.000005138786,0.000001204429,0.000002596799,0.000007605548],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2210435,"threshold_uncertainty_score":0.289912,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150443611","doi":"10.1126/science.1106340","title":"Team Assembly Mechanisms Determine Collaboration Network Structure and Team Performance","year":2005,"lang":"en","type":"article","venue":"Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1148,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"National Institute of General Medical Sciences","keywords":"Network structure; Work (physics); Knowledge management; Team composition; Computer science; Phase (matter); Engineering; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.005424297446348432,"gpt":0.2468048287048288,"spread":0.2413805312584803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002911167,0.0001067694,0.0001231366,0.00006220528,0.0003723656,0.0001593877,0.0002450789,0.00001900539,0.0000789872],"category_scores_gemma":[0.000004068569,0.00009391908,0.00001921689,0.0008223345,0.0001100122,0.0005040619,0.0001071814,0.00008736857,0.000005809769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004587469,"about_ca_system_score_gemma":0.00008764787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009587299,"about_ca_topic_score_gemma":0.00003459317,"domain_scores_codex":[0.9990486,0.00001439464,0.0001468689,0.0002812127,0.0002333773,0.0002755311],"domain_scores_gemma":[0.9994942,0.00001548399,0.00008848313,0.0002276512,0.00009971851,0.00007448711],"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.00001985675,0.00009310985,0.09359276,0.00001336738,0.00003476966,4.383981e-7,0.0007455144,0.01478924,0.170791,0.05097331,0.008793696,0.660153],"study_design_scores_gemma":[0.0004290106,0.0002314704,0.03417875,0.0000653988,0.00005992559,0.000006061212,0.0002046457,0.712909,0.1881326,0.03478782,0.02826485,0.0007303761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9782496,0.00004549811,0.01761187,0.0001268732,0.00007150522,0.0001508055,0.000004659733,0.00006118802,0.003678004],"genre_scores_gemma":[0.972601,0.000003666093,0.0267043,0.00006893831,0.0003877791,0.000007798892,0.00000468429,0.000005891872,0.0002159698],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6981198,"threshold_uncertainty_score":0.3829909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135957668","doi":"10.1109/tpami.2007.1115","title":"Weighted Graph Cuts without Eigenvectors A Multilevel Approach","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1038,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"National Science Foundation","keywords":"Cluster analysis; Correlation clustering; Spectral clustering; Rand index; Computer science; Pattern recognition (psychology); Kernel (algebra); Hierarchical clustering; Canopy clustering algorithm; Clustering coefficient; Graph partition; Computation; CURE data clustering algorithm; Graph; Algorithm; Mathematics; Artificial intelligence; Theoretical computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01933690194146513,"gpt":0.2806329191327215,"spread":0.2612960171912564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004266697,0.0003675592,0.0005389325,0.0009141719,0.000310356,0.00007825327,0.0002726847,0.00006770729,0.0007893093],"category_scores_gemma":[6.684558e-7,0.000319925,0.0006002772,0.001450475,0.0001116108,0.0001068114,0.000005789194,0.0003973687,0.00001747554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002918118,"about_ca_system_score_gemma":0.00001268901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004905993,"about_ca_topic_score_gemma":0.001219783,"domain_scores_codex":[0.9979668,0.00007376316,0.000571889,0.0006324627,0.0003040389,0.0004510923],"domain_scores_gemma":[0.998908,0.0001166904,0.0001707329,0.0005044952,0.00009360863,0.0002064666],"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.0000405741,0.0006872151,0.06478733,0.00001190475,0.002940278,0.000003377266,0.0003993986,0.004839141,0.000398675,0.0002355777,0.00002236619,0.9256341],"study_design_scores_gemma":[0.0004935626,0.0002377986,0.01918107,0.00006220253,0.006572353,0.00000839483,0.0006458425,0.5611368,0.406463,0.002999016,0.000399554,0.001800357],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03493004,0.00005262841,0.9635645,0.00002425054,0.0000544394,0.0001952304,0.00006232154,0.0001161242,0.001000454],"genre_scores_gemma":[0.9959237,0.00004117573,0.003401973,0.0000916292,0.00006891749,0.00003410262,0.00004607015,0.00002874747,0.0003636722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9609936,"threshold_uncertainty_score":0.9999253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2558664061","doi":"10.1016/j.tim.2016.11.008","title":"Disentangling Interactions in the Microbiome: A Network Perspective","year":2016,"lang":"en","type":"review","venue":"Trends in Microbiology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":890,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University Health Network; University of Toronto","funders":"Canadian Institutes of Health Research","keywords":"Biology; Microbiome; Perspective (graphical); Computational biology; Evolutionary biology; Ecology; Genetics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04128318183299028,"gpt":0.3906388598411947,"spread":0.3493556780082044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003594816,0.0004354595,0.001326986,0.0006887768,0.00007733022,0.00003441917,0.0007142076,0.0001137239,0.001163449],"category_scores_gemma":[0.000003729646,0.0002651965,0.0006673246,0.001406153,0.0001427953,0.00004339239,0.0002004011,0.0007462212,0.00008236685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003144881,"about_ca_system_score_gemma":0.00005343154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001757145,"about_ca_topic_score_gemma":0.0006784822,"domain_scores_codex":[0.9974433,0.000726953,0.000689348,0.0005719601,0.00002772311,0.0005407193],"domain_scores_gemma":[0.9985759,0.0004792548,0.0003515391,0.0005425821,0.00002797113,0.00002280099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004853006,0.0001457617,0.0003638827,0.00005936949,0.000263828,0.0000103581,0.0002925018,0.000003046651,0.00001017256,0.008843093,0.01454468,0.9754584],"study_design_scores_gemma":[0.0001356778,0.00001230586,0.000006770757,0.002425581,0.0001753694,0.00002517928,0.0001458147,0.000003000489,6.330679e-7,0.001910911,0.9948598,0.0002989648],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00001895102,0.9900738,0.0001833585,0.0001492644,0.0002567498,0.0003153232,0.0001824173,0.00003615427,0.008783968],"genre_scores_gemma":[0.003393337,0.9908295,0.0005112099,0.00007119292,0.001843059,0.0004792326,0.001323509,0.00008204918,0.001466946],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9803151,"threshold_uncertainty_score":0.99998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032005951","doi":"10.1561/2200000005","title":"A Survey of Statistical Network Models","year":2010,"lang":"en","type":"article","venue":"Foundations and Trends® in Machine Learning","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":853,"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":"Statistical survey; Computer science; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02131490892849552,"gpt":0.3118738352057813,"spread":0.2905589262772857,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004110871,0.00008728207,0.0001837466,0.0001325422,0.0001143277,0.00003839807,0.00006812611,0.00002218706,0.001225362],"category_scores_gemma":[0.00001531783,0.00008495021,0.00003006454,0.000441542,0.00005509438,0.00007854066,0.00005604184,0.0003726868,0.000001829138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003566504,"about_ca_system_score_gemma":0.00001118466,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006805765,"about_ca_topic_score_gemma":0.004938834,"domain_scores_codex":[0.9992858,0.0001126725,0.0002259464,0.0001553382,0.00007275807,0.0001474427],"domain_scores_gemma":[0.9994798,0.0002288899,0.00008877013,0.0001230693,0.00004283251,0.00003663002],"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.000005879131,0.00005150614,0.7317643,0.000001644846,0.00002870597,2.930499e-7,0.00005486211,0.01369263,0.00001818344,0.1306112,0.0001901109,0.1235807],"study_design_scores_gemma":[0.0001678055,0.00001789891,0.4344636,0.000005966839,0.00001648041,2.876203e-7,0.00000625316,0.5385006,0.000001617488,0.02518119,0.001545269,0.00009296394],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5942988,0.0001551457,0.3813515,0.0000944284,0.00008787137,0.00009678436,0.00009214321,0.00007236697,0.02375093],"genre_scores_gemma":[0.9927197,0.000005125579,0.006282283,0.000003392927,0.00006214254,0.000008691287,0.0006967601,0.000009896418,0.0002120623],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.524808,"threshold_uncertainty_score":0.999808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018165284","doi":"10.1145/1807167.1807306","title":"TwitterMonitor","year":2010,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":818,"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":"Computer science; Analytics; Data science; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.004123231302920851,"gpt":0.250569348265993,"spread":0.2464461169630721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003044724,0.00004139599,0.00004999657,0.00001869051,0.0000303837,0.00002116123,0.00008661994,0.00000859107,0.007114456],"category_scores_gemma":[4.119036e-7,0.00003399397,0.0000461809,0.00005574554,0.00001356576,0.00002813065,0.00002621796,0.00009206209,0.00011225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":8.794057e-7,"about_ca_system_score_gemma":0.000004508888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000872642,"about_ca_topic_score_gemma":0.000008248234,"domain_scores_codex":[0.9997504,0.000003446979,0.00005628627,0.00007227597,0.00003919972,0.00007841443],"domain_scores_gemma":[0.9997633,0.00001090993,0.00001493587,0.0001675618,0.00001542607,0.00002785364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001379557,0.00009149857,0.3457312,5.930895e-7,0.00004410974,4.403852e-7,0.00002648466,8.432353e-7,0.05032342,0.4301416,0.05112539,0.122513],"study_design_scores_gemma":[0.0003537282,0.00003148749,0.07665581,0.000004957098,0.00005784197,0.000001189456,0.00008006321,0.003756195,0.1387938,0.2505217,0.5291271,0.0006160925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6646574,9.00218e-7,0.0296728,0.0001167441,0.00009134253,0.00003911885,7.426841e-7,0.0001150397,0.305306],"genre_scores_gemma":[0.9892641,3.561042e-8,0.008679584,0.00003279652,0.0005116317,0.000007348325,0.000003563573,0.000004435866,0.001496445],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4780017,"threshold_uncertainty_score":0.9937932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001550906","doi":"10.1257/aer.97.3.890","title":"Meeting Strangers and Friends of Friends: How Random Are Social Networks?","year":2007,"lang":"en","type":"article","venue":"American Economic Review","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":649,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Random graph; Dominance (genetics); Network formation; Social network (sociolinguistics); Cluster analysis; Preferential attachment; Stochastic dominance; Computer science; Giant component; Spatial network; Degree (music); Stochastic process; Complex network; Mathematics; Econometrics; Theoretical computer science; Combinatorics; Statistics; Graph; Artificial intelligence; World Wide Web; Physics; Social media","retraction":null,"screen_n_in":null,"score":{"opus":0.009329629330325499,"gpt":0.2713615775976199,"spread":0.2620319482672944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006946534,0.0001760107,0.0008608688,0.00005187947,0.00008045382,0.00002668021,0.0001613483,0.00001635665,0.0001899567],"category_scores_gemma":[0.000003526984,0.0001719883,0.0002546238,0.0001749903,0.0002352815,0.00008888209,0.00005666896,0.0001121705,0.000002989332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000271718,"about_ca_system_score_gemma":0.00001780452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002474428,"about_ca_topic_score_gemma":0.0000314171,"domain_scores_codex":[0.9988808,0.00007370141,0.0004491736,0.0002661569,0.00005503245,0.0002751089],"domain_scores_gemma":[0.9987313,0.0001447477,0.0008140985,0.0002106249,0.00002680534,0.00007241643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002252962,0.00003905338,0.06233934,0.0001564183,0.0004979782,0.000001151269,0.0001090839,0.00003575904,0.00001568959,0.003457901,0.007037349,0.9262878],"study_design_scores_gemma":[0.009947799,0.0009454426,0.1651941,0.01309189,0.009299363,0.00002070813,0.0199678,0.02843668,0.0009799993,0.007497431,0.7368405,0.007778238],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5571641,0.1431951,0.1347288,0.005042883,0.0003877392,0.002765155,0.0001381595,0.0003915254,0.1561865],"genre_scores_gemma":[0.9937049,0.0047958,0.0009133507,0.0001553093,0.0003529447,0.00001669609,0.00001732232,0.00001927419,0.00002441855],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9185095,"threshold_uncertainty_score":0.7013478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111347866","doi":"10.1109/tvcg.2007.70582","title":"NodeTrix: a Hybrid Visualization of Social Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Visualization and Computer Graphics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":553,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Ontario Institute for Cancer Research","funders":"","keywords":"Computer science; Visualization; Representation (politics); Data visualization; Set (abstract data type); Key (lock); Social network analysis; Adjacency matrix; Node (physics); Data science; Theoretical computer science; Adjacency list; Information visualization; Graph drawing; Data mining; World Wide Web; Graph; Social media; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01199413693648282,"gpt":0.286755499340916,"spread":0.2747613624044332,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002671724,0.0001743014,0.0002378625,0.0003969513,0.0002615622,0.00004687,0.00009745642,0.00005983523,0.00008370995],"category_scores_gemma":[3.31343e-7,0.0001891162,0.0001553408,0.0008651665,0.00008689232,0.0001081476,0.00000304692,0.0001249163,0.000001105225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001291208,"about_ca_system_score_gemma":0.00001407377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000335199,"about_ca_topic_score_gemma":0.00001286691,"domain_scores_codex":[0.9988576,0.00006801195,0.0004195385,0.0002455209,0.0002127485,0.0001965376],"domain_scores_gemma":[0.999358,0.00008144764,0.0001792885,0.0001378221,0.0001778952,0.00006552538],"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.00006186395,0.0005797622,0.002314609,0.00002213848,0.0002132767,9.279936e-7,0.0005134909,0.00259541,0.00003942327,0.9558716,0.0006672225,0.03712025],"study_design_scores_gemma":[0.0004988797,0.0001369003,0.001592499,0.00003014925,0.0001041179,0.00000111643,0.00005074159,0.9890976,0.005219771,0.002177837,0.0008202126,0.0002701791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03150703,0.00001330967,0.9678363,0.000006470406,0.0001559645,0.0001523825,0.000009625787,0.000112143,0.0002068299],"genre_scores_gemma":[0.9992326,0.00002035937,0.000277546,0.0001619415,0.0001974403,0.000007610346,0.00004634504,0.00002431265,0.00003184799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9865022,"threshold_uncertainty_score":0.7711934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2478496062","doi":"10.20982/tqmp.11.1.p008","title":"Hierarchical Cluster Analysis: Comparison of Three Linkage Measures and Application to Psychological Data","year":2015,"lang":"en","type":"article","venue":"The Quantitative Methods for Psychology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":543,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"University of Ottawa","keywords":"Linkage (software); Cluster (spacecraft); Hierarchical clustering; Computer science; Psychology; Data mining; Statistics; Cluster analysis; Mathematics; Artificial intelligence; Biology; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.3452505785625193,"gpt":0.5799659791907616,"spread":0.2347154006282424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005593457,0.0001707196,0.0006593447,0.0001863549,0.0000907804,0.0000218722,0.001379487,0.00006772209,0.00001586415],"category_scores_gemma":[0.0002121376,0.0001159877,0.0001072052,0.0007754525,0.0003266267,0.00006750752,0.0005122516,0.0002268115,0.000004145762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006452937,"about_ca_system_score_gemma":0.00001181026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007017788,"about_ca_topic_score_gemma":0.00009032228,"domain_scores_codex":[0.9971049,0.001298902,0.0005184699,0.0007140739,0.0001379128,0.0002257681],"domain_scores_gemma":[0.9959264,0.001512036,0.0002717882,0.00198775,0.0001965668,0.000105422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008624062,0.00066537,0.04532025,0.000008758704,0.002390639,9.080338e-8,0.001807461,0.0005284068,0.001596562,0.1534674,0.01259716,0.7807555],"study_design_scores_gemma":[0.001012549,0.001043049,0.02770716,0.000009335015,0.00188309,0.000001047594,0.0006478531,0.4110164,0.0001905673,0.5271239,0.02901431,0.0003506619],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01510737,0.0003777573,0.9807233,0.002173986,0.0000583316,0.0006439998,0.0001152172,0.00003267522,0.0007674285],"genre_scores_gemma":[0.457681,0.000001860691,0.5418146,0.0001642562,0.00007101939,0.00007250828,0.0001782743,0.000009440822,0.00000707252],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7804049,"threshold_uncertainty_score":0.4729842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990570693","doi":"10.1109/icdm.2011.132","title":"SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":505,"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":"Maximization; Greedy algorithm; Computer science; Set (abstract data type); Time complexity; Running time; Algorithm; Approximation algorithm; Simple (philosophy); Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04184048520806127,"gpt":0.2850095289828672,"spread":0.243169043774806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001488079,0.0001072752,0.0001030768,0.00003122133,0.0001413977,0.00002919307,0.0002292337,0.00002229918,0.0001298767],"category_scores_gemma":[7.473715e-7,0.00007137932,0.00008607768,0.0001267345,0.00003672048,0.00008183071,0.00005625077,0.00006359099,0.000005241751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001101943,"about_ca_system_score_gemma":0.00002229716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001378372,"about_ca_topic_score_gemma":0.000006981156,"domain_scores_codex":[0.9993645,0.00001380702,0.0001616979,0.0001891363,0.00009793092,0.0001729317],"domain_scores_gemma":[0.9994118,0.00002181897,0.0000606224,0.0003509556,0.0001112802,0.00004356692],"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.000006248986,0.0002125851,0.0006913787,0.00000123714,0.00004471546,5.805515e-8,0.0004288138,0.8142594,0.00007952841,0.16113,0.0003046701,0.02284137],"study_design_scores_gemma":[0.00009440455,0.00002787596,0.0001999604,0.00000243439,0.00003167735,6.58532e-8,0.0001563883,0.9568723,0.001311997,0.04114507,0.00005831763,0.00009945682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0910709,0.000004925773,0.9058926,0.00002486612,0.00001096803,0.0002524671,0.0000096214,0.00008035275,0.002653267],"genre_scores_gemma":[0.8745739,5.172855e-7,0.1249145,0.0001321899,0.00008731043,0.00006352672,0.00002918081,0.00001403441,0.0001848652],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.783503,"threshold_uncertainty_score":0.2910764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080243455","doi":"10.1103/physreve.69.046106","title":"Statistical analysis of airport network of China","year":2004,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":469,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Degree (music); Clustering coefficient; Power law; Topology (electrical circuits); Path (computing); Mathematics; Power (physics); Statistical physics; Physics; Cluster analysis; Statistics; Combinatorics; Computer science; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01169864230698257,"gpt":0.3276967364990397,"spread":0.3159980941920571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001856182,0.0001353004,0.001032279,0.00003963409,0.00002334695,0.000003753099,0.0001914124,0.000009438773,0.0004422013],"category_scores_gemma":[0.0000140892,0.0001118614,0.0005988884,0.001359485,0.00008439977,0.00003647984,0.0000687096,0.0001025966,0.000007375625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000146125,"about_ca_system_score_gemma":0.00003900634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002367143,"about_ca_topic_score_gemma":0.000005695635,"domain_scores_codex":[0.9988717,0.00005145995,0.0004609947,0.0001978716,0.0002370863,0.0001808309],"domain_scores_gemma":[0.9990577,0.00008755145,0.0002963321,0.0004088684,0.00008344919,0.00006613597],"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.000006298496,0.0006204011,0.03272587,0.0002640966,0.002208946,8.684725e-7,0.00003698178,0.004976216,0.0001490756,0.923718,0.00156561,0.03372757],"study_design_scores_gemma":[0.0004135396,0.0002283869,0.2410697,0.001847325,0.01796269,2.524012e-7,0.000008319085,0.006806416,0.00145351,0.7249579,0.004651198,0.0006008341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3871229,0.007664508,0.576551,0.0004005219,0.00004896943,0.0008463913,0.0002193715,0.00009813404,0.02704822],"genre_scores_gemma":[0.9961004,0.0002993073,0.003267898,0.00003665343,0.0001501079,0.00001810677,0.0001101891,0.000009171949,0.000008138637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6089775,"threshold_uncertainty_score":0.4841794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991635064","doi":"10.14778/2047485.2047492","title":"A data-based approach to social influence maximization","year":2011,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":426,"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":"Maximization; Submodular set function; Computer science; Scalability; Perspective (graphical); Set (abstract data type); Function (biology); Expectation–maximization algorithm; Social graph; Social network (sociolinguistics); Mathematical optimization; Theoretical computer science; Artificial intelligence; Social media; Mathematics; Maximum likelihood; World Wide Web; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05672051885013572,"gpt":0.261899610639344,"spread":0.2051790917892083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001897652,0.0001078313,0.000147904,0.00005497216,0.0001026118,0.0000262754,0.0008376284,0.00001696663,0.00003992527],"category_scores_gemma":[0.000007701671,0.00008083672,0.0000703746,0.0003376387,0.00003948303,0.000129089,0.0004174236,0.0000717825,0.000003525869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002244541,"about_ca_system_score_gemma":0.00001825403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001718112,"about_ca_topic_score_gemma":8.928153e-7,"domain_scores_codex":[0.9991882,0.000005196845,0.0002068232,0.000237837,0.0002049617,0.0001569235],"domain_scores_gemma":[0.9994437,0.000005939384,0.0001827156,0.0001961257,0.0001363718,0.00003515072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000259692,0.003268426,0.311396,0.0002379323,0.000737233,1.195329e-7,0.007647622,0.001433757,0.0393011,0.5405243,0.05879339,0.03640039],"study_design_scores_gemma":[0.002720632,0.0003543933,0.116855,0.0003289368,0.001238319,0.000001704302,0.002716396,0.05931924,0.663236,0.120175,0.03104957,0.002004891],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.74912,0.00002038936,0.06211278,0.0005928532,0.00007950699,0.00201412,0.0001760467,0.000237267,0.185647],"genre_scores_gemma":[0.9810469,1.998131e-7,0.01863574,0.00008277109,0.00007859983,0.000078779,0.00001437151,0.00001094837,0.00005167943],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6239349,"threshold_uncertainty_score":0.3296426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076916637","doi":"10.1016/j.physa.2010.04.008","title":"The complexity and robustness of metro networks","year":2010,"lang":"en","type":"article","venue":"Physica A Statistical Mechanics and its Applications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":424,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Robustness (evolution); Computer science; Computer network; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01662984353690914,"gpt":0.2789023387438961,"spread":0.2622724952069869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001250082,0.0001117437,0.0001922905,0.00001793083,0.0003256159,0.00005160444,0.0001509572,0.00002273116,0.00004359118],"category_scores_gemma":[0.00001001312,0.00008442095,0.00003485646,0.0001773538,0.0001226738,0.00003395256,0.0001244239,0.0002099792,0.000001056784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000265045,"about_ca_system_score_gemma":0.00001174849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002601392,"about_ca_topic_score_gemma":0.00003171869,"domain_scores_codex":[0.9992868,0.00002551551,0.0002104505,0.0002102767,0.00009836972,0.000168529],"domain_scores_gemma":[0.9989801,0.0004568976,0.0001094647,0.0002555941,0.0001069673,0.00009095148],"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.000002897998,0.00005929156,0.00003633228,0.000004390198,0.00003378921,1.591038e-8,0.000005616116,0.00002387385,0.000542396,0.9699316,0.0002124853,0.02914731],"study_design_scores_gemma":[0.00007051589,0.00001739499,0.0004223939,0.000002454373,0.0000598909,2.038944e-7,0.00002908543,0.5457376,0.0001728946,0.4500589,0.003340055,0.00008861182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006682736,0.0000539488,0.99216,0.0002765472,0.00002068823,0.0003116911,0.000120229,0.00002340145,0.0003507512],"genre_scores_gemma":[0.9878734,0.00002439777,0.01167381,0.000008125634,0.0001711293,0.0001894618,0.00003751667,0.00001106376,0.00001103304],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9811907,"threshold_uncertainty_score":0.3442586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950146322","doi":"10.1002/asi.20335","title":"Co‐occurrence matrices and their applications in information science: Extending ACA to the Web environment","year":2006,"lang":"en","type":"article","venue":"Journal of the American Society for Information Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":355,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Visualization; Matrix (chemical analysis); Information retrieval; Set (abstract data type); Distance matrix; Citation; Data mining; Data set; Confusion; Data science; Theoretical computer science; Algorithm; World Wide Web; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.006026340354717904,"gpt":0.269356313451892,"spread":0.2633299730971741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001291441,0.00007175601,0.0001259701,0.0003939719,0.0006110576,0.0001704966,0.0006007427,0.00001368171,0.000001272295],"category_scores_gemma":[0.00002323689,0.00003974262,0.00006226804,0.002782677,0.001482004,0.001803054,0.0001479975,0.0001374429,9.939286e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008511676,"about_ca_system_score_gemma":0.0001469521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002021383,"about_ca_topic_score_gemma":0.000001005073,"domain_scores_codex":[0.999122,0.000005557186,0.0003434768,0.00006661918,0.0002834815,0.0001788746],"domain_scores_gemma":[0.9988908,0.00005282786,0.0006456109,0.0001648158,0.0002160501,0.00002995469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001374018,0.00006184104,0.07942268,0.00001649099,0.00003461209,1.45008e-8,0.003769309,0.001172976,0.007986821,0.08539034,0.006715506,0.8154157],"study_design_scores_gemma":[0.000782873,0.0003591479,0.05918407,0.00006688409,0.00007349564,0.0000303539,0.06976124,0.03689148,0.01526063,0.02817091,0.7889131,0.0005057954],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.931191,0.00004885414,0.06328074,0.004550335,0.00002790562,0.0004937411,0.00004154052,0.00001774784,0.0003481602],"genre_scores_gemma":[0.997105,0.00005887832,0.00258769,0.0001830997,0.00002401403,0.00003669762,0.000002248863,9.594485e-7,0.000001388058],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8149099,"threshold_uncertainty_score":0.5460505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005498212","doi":"10.1287/orsc.1100.0600","title":"Network Exchange Patterns in Online Communities","year":2010,"lang":"en","type":"article","venue":"Organization Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":346,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Fox School of Business, Temple University; Canada Research Chairs","keywords":"Reciprocity (cultural anthropology); Exponential random graph models; Online participation; Social exchange theory; Online community; Preferential attachment; Information exchange; Norm of reciprocity; Scale (ratio); Complex network; The Internet; Computer science; Social psychology; Sociology; Psychology; Graph; Social capital; World Wide Web; Random graph; Theoretical computer science; Geography; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0147539972098864,"gpt":0.2711749183502127,"spread":0.2564209211403263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002803232,0.0000638826,0.0000817335,0.0001057805,0.0001929173,0.00009077947,0.0004109744,0.00001393087,0.001947675],"category_scores_gemma":[0.00001011852,0.00006304218,0.00001028686,0.001923629,0.0001254063,0.0002167424,0.0001758663,0.0001518607,0.0000130976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001272127,"about_ca_system_score_gemma":0.00004766971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004946473,"about_ca_topic_score_gemma":0.001037549,"domain_scores_codex":[0.9994053,0.00002019891,0.0001282182,0.0001140273,0.0001512849,0.0001809907],"domain_scores_gemma":[0.9994327,0.0000275368,0.00005691852,0.0002844518,0.0001614265,0.00003701172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[1.814822e-7,0.00003751726,0.9845933,7.899315e-7,9.446495e-7,1.101699e-7,0.0003909632,0.0001224856,0.001331587,0.008976685,0.0002363937,0.004309049],"study_design_scores_gemma":[0.0001585364,0.00001328069,0.9770166,0.00002480559,0.000007394373,8.74559e-7,0.0009917408,0.008841259,0.003144142,0.00674093,0.002803769,0.0002566191],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9691559,0.000002899833,0.02919251,0.0001542123,0.00009873758,0.00006194664,0.000005799902,0.00005447473,0.001273514],"genre_scores_gemma":[0.9975475,0.000001839466,0.001948676,0.0001113035,0.0002471243,0.00000258846,0.00005901768,0.000008578102,0.00007339469],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02839157,"threshold_uncertainty_score":0.9989647,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146653491","doi":"10.1136/jech.2003.014530","title":"A glossary of terms for navigating the field of social network analysis","year":2004,"lang":"en","type":"review","venue":"Journal of Epidemiology & Community Health","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":343,"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":"Fondation pour la Recherche Médicale; University of Calgary","keywords":"Glossary; Social network analysis; Field (mathematics); Computer science; Social network (sociolinguistics); Data science; Sociology; Linguistics; World Wide Web; Social media; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1161245272876579,"gpt":0.5037805052009522,"spread":0.3876559779132943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01634551,0.0003311067,0.006415553,0.0002083395,0.0005757453,0.000006099719,0.001329571,0.0002337428,0.00004474384],"category_scores_gemma":[0.0007054621,0.0002163938,0.004081296,0.001037749,0.0002492837,0.00004478579,0.0002665957,0.003355506,2.033582e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001740326,"about_ca_system_score_gemma":0.0009091597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004062602,"about_ca_topic_score_gemma":0.0003728951,"domain_scores_codex":[0.9880309,0.007052043,0.004144667,0.0001572174,0.000142184,0.0004729736],"domain_scores_gemma":[0.9642394,0.02300497,0.01153732,0.0008354514,0.000283263,0.00009961484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003202104,0.0002717612,0.007308032,0.005251276,0.008676384,2.537699e-7,0.0004171596,0.0007823597,5.014981e-8,0.01438411,0.008231957,0.9546446],"study_design_scores_gemma":[0.0007499005,0.002141279,0.001666728,0.03354084,0.01908557,0.00001686511,0.0006085584,0.0003987615,9.103978e-7,0.2125194,0.7286118,0.0006594042],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0001895108,0.9326349,0.06475325,0.001446041,0.0001056515,0.0005567305,0.00009145708,0.000008582604,0.0002138874],"genre_scores_gemma":[0.01848542,0.9547115,0.02412496,0.0007267186,0.001572294,0.00004013485,0.0002845095,0.00004564641,0.000008786934],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9539852,"threshold_uncertainty_score":0.9989438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1502487903","doi":"10.1007/978-3-642-17572-5_48","title":"Threshold Models for Competitive Influence in Social Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":316,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Maximization; Competitor analysis; Greedy algorithm; Mathematical optimization; Cascade; Set (abstract data type); Square root; Extension (predicate logic); Conjecture; Product (mathematics); Mathematical economics; Algorithm; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01530642877649156,"gpt":0.2650131315491454,"spread":0.2497067027726538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004940854,0.0004281618,0.0006107463,0.0004364064,0.0002651991,0.0002110664,0.001131701,0.0002636797,0.00004714433],"category_scores_gemma":[0.000005596863,0.0004278721,0.0002136136,0.0003580242,0.0006700816,0.0002664824,0.0004879179,0.001201511,0.000002465876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001171461,"about_ca_system_score_gemma":0.0001921916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006524856,"about_ca_topic_score_gemma":0.0003284543,"domain_scores_codex":[0.997664,0.00001427701,0.0004616897,0.0009225124,0.0003576188,0.000579887],"domain_scores_gemma":[0.9986364,0.0003142839,0.0002535571,0.00047726,0.0002460481,0.00007243615],"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.00001496689,0.00004084781,0.0007766795,0.00001120399,0.00002383516,0.000004315611,0.0003351518,0.4907555,0.0000614468,0.374411,0.00002352745,0.1335415],"study_design_scores_gemma":[0.000133345,0.00002444437,0.00009134825,0.0001051138,0.00001005513,4.725557e-7,1.857337e-7,0.4752453,0.0001004227,0.5235688,0.0004162231,0.0003043168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004885605,0.0000622828,0.9910991,0.0001243883,0.0002143317,0.0005563539,0.00001789195,0.00005477476,0.007382324],"genre_scores_gemma":[0.9420043,0.000004208502,0.05596889,0.000323124,0.001494687,0.00005161789,0.00003483873,0.00004023205,0.00007808892],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9415157,"threshold_uncertainty_score":0.9998173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111289574","doi":"10.1145/1052934.1052942","title":"Link analysis ranking: algorithms, theory, and experiments","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Internet Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":308,"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":"Computer science; Hyperlink; Link analysis; HITS algorithm; Ranking (information retrieval); Algorithm; Learning to rank; Bayesian network; Web page; Graph; Theoretical computer science; Information retrieval; Machine learning; Web navigation; Web search engine; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01240196685194532,"gpt":0.292649307197903,"spread":0.2802473403459577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001576126,0.0002017997,0.0003230092,0.0008814135,0.00009667721,0.00003932987,0.0004671198,0.0001159786,0.002007952],"category_scores_gemma":[0.000004525723,0.0001976944,0.0002023442,0.0008855992,0.0001497836,0.00008249857,0.00003286375,0.0003351691,0.00004677341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003905532,"about_ca_system_score_gemma":0.000008206492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008701304,"about_ca_topic_score_gemma":0.00003677453,"domain_scores_codex":[0.9989039,0.00005758684,0.000280444,0.0004033713,0.000104117,0.0002506063],"domain_scores_gemma":[0.9990131,0.00009988828,0.00008249754,0.0007123869,0.00004328416,0.00004887662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000345303,0.0002114325,0.003085054,0.000001366043,0.002267044,0.000001314901,0.0002219407,0.000266964,0.0003909078,0.03800557,0.0001818468,0.955332],"study_design_scores_gemma":[0.002898232,0.0008337701,0.001597404,0.0001037415,0.005417837,0.00002275609,0.001805897,0.05244728,0.4484238,0.3434203,0.1409895,0.002039486],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07478326,0.0001333685,0.9220191,0.001359129,0.00003658253,0.0001293551,0.00001110069,0.0003952364,0.00113292],"genre_scores_gemma":[0.9801556,0.00001655567,0.01843191,0.00008206262,0.00008080269,0.00008129895,0.00001381797,0.00001990302,0.001118022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9532925,"threshold_uncertainty_score":0.9989043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2598116636","doi":"10.25300/misq/2017/41.4.08","title":"Social Media Affordances for Connective Action: An Examination of Microblogging Use During the Gulf of Mexico Oil Spill1","year":2017,"lang":"en","type":"article","venue":"MIS Quarterly","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":285,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Affordance; Social media; Action (physics); Microblogging; Collective action; Oil spill; Public relations; Sociology; Political science; Media studies; Psychology; World Wide Web; Computer science; Engineering; Petroleum engineering; Politics; Cognitive psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.03735162908452699,"gpt":0.3061093531635858,"spread":0.2687577240790588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002024957,0.00009689577,0.0002104674,0.00004425699,0.0004110967,0.00007286386,0.0002586411,0.00002635513,0.00004094108],"category_scores_gemma":[0.00001005219,0.00008050498,0.0001359292,0.00004244132,0.0001221254,0.0003214628,0.00001329982,0.00005527829,5.179398e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001695687,"about_ca_system_score_gemma":0.00001204738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002713936,"about_ca_topic_score_gemma":0.0004523179,"domain_scores_codex":[0.9993476,0.00005539524,0.0002175634,0.0001538131,0.00009827875,0.0001273148],"domain_scores_gemma":[0.9989077,0.0001878963,0.0004563875,0.0002953592,0.000134645,0.00001798839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001056839,0.0002556701,0.01726888,0.00008613819,0.0003695618,3.145176e-7,0.02631227,0.00001730881,0.1013927,0.0103963,0.0002651926,0.84353],"study_design_scores_gemma":[0.002120013,0.0005448141,0.6810911,0.000183458,0.0003658282,0.000001049793,0.01268746,0.00272459,0.2639775,0.03459695,0.001079805,0.0006274622],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9949864,0.00001207573,0.004297962,0.00009840151,0.00004703017,0.00008626128,0.00003966007,0.00001441305,0.0004177778],"genre_scores_gemma":[0.9986284,7.990366e-7,0.000848132,0.000002042804,0.0003811916,0.00003531948,0.00002505259,0.0000100846,0.00006898269],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8429025,"threshold_uncertainty_score":0.3282898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2735861106","doi":"10.1126/science.aal4122","title":"Effects of network modularity on the spread of perturbation impact in experimental metapopulations","year":2017,"lang":"en","type":"article","venue":"Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":268,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Metapopulation; Modularity (biology); Perturbation (astronomy); Computer science; Biology; Statistical physics; Evolutionary biology; Physics; Demography; Sociology; Astronomy; Population","retraction":null,"screen_n_in":null,"score":{"opus":0.01970721488104545,"gpt":0.3361135036015257,"spread":0.3164062887204803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003614616,0.00004844583,0.0001014876,0.00003895461,0.0002170694,0.00003403671,0.0003554621,0.000007127975,0.00003355363],"category_scores_gemma":[0.00003018111,0.00003161261,0.00006318158,0.0001842634,0.0002425195,0.0001483,0.00008113947,0.00004561185,5.795981e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002057262,"about_ca_system_score_gemma":0.00002586546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005817565,"about_ca_topic_score_gemma":0.00001020973,"domain_scores_codex":[0.9994918,0.00003040539,0.0001056998,0.0001084841,0.0001601013,0.000103491],"domain_scores_gemma":[0.9993604,0.00007700106,0.0001551553,0.0003584268,0.00003210652,0.00001685074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00001754032,0.0003570778,0.5774099,0.000005784033,0.00003905061,2.356827e-7,0.0006856009,0.01101268,0.0976285,0.3059204,0.0001826598,0.00674057],"study_design_scores_gemma":[0.00008354617,0.00004420577,0.7111176,0.00004368593,0.000009876596,2.803026e-8,0.00002896304,0.02769737,0.2201923,0.04072349,0.000006159262,0.0000528657],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9964362,0.00003722125,0.001151547,0.00003271236,0.00002278419,0.0001307083,9.93271e-7,0.000003569039,0.002184231],"genre_scores_gemma":[0.9995084,3.751838e-7,0.0004306319,0.000003213446,0.00002837992,0.000009787222,8.254167e-7,0.000001760194,0.00001667522],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2651969,"threshold_uncertainty_score":0.1669545,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064796447","doi":"10.1073/pnas.0912671107","title":"Edge direction and the structure of networks","year":2010,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":259,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development","keywords":"Assortativity; Computer science; Complex network; Class (philosophy); Evolving networks; Theoretical computer science; Adjacency list; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Artificial intelligence; Algorithm; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01211060845096483,"gpt":0.2758726139049613,"spread":0.2637620054539964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006029395,0.00005049852,0.0001142484,0.00004984158,0.0001348044,0.00001495401,0.0003765654,0.00002988651,0.00002898302],"category_scores_gemma":[0.00003927871,0.00002603645,0.0000599361,0.0004232307,0.0009966947,0.0001315703,0.0001006465,0.0001775825,2.788001e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000237908,"about_ca_system_score_gemma":0.000007351964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002127222,"about_ca_topic_score_gemma":2.444274e-7,"domain_scores_codex":[0.9993207,0.000004518174,0.0001768232,0.0001014838,0.0003331968,0.00006323671],"domain_scores_gemma":[0.9993822,0.0001047928,0.0003444262,0.000006954889,0.0001507876,0.00001082784],"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.0000120423,0.00001606065,0.04704353,0.000008982166,0.00003181165,9.538628e-11,0.000117313,0.0001647422,0.1804232,0.7674201,0.0007501201,0.004012096],"study_design_scores_gemma":[0.0002250518,0.00001381943,0.1015889,0.00003346863,0.00004228824,0.000001059437,0.0001052053,0.02205516,0.241221,0.6342654,0.000374667,0.00007402778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9932005,0.00004569304,0.00002145674,0.0008160216,0.00001673054,0.0001060979,0.000004875645,0.000005323183,0.005783247],"genre_scores_gemma":[0.999027,0.000004233074,0.0007440664,0.00002554656,0.0001605136,0.00000179081,8.314346e-8,0.000001550057,0.00003519341],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1331548,"threshold_uncertainty_score":0.3672363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967510236","doi":"10.1209/0295-5075/97/16006","title":"Percolation theory on interdependent networks based on epidemic spreading","year":2012,"lang":"en","type":"article","venue":"Europhysics Letters (EPL)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":252,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Interdependent networks; Dependency (UML); Percolation theory; Percolation (cognitive psychology); Interdependence; Extension (predicate logic); Network theory; Directed percolation","retraction":null,"screen_n_in":null,"score":{"opus":0.01046642374614039,"gpt":0.2452813521588726,"spread":0.2348149284127322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005942247,0.0003117719,0.0002807847,0.0001282165,0.0001805706,0.00006998037,0.0002931579,0.00003064911,0.0002218688],"category_scores_gemma":[0.000008970659,0.0003023147,0.0002907234,0.0002497094,0.00004806582,0.0001836688,0.00008338539,0.0004863794,0.0002179835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000966338,"about_ca_system_score_gemma":0.00000703402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001898574,"about_ca_topic_score_gemma":2.770309e-7,"domain_scores_codex":[0.998036,0.0005230184,0.0003051498,0.0003614418,0.0002669986,0.0005073387],"domain_scores_gemma":[0.9986151,0.0004295929,0.0001977296,0.0006108264,0.00002850702,0.0001182578],"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.0003979206,0.001687523,0.1076182,0.00002994727,0.000583927,0.00001696458,0.001225534,0.3036126,0.0309668,0.272995,0.04423166,0.2366339],"study_design_scores_gemma":[0.002646788,0.0007151432,0.07193298,0.000936698,0.0008480932,0.000002169188,0.0002564168,0.8556751,0.01740845,0.02403125,0.02158676,0.003960114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2847892,0.00001337855,0.6962627,0.0004703881,0.0003576348,0.0002591008,0.000006408472,0.0001996642,0.01764156],"genre_scores_gemma":[0.9923325,6.596398e-7,0.0006978135,0.003797238,0.002917141,0.00002676618,0.000079784,0.00007318834,0.00007486133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7075434,"threshold_uncertainty_score":0.9999429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000922801","doi":"10.1007/978-3-031-01850-3","title":"Information and Influence Propagation in Social Networks","year":2014,"lang":"en","type":"book","venue":"Synthesis lectures on data management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":252,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Social media; Social network (sociolinguistics); Internet privacy; Sociology; Economic geography; Computer science; World Wide Web; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.01122099561622583,"gpt":0.2480253541348997,"spread":0.2368043585186738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004543947,0.0003032823,0.0003662332,0.0003519616,0.0001316921,0.0002264498,0.0006893984,0.0001082857,0.00009903804],"category_scores_gemma":[0.00001338368,0.0002905577,0.00005342382,0.0001286799,0.00005145484,0.0003882378,0.0006445822,0.0003079674,0.00002423675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009791748,"about_ca_system_score_gemma":0.00002494841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005042991,"about_ca_topic_score_gemma":0.00004088724,"domain_scores_codex":[0.9986088,0.00008777361,0.0004219187,0.0003667127,0.0002827024,0.0002321197],"domain_scores_gemma":[0.9986321,0.0001243196,0.0003376883,0.0008428374,0.00003211043,0.00003090837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002867602,0.00003250257,0.0002083979,0.0001353264,0.0002678841,0.000001045555,0.0000498708,0.002537972,2.682292e-7,0.06653684,0.1784481,0.7517531],"study_design_scores_gemma":[0.0002399254,0.00003179319,0.004490782,0.0005729288,0.000419072,2.149594e-7,0.00002546274,0.02377201,0.00001281397,0.03103605,0.938645,0.0007539391],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0004150633,0.0001358019,0.1300945,0.0004625688,0.0001006571,0.002180177,0.0002909523,0.0002261351,0.8660941],"genre_scores_gemma":[0.9510003,0.0002089843,0.002025623,0.001072804,0.002036404,0.000708235,0.0121216,0.00012802,0.03069802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9505852,"threshold_uncertainty_score":0.9999546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621145626","doi":"10.14778/3099622.3099626","title":"Attribute-driven community search","year":2017,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":241,"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":"Computer science; Node (physics); Theoretical computer science; Relevance (law); Graph; Community structure; Cohesion (chemistry); Data mining; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04102465157361466,"gpt":0.3032241378313941,"spread":0.2621994862577794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003992121,0.0001178787,0.0002042,0.00003298868,0.0009214783,0.0001283639,0.001490695,0.00001998553,0.0001045891],"category_scores_gemma":[0.00001603418,0.00008449266,0.0001849713,0.00007309437,0.0001575961,0.0001373857,0.001180349,0.0003128576,0.000007502631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003620216,"about_ca_system_score_gemma":0.00001500255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001413415,"about_ca_topic_score_gemma":0.000009821865,"domain_scores_codex":[0.9992111,0.0000151905,0.0001915436,0.0001225815,0.0002438831,0.0002156724],"domain_scores_gemma":[0.9989951,0.00002920504,0.0002797107,0.000463671,0.0001853656,0.00004698851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001227167,0.0002732651,0.9129953,0.00003240821,0.0002106703,5.489399e-8,0.000570152,0.00001904423,0.02006343,0.05141855,0.007716234,0.006688601],"study_design_scores_gemma":[0.00103002,0.0001501722,0.2870824,0.0002759038,0.00023448,0.000001382974,0.001667131,0.001562728,0.6484465,0.05085787,0.008218663,0.0004727438],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9562356,0.0000103338,0.0001491237,0.0007569417,0.00004505531,0.0002888524,0.0000146492,0.00003533994,0.04246411],"genre_scores_gemma":[0.9987271,0.000003187533,0.0006295879,0.00001723156,0.0001229577,0.0000324204,0.000002595528,0.00001094974,0.0004539333],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.628383,"threshold_uncertainty_score":0.7087359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026875114","doi":"10.1145/371920.372096","title":"Finding authorities and hubs from link structures on the World Wide Web","year":2001,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":229,"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":"Link (geometry); Computer science; Link analysis; World Wide Web; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02283628608296505,"gpt":0.272730496850655,"spread":0.2498942107676899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007565689,0.0001161647,0.0001334041,0.00005840876,0.0001784341,0.0001172177,0.000136328,0.00001597451,0.003864034],"category_scores_gemma":[0.000003553964,0.00007461002,0.00006277922,0.000152628,0.0000448169,0.00004508852,0.00006823186,0.0001551602,0.000009653071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008297533,"about_ca_system_score_gemma":0.000008097764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004232122,"about_ca_topic_score_gemma":0.0003146563,"domain_scores_codex":[0.9994216,0.00003811111,0.0001239535,0.0001694066,0.00009663168,0.0001502936],"domain_scores_gemma":[0.9993037,0.0003803586,0.00004370801,0.0002244309,0.00001408381,0.00003371587],"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.00001239555,0.00001706565,0.2017439,0.000001026842,0.0001541768,0.000001568122,0.0001591621,0.00004116711,0.0002696239,0.7053575,0.04701283,0.04522954],"study_design_scores_gemma":[0.0002454842,0.00003441638,0.05039433,0.0000537165,0.00008968994,3.387025e-7,0.0007193476,0.007142568,0.004325009,0.7323825,0.2042083,0.0004042688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8351186,0.00007821612,0.003297999,0.003028901,0.0000541548,0.0001245778,0.00001355119,0.0001282102,0.1581558],"genre_scores_gemma":[0.9925334,0.000005804236,0.001295115,0.0002474666,0.0005492176,0.000010224,0.00001532618,0.000009965415,0.005333473],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1574148,"threshold_uncertainty_score":0.9970466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128965269","doi":"10.1093/bib/bbr069","title":"Hive plots--rational approach to visualizing networks","year":2011,"lang":"en","type":"article","venue":"Briefings in Bioinformatics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":222,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Canada's Michael Smith Genome Sciences Centre","funders":"BC Cancer Agency; BC Cancer Foundation; Canada's Michael Smith Genome Sciences Centre","keywords":"Plug-in; Computer science; Node (physics); Simple (philosophy); Data mining; Theoretical computer science; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.031427913772389,"gpt":0.2552130692557583,"spread":0.2237851554833693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002479402,0.0001732564,0.0002345717,0.0001711428,0.00009160844,0.00006878994,0.0002690516,0.00004686165,0.0001464075],"category_scores_gemma":[0.000008147528,0.0001750218,0.00009020282,0.0004714795,0.00003713258,0.0002649715,0.0001586099,0.0001741464,0.00003521501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003823819,"about_ca_system_score_gemma":0.00002974161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003814558,"about_ca_topic_score_gemma":0.000005867123,"domain_scores_codex":[0.9988022,0.00001951576,0.0005235796,0.0001501874,0.0001813881,0.0003231631],"domain_scores_gemma":[0.9994034,0.00003743613,0.0001607945,0.0002481867,0.00006122005,0.00008899326],"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.00005396346,0.0007710783,0.04930566,0.0000595718,0.0002304154,0.00000166618,0.01848078,0.01100567,0.00002307077,0.786787,0.06329194,0.06998919],"study_design_scores_gemma":[0.0004474999,0.00006473477,0.01003774,0.00009882099,0.00004227458,0.000003126512,0.0011306,0.9602761,0.0003171246,0.01362464,0.0132762,0.0006810881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00697715,0.00001141924,0.8144458,0.00003038699,0.00003267976,0.0002624278,0.000005525353,0.00009914852,0.1781355],"genre_scores_gemma":[0.7348212,0.000002174503,0.2639742,0.0007829204,0.0001486819,0.00006649963,0.00008155197,0.00002054727,0.0001021734],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9492705,"threshold_uncertainty_score":0.7137183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W808055529","doi":"10.14778/2850578.2850581","title":"From competition to complementarity","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":216,"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":"Complementarity (molecular biology); Computer science; Maximization; Competition (biology); Mathematical optimization; Cellular automaton; Set (abstract data type); Margin (machine learning); Theoretical computer science; Artificial intelligence; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0274108720421482,"gpt":0.2739003839945476,"spread":0.2464895119523994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001659081,0.0001021819,0.0001680766,0.0000366609,0.00005494357,0.00003417901,0.0003500013,0.00001002839,0.000248222],"category_scores_gemma":[0.000004862364,0.00007728636,0.00009467141,0.000188131,0.00002664167,0.0000660825,0.0003275182,0.0000708693,0.00001701224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006660913,"about_ca_system_score_gemma":0.00001322288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002687273,"about_ca_topic_score_gemma":0.00001908755,"domain_scores_codex":[0.9992025,0.000005731352,0.0002135987,0.0001673506,0.0002655124,0.0001452768],"domain_scores_gemma":[0.9994872,0.00001335083,0.000136297,0.0001168008,0.0001604417,0.00008586152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008203529,0.0006288564,0.4073399,0.00001583208,0.0003945342,9.84115e-8,0.00310975,0.0001018984,0.04268632,0.3564099,0.1794319,0.009798964],"study_design_scores_gemma":[0.001377281,0.0002068868,0.01831036,0.0001815042,0.0002436925,4.54109e-7,0.004154325,0.000972848,0.3997891,0.4613099,0.1129638,0.0004898339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.961085,0.00001375396,0.001761724,0.001652821,0.0001151243,0.0004903999,0.00005702271,0.00005710674,0.03476708],"genre_scores_gemma":[0.9941154,2.711365e-7,0.005347482,0.0001109262,0.0002593559,0.00004595522,0.00001492134,0.000007818317,0.00009788688],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3890295,"threshold_uncertainty_score":0.4062371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986763531","doi":"10.1103/physreve.82.036116","title":"Adaptive networks: Coevolution of disease and topology","year":2010,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":212,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Rotation formalisms in three dimensions; Coevolution; Topology (electrical circuits); Formalism (music); Computer science; Network topology; Context (archaeology); Mathematics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01134011617630887,"gpt":0.3044203574286499,"spread":0.293080241252341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007707439,0.00008678471,0.0002829272,0.00001272229,0.00002928415,0.000003723766,0.00008189665,0.000008040125,0.0001402241],"category_scores_gemma":[0.00001002904,0.0000719897,0.0001211442,0.0001206085,0.0001122622,0.00004194763,0.00006369496,0.0001411399,0.000004833003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002166855,"about_ca_system_score_gemma":0.00001240637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004256652,"about_ca_topic_score_gemma":0.000004606127,"domain_scores_codex":[0.9994956,0.0000429023,0.0001394476,0.0001460226,0.000064762,0.0001112544],"domain_scores_gemma":[0.9994925,0.0000763205,0.0000945253,0.0002073712,0.00004720809,0.00008209001],"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.00001936352,0.0002828914,0.01288409,0.0001313733,0.0001049416,3.749039e-7,0.00001960381,0.00002169997,0.0007851333,0.8533016,0.002995017,0.1294539],"study_design_scores_gemma":[0.0005954723,0.000340247,0.08516275,0.001684833,0.001989294,8.988241e-7,0.00002565912,0.1638495,0.0006596757,0.7075672,0.03715671,0.0009677551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8336266,0.02856624,0.1174916,0.001509549,0.000227971,0.001606685,0.00005641917,0.0001750338,0.01673986],"genre_scores_gemma":[0.9986448,0.000525544,0.0003542967,0.00006674742,0.0003402463,0.00003102607,0.00001334419,0.000005999796,0.00001797901],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1650182,"threshold_uncertainty_score":0.2935655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104075446","doi":"10.1109/infvis.2003.1249011","title":"Multiscale visualization of small world networks","year":2003,"lang":"en","type":"preprint","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":203,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Small-world network; Visualization; Metric (unit); Hierarchy; Theoretical computer science; Graph drawing; Complex network; Zoom; Evolving networks; Graph; Network science; Distributed computing; Data science; Data mining; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.02122898444453094,"gpt":0.2885582191907317,"spread":0.2673292347462008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001743227,0.0002484384,0.0004728407,0.0001673013,0.00003640337,0.00004090398,0.0002684797,0.00008922671,0.001985349],"category_scores_gemma":[0.000001918963,0.0002459506,0.0003093023,0.0003110699,0.00003913693,0.00002097416,0.0003762357,0.0002799738,0.000004684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002298411,"about_ca_system_score_gemma":0.00003442098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005942608,"about_ca_topic_score_gemma":0.0002018035,"domain_scores_codex":[0.998726,0.00009620406,0.0004907845,0.000361903,0.0001216964,0.0002034257],"domain_scores_gemma":[0.9988207,0.00005093872,0.0003742618,0.0005650833,0.0001358338,0.00005322854],"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.00001698084,0.0007272059,0.3636949,0.0001094101,0.0009939532,8.98908e-7,0.000117425,0.2294926,0.00006354241,0.3015852,0.04639962,0.05679827],"study_design_scores_gemma":[0.0004214144,0.00003114705,0.006016012,0.0003618269,0.0004867167,1.655019e-7,0.00003805745,0.900065,0.003124302,0.06533837,0.02300394,0.001113063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003493637,0.0001106887,0.9099665,0.00001186721,0.0001281339,0.0002878753,0.000007628829,0.00009629105,0.08589741],"genre_scores_gemma":[0.976423,0.00001037128,0.0169241,0.000029625,0.0003044955,0.00005721963,0.0003632759,0.00003605034,0.005851861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9729294,"threshold_uncertainty_score":0.9999993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141363521","doi":"10.1002/asi.10369","title":"Does citation reflect social structure?: Longitudinal evidence from the “Globenet” interdisciplinary research group","year":2003,"lang":"en","type":"article","venue":"Journal of the American Society for Information Science and Technology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":202,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada); University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Citation; Pairwise comparison; Discipline; Psychology; Sociology; Computer science; Social science; Library science; Developmental psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.04276435714950744,"gpt":0.3893523946520242,"spread":0.3465880375025168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002264363,0.0000781918,0.0001659886,0.0001593008,0.001252889,0.0001681452,0.0007318454,0.00002746217,0.000008359232],"category_scores_gemma":[0.0002332796,0.00003574717,0.0001690507,0.002694168,0.002037355,0.001046917,0.0002910561,0.0003625998,4.478237e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001070106,"about_ca_system_score_gemma":0.0001802667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003759542,"about_ca_topic_score_gemma":0.0000101327,"domain_scores_codex":[0.998729,0.00006042226,0.0003387925,0.0001018726,0.0005519197,0.0002179782],"domain_scores_gemma":[0.9976968,0.0003373302,0.000704275,0.0001974456,0.00103824,0.00002597163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001547701,0.00008621447,0.2051474,0.00002243924,0.0005562223,2.513676e-7,0.0171402,0.0001499083,0.03082902,0.1600299,0.05376325,0.5321204],"study_design_scores_gemma":[0.0007388851,0.0008080971,0.1162667,0.0001957862,0.0002275621,0.00002220094,0.09632827,0.004470746,0.01467705,0.7363779,0.02947568,0.0004111114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9707143,0.00004608457,0.02027637,0.008511739,0.000121422,0.0001945849,0.00001337129,0.00001443524,0.000107687],"genre_scores_gemma":[0.9929439,0.00001916792,0.006769771,0.0001307078,0.0001194366,0.000008886216,0.000001181288,0.000002706316,0.000004215189],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5763481,"threshold_uncertainty_score":0.9636338,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077787974","doi":"10.1080/0022250x.2001.9990243","title":"Random graph models for temporal processes in social networks","year":2001,"lang":"en","type":"article","venue":"Journal of Mathematical Sociology","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":199,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Graph; Random graph; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03364774990292631,"gpt":0.3177440464959458,"spread":0.2840962965930195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007422274,0.0001188237,0.0006056458,0.00009280006,0.00008167011,0.00001554588,0.0001940513,0.00009122457,0.0001916427],"category_scores_gemma":[0.00003783384,0.00009057282,0.0003026029,0.0001567949,0.0001282847,0.0000969121,0.00002835902,0.0002562358,0.000001036022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002339312,"about_ca_system_score_gemma":0.00005307415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003960529,"about_ca_topic_score_gemma":0.000002403228,"domain_scores_codex":[0.9988002,0.00009386108,0.0006495323,0.00009808834,0.0001023887,0.000255967],"domain_scores_gemma":[0.998733,0.0005945203,0.0003865384,0.0000637863,0.0001732604,0.00004885941],"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.00189908,0.003010351,0.04456592,0.0002614511,0.001484621,0.00003813163,0.008125759,0.02866433,0.00007144694,0.8567693,0.03630768,0.01880189],"study_design_scores_gemma":[0.001234556,0.00008263619,0.00007192693,0.00003047612,0.00006012848,0.000007386872,0.0002770009,0.02771861,0.000006496092,0.9698175,0.0005977079,0.0000955451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1174986,0.0001445295,0.8803151,0.0006759768,0.00002751078,0.0001637733,0.000001628681,0.00001107355,0.001161868],"genre_scores_gemma":[0.9901845,0.00001444028,0.00891118,0.00006393615,0.000743703,0.00002811377,0.000005993726,0.00001269408,0.00003544056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8726859,"threshold_uncertainty_score":0.3693452,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153349054","doi":"10.1098/rsif.2008.0524","title":"Spread of infectious disease through clustered populations","year":2009,"lang":"en","type":"article","venue":"Journal of The Royal Society Interface","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":190,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"BC Centre for Disease Control; University of British Columbia","funders":"","keywords":"Closeness; Cluster analysis; Transmissibility (structural dynamics); Econometrics; Statistics; Population; Infectious disease (medical specialty); Mathematics; Computer science; Disease; Demography; Medicine; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01627671940694296,"gpt":0.2981393177117541,"spread":0.2818625983048111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001276028,0.00009758273,0.0002133822,0.00001138949,0.00009046221,0.00002484765,0.0002926635,0.00002245964,0.0001304672],"category_scores_gemma":[0.000009058593,0.0000661439,0.0007772018,0.0001403313,0.00004093708,0.00008518526,0.0000673925,0.0002281943,0.000001498958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004943371,"about_ca_system_score_gemma":0.00003445818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000699123,"about_ca_topic_score_gemma":0.00000217665,"domain_scores_codex":[0.9992042,0.00005355556,0.0003805777,0.00006818855,0.0001809672,0.0001125379],"domain_scores_gemma":[0.9990478,0.00002807966,0.0005239268,0.0002179387,0.0001347187,0.00004749707],"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.0001565091,0.001404201,0.2320857,0.0000303988,0.001327693,0.000001228521,0.00474207,0.5272181,0.001223503,0.009298154,0.2087774,0.01373507],"study_design_scores_gemma":[0.003167535,0.0009790552,0.285469,0.001195048,0.002464415,0.000009926541,0.002040617,0.2069493,0.01917407,0.4594318,0.01807391,0.001045316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5238752,0.0002665302,0.4713405,0.001594377,0.0002101051,0.0001171398,0.00001062289,0.00001736553,0.002568162],"genre_scores_gemma":[0.9972422,0.000002894458,0.002030076,0.00009242397,0.0002478351,5.995281e-7,8.455092e-7,0.000006110963,0.0003770212],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.473367,"threshold_uncertainty_score":0.269727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056465001","doi":"10.1007/s11116-009-9227-7","title":"Characterizing metro networks: state, form, and structure","year":2009,"lang":"en","type":"article","venue":"Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":180,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Transport engineering; Key (lock); Network structure; State (computer science); Network planning and design; Network analysis; Graph; Transportation planning; Complex network; Operations research; Land use; Feature (linguistics); Transit (satellite); Public transport; Engineering; Distributed computing; Telecommunications; Civil engineering; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.005080035300856293,"gpt":0.228887390308981,"spread":0.2238073550081247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003448581,0.000096542,0.0001284428,0.00004346985,0.00005935086,0.00003045163,0.00004485506,0.00001812055,0.0001166952],"category_scores_gemma":[1.965466e-7,0.00009245765,0.00004283923,0.0001372965,0.00001001978,0.0001712484,8.994368e-7,0.00008069699,5.21492e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006066552,"about_ca_system_score_gemma":0.000004788725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004867641,"about_ca_topic_score_gemma":0.00005832751,"domain_scores_codex":[0.9994886,0.000008847675,0.0001629407,0.0001379929,0.00006835434,0.0001332887],"domain_scores_gemma":[0.9997665,0.000009696228,0.00007220562,0.00008929919,0.0000248457,0.00003742301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00006367022,0.00008320141,0.4211201,0.00001394942,0.000155648,0.000003651095,0.00185122,0.001755402,0.01290821,0.02330673,0.0004353853,0.5383028],"study_design_scores_gemma":[0.0002270216,0.00005035066,0.9597306,0.00001649515,0.00006710645,1.177716e-7,0.0000648272,0.004416374,0.002547891,0.03182474,0.0008642289,0.0001902364],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9282103,0.0000375895,0.07125795,0.0000653332,0.00001628205,0.00009778904,0.00002389427,0.00006389408,0.0002269521],"genre_scores_gemma":[0.9978165,0.000006395594,0.001527097,0.000076408,0.0001044327,0.000003257687,0.0004338166,0.000007036921,0.000025057],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5386105,"threshold_uncertainty_score":0.3770313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102920490","doi":"10.1145/2124295.2124368","title":"Maximizing product adoption in social networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":169,"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":"Product (mathematics); Set (abstract data type); Computer science; Opinion leadership; Viral marketing; Social network (sociolinguistics); New product development; Key (lock); Work (physics); Maximization; Marketing; Business; Advertising; World Wide Web; Psychology; Social psychology; Social media; Public relations; Engineering; Mathematics; Computer security; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.02053242328576662,"gpt":0.2761302357370934,"spread":0.2555978124513268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002040021,0.00007461407,0.000111706,0.00005064733,0.00006291766,0.00001851493,0.00006500865,0.00001569787,0.0005478664],"category_scores_gemma":[7.141205e-7,0.00007075347,0.00005988899,0.0002265249,0.00001178728,0.0001444297,0.00004417575,0.0001071271,0.00001420663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002111621,"about_ca_system_score_gemma":0.000004716487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001131959,"about_ca_topic_score_gemma":0.000008040088,"domain_scores_codex":[0.9994112,0.00003282586,0.0001349206,0.0001039123,0.0000608916,0.0002562336],"domain_scores_gemma":[0.999807,0.00001057254,0.00004065937,0.00009925805,0.00001524089,0.00002725118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.000005126103,0.000151405,0.7907942,0.000001713128,0.00002616295,1.010035e-7,0.0001588617,0.0006639429,0.00008620095,0.08733551,0.009868778,0.110908],"study_design_scores_gemma":[0.0009165431,0.00003277201,0.8360817,0.00004370121,0.0001311017,0.000001201163,0.0008810654,0.07150665,0.002256877,0.02281563,0.06404971,0.001283052],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3364372,0.0002471274,0.4843109,0.000329104,0.0001839552,0.0003610925,0.000001079907,0.0002584241,0.1778712],"genre_scores_gemma":[0.9952819,0.000001089286,0.002479089,0.00002470084,0.001916563,0.00002075488,0.00001692729,0.000008686187,0.000250229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6588448,"threshold_uncertainty_score":0.5998753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034008825","doi":"10.1287/mnsc.1060.0623","title":"Membership Herding and Network Stability in the Open Source Community: The Ising Perspective","year":2007,"lang":"en","type":"article","venue":"Management Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":164,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"RIKEN; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Herding; Herd behavior; Perspective (graphical); Stability (learning theory); Reciprocal; Computer science; Ising model; Empirical research; Econometrics; Statistical physics; Mathematics; Physics; Statistics; Geography; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04837375157801684,"gpt":0.3359819119875804,"spread":0.2876081604095636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01163428,0.00008636218,0.0001010326,0.00005606849,0.001298811,0.0005386416,0.0015729,0.000006551965,0.00004309246],"category_scores_gemma":[0.00001040149,0.0000539693,0.00002791145,0.001302577,0.0004528705,0.0002436629,0.00143106,0.0002565203,0.000001159874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008144604,"about_ca_system_score_gemma":0.000008662459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002641296,"about_ca_topic_score_gemma":0.0006327915,"domain_scores_codex":[0.9988065,0.0002472231,0.0001444689,0.0002201819,0.00025378,0.0003278266],"domain_scores_gemma":[0.998984,0.0003136237,0.00006791739,0.0005773185,0.00003052002,0.0000266006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001431021,0.0001248483,0.2276788,0.000006371113,0.00003822028,0.000001572213,0.01652516,0.0008608926,0.00002458442,0.7028733,0.0005911703,0.05126067],"study_design_scores_gemma":[0.000325945,0.00004473134,0.3290361,0.00007957329,0.00007449673,9.040663e-7,0.3247513,0.009873657,0.0001589158,0.3263261,0.008987745,0.0003404784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5439134,0.00004816319,0.05405345,0.001340874,0.00003377828,0.0008515737,3.477057e-7,0.00003280645,0.3997257],"genre_scores_gemma":[0.9983838,0.000001161956,0.001176467,0.0002932677,0.00005582119,0.00001518154,4.786178e-7,0.000003852639,0.00007001253],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4544704,"threshold_uncertainty_score":0.9989539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981377410","doi":"10.1145/2020408.2020492","title":"Sparsification of influence networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":152,"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":"Kempe Foundation","keywords":"Computer science; Cascade; Theoretical computer science; Graph; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0232945155324907,"gpt":0.2336198565520808,"spread":0.2103253410195901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000563072,0.00004164541,0.00007445685,0.00002464912,0.00001494796,0.000003042516,0.0001030025,0.00001011683,0.001113326],"category_scores_gemma":[6.26211e-7,0.00003724239,0.0000423557,0.0001264013,0.00002403019,0.0000496274,0.00002422654,0.0000324694,0.000008162066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002397763,"about_ca_system_score_gemma":0.000004501199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004470789,"about_ca_topic_score_gemma":0.000003021383,"domain_scores_codex":[0.9996787,0.00001038335,0.0001277635,0.00007519642,0.00003922318,0.00006873493],"domain_scores_gemma":[0.9996669,0.00001005364,0.00006780643,0.0001895705,0.00004783311,0.00001779339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.000005083959,0.00008564562,0.6769429,0.000001299146,0.00004361214,6.25213e-8,0.0001169949,0.0008516382,0.0004057418,0.2980766,0.001095473,0.02237488],"study_design_scores_gemma":[0.0002037365,0.00007058848,0.7959408,0.00002802729,0.0000915656,1.6005e-7,0.0001693337,0.06381533,0.04798258,0.08935805,0.00199505,0.000344793],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2953185,0.00000990509,0.5716069,0.000005505193,0.000009192609,0.00005829309,5.134564e-7,0.00004319063,0.132948],"genre_scores_gemma":[0.9941083,0.000001143909,0.005700023,0.000009236368,0.00003091194,0.000006428199,0.000004191774,0.000003336332,0.0001363986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6987899,"threshold_uncertainty_score":0.9997998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121020155","doi":"10.1109/asonam.2009.14","title":"Local Community Identification in Social Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":152,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Collegiate Athletic Association","keywords":"Computer science; Community structure; Identification (biology); Hierarchy; Data mining; Data science; Outlier; Complex network; Graph; Local community; Machine learning; Theoretical computer science; Artificial intelligence; World Wide Web; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01709537810502288,"gpt":0.2942611460251368,"spread":0.2771657679201139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002447727,0.000061389,0.0001042836,0.00004488627,0.0001495149,0.00003186306,0.0001457954,0.00002282436,0.0002234106],"category_scores_gemma":[5.987989e-7,0.00006252094,0.00005747638,0.0002434189,0.00002429003,0.00006249997,0.00002580137,0.0002303387,0.000008984106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002296831,"about_ca_system_score_gemma":0.000005600129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005001991,"about_ca_topic_score_gemma":0.00009596506,"domain_scores_codex":[0.9994654,0.0001079136,0.0001736062,0.00007316094,0.00005635858,0.000123574],"domain_scores_gemma":[0.9997329,0.00002305605,0.00004376644,0.0001612439,0.00002205914,0.00001701736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00001230916,0.0005893085,0.04158401,0.000001176014,0.00002876673,4.298152e-7,0.0003802066,0.005548155,0.0002270787,0.2859926,0.02381864,0.6418174],"study_design_scores_gemma":[0.0003481816,0.00003783474,0.5467935,0.000009822692,0.00002603404,1.567206e-7,0.0008022208,0.2121646,0.0008961739,0.2367333,0.001879233,0.000309028],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09612625,0.000006852938,0.8693058,0.0002006052,0.00001078174,0.00006789248,5.391342e-7,0.00006831497,0.03421299],"genre_scores_gemma":[0.999344,4.070174e-7,0.0001986068,0.00008369696,0.0001368914,0.000005441017,0.0000432727,0.000003222319,0.000184493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9032177,"threshold_uncertainty_score":0.254953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978323161","doi":"10.1103/physreve.84.026105","title":"Modeling the dynamical interaction between epidemics on overlay networks","year":2011,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":150,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Canadian Institutes of Health Research","keywords":"Formalism (music); Computer science; Overlay; Overlay network; Population; Distributed computing; Context (archaeology); Set (abstract data type); Theoretical computer science; Biology; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.06144235142182627,"gpt":0.3488192019550446,"spread":0.2873768505332183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002779141,0.000180375,0.0004174777,0.00001739361,0.00009398309,0.00001717739,0.0002937752,0.00001743898,0.0001230837],"category_scores_gemma":[0.00001619997,0.0001161693,0.0003743469,0.0002111735,0.00003261602,0.00008612892,0.00009764306,0.0004556197,0.00006999297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003080781,"about_ca_system_score_gemma":0.000008148281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001376889,"about_ca_topic_score_gemma":0.000001792278,"domain_scores_codex":[0.9989001,0.000156341,0.0003089637,0.0002520832,0.0001515466,0.0002309323],"domain_scores_gemma":[0.9990957,0.000232912,0.0001161539,0.0004432517,0.00004391626,0.00006802988],"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.00003386633,0.0007153155,0.01449187,0.000109248,0.0006204818,0.000001151053,0.0002339308,0.01530404,0.00003037692,0.4283836,0.009987094,0.530089],"study_design_scores_gemma":[0.00004700608,0.0000395905,0.0004712461,0.0004790651,0.0002553118,1.537489e-7,0.000009153595,0.9457912,0.00002704431,0.04982777,0.002866478,0.0001860101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1364218,0.002856444,0.8172889,0.0009869684,0.0001721831,0.001031821,0.00001317211,0.0002622701,0.04096639],"genre_scores_gemma":[0.9978236,0.0003959487,0.0002390142,0.0003991166,0.001020209,0.00005525454,0.00003294981,0.0000197267,0.00001416717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9304872,"threshold_uncertainty_score":0.4737245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2895935703","doi":"10.1177/1558689818804060","title":"Social Network Analysis: An Example of Fusion Between Quantitative and Qualitative Methods","year":2018,"lang":"en","type":"article","venue":"Journal of Mixed Methods Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":149,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Michael's Hospital; Public Health Ontario; University of Toronto","funders":"","keywords":"Centrality; Computer science; Social network analysis; Visualization; Quantitative analysis (chemistry); Data science; Subjectivity; Qualitative analysis; Qualitative property; Selection (genetic algorithm); Qualitative research; Data visualization; Social network (sociolinguistics); Data mining; Artificial intelligence; Machine learning; Sociology; Epistemology; Mathematics; Social science; Statistics; World Wide Web; Social media","retraction":null,"screen_n_in":null,"score":{"opus":0.4537575266037598,"gpt":0.6426087668313554,"spread":0.1888512402275956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.05384785,0.0001836847,0.001148178,0.0009879487,0.0004290671,0.00007214444,0.000483053,0.00009367911,0.0001994218],"category_scores_gemma":[0.0003140151,0.0001520983,0.0004269453,0.003121988,0.0007029707,0.0002553568,0.0003048189,0.000762551,0.000001324386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005031302,"about_ca_system_score_gemma":0.0001648162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008823883,"about_ca_topic_score_gemma":0.00005246739,"domain_scores_codex":[0.9748707,0.02257778,0.001034574,0.0003194867,0.0007250857,0.0004724071],"domain_scores_gemma":[0.9892862,0.006915195,0.0008848542,0.0003194258,0.002382144,0.000212227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005965534,0.0003885547,0.0231872,0.00004038629,0.009054758,0.00000292616,0.05206988,0.00009118978,0.03151881,0.0954622,0.004079321,0.7835082],"study_design_scores_gemma":[0.001110208,0.003843168,0.05460639,0.0001262667,0.002772655,0.000002053504,0.04490676,0.006511544,0.0459798,0.830108,0.009471558,0.0005615645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2382623,0.0002431465,0.7606894,0.00009208004,0.00003454388,0.0001120578,0.000006590641,0.000006014613,0.000553882],"genre_scores_gemma":[0.4058801,0.00001187023,0.5931743,0.000002715807,0.0008703738,0.000004107879,0.000007521035,0.00001384385,0.00003519336],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7829466,"threshold_uncertainty_score":0.9742628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070199170","doi":"10.1007/s13278-012-0062-z","title":"On minimizing budget and time in influence propagation over social networks","year":2012,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":147,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Viral marketing; Maximization; Task (project management); Set (abstract data type); Computer science; Budget constraint; Context (archaeology); Mathematical optimization; Selection (genetic algorithm); Mathematics; Artificial intelligence; Economics; Social media","retraction":null,"screen_n_in":null,"score":{"opus":0.006771410045472699,"gpt":0.2553418218687794,"spread":0.2485704118233067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006434823,0.0002221327,0.000527184,0.0001993645,0.0005003763,0.00007938594,0.00008318359,0.00009655108,0.000108902],"category_scores_gemma":[0.000006683209,0.0002258317,0.0001830451,0.001299333,0.00008907561,0.0002088162,0.000105551,0.0002168442,0.000001916662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003379995,"about_ca_system_score_gemma":0.00001145229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000142032,"about_ca_topic_score_gemma":0.00005043348,"domain_scores_codex":[0.9984516,0.0001652901,0.0003677245,0.0003089733,0.0001733022,0.0005331194],"domain_scores_gemma":[0.9993834,0.0001621676,0.0002339034,0.00009867712,0.0000375652,0.00008432597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00003613543,0.00008596214,0.9315463,0.000005180945,0.0008088833,7.999452e-7,0.002597302,0.006851132,0.00003819225,0.01305528,0.002111763,0.04286304],"study_design_scores_gemma":[0.000566503,0.00004277458,0.8463497,0.00005312379,0.00149645,2.742245e-7,0.0005748432,0.1453994,0.00001025592,0.004110207,0.0007248722,0.0006716724],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9906415,0.0002782454,0.006866259,0.00006547903,0.00002499966,0.0001256885,0.000002965576,0.00003965725,0.001955171],"genre_scores_gemma":[0.9975328,0.00001339772,0.0006806422,0.0001155698,0.001475282,0.00002670427,0.00005992164,0.0000187587,0.00007689439],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1385482,"threshold_uncertainty_score":0.9209148,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1700368447","doi":"10.25300/misq/2014/38.3.08","title":"Emergence of Power Laws in Online Communities: The Role Of Social Mechanisms and Preferential Attachment1","year":2014,"lang":"en","type":"article","venue":"MIS Quarterly","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":142,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Popularity; Preferential attachment; Power (physics); Online participation; Action (physics); Internet privacy; Online community; Political science; The Internet; Computer science; World Wide Web; Law; Complex network","retraction":null,"screen_n_in":null,"score":{"opus":0.007366537962974608,"gpt":0.2519133967675395,"spread":0.2445468588045649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001514082,0.00008183289,0.0001951927,0.00003803218,0.00005099917,0.00000898769,0.000191142,0.00002092879,0.0005800189],"category_scores_gemma":[4.119174e-7,0.00006537403,0.00006659827,0.00008329841,0.00006304256,0.00003468721,0.00002629996,0.0000902203,7.046294e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002284219,"about_ca_system_score_gemma":0.000006323729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001296132,"about_ca_topic_score_gemma":0.0005160373,"domain_scores_codex":[0.9993517,0.0001235018,0.0002452535,0.00007380969,0.00009980339,0.0001059369],"domain_scores_gemma":[0.9995903,0.00004322048,0.0001250534,0.0001909786,0.0000362316,0.00001415623],"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.00009421218,0.001513064,0.0666377,0.00004797022,0.0004107204,1.297526e-7,0.07504045,0.00002801409,0.03890514,0.501338,0.001448399,0.3145362],"study_design_scores_gemma":[0.002710824,0.002904607,0.09448402,0.0002199669,0.0003747325,7.160494e-7,0.236455,0.04813207,0.02398491,0.5777681,0.0118672,0.001097901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9853773,0.00002822081,0.01150136,0.00005445327,0.00001650436,0.00009784179,0.00003208444,0.00001032469,0.002881971],"genre_scores_gemma":[0.9993876,5.935202e-7,0.0004962701,0.000008593476,0.00003837233,0.000008925529,0.00003062364,0.000006174634,0.00002283557],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3134383,"threshold_uncertainty_score":0.6350799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W67958692","doi":"10.1137/1.9781611972795.51","title":"Mining Cohesive Patterns from Graphs with Feature Vectors","year":2009,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Correctness; Computer science; Subspace topology; Feature (linguistics); Theoretical computer science; Graph; Data mining; Exploit; Pruning; Feature vector; Pattern recognition (psychology); Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.006170156430280193,"gpt":0.2255315939781663,"spread":0.2193614375478861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002292804,0.0001360269,0.000174281,0.00004758931,0.00005987005,0.00004731281,0.0001278469,0.00002261275,0.000908778],"category_scores_gemma":[3.985363e-7,0.0001004865,0.00008599326,0.0001423841,0.00001245249,0.00006216754,0.0000163146,0.0001002061,0.000006244053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008143536,"about_ca_system_score_gemma":0.000009660938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000467299,"about_ca_topic_score_gemma":0.0000645241,"domain_scores_codex":[0.9994082,0.00001790429,0.00008611204,0.0002113816,0.0001090413,0.0001673396],"domain_scores_gemma":[0.999591,0.00003545649,0.00005786706,0.0002298237,0.00003337617,0.00005247959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00002035162,0.00009731644,0.9232121,8.099452e-7,0.0002415747,0.00000627297,0.0003118623,0.00003616075,0.000561527,0.01547282,0.02208767,0.0379515],"study_design_scores_gemma":[0.001032679,0.0004776276,0.8978564,0.0001686361,0.000399259,0.000001230119,0.001494325,0.001741231,0.02655237,0.0602097,0.008868374,0.001198152],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9582099,0.00002088854,0.02526859,0.0002963211,0.00001371291,0.00009251354,0.0000149762,0.0001381821,0.01594492],"genre_scores_gemma":[0.9925599,7.096719e-7,0.006573209,0.0001695047,0.0001541181,0.00000599259,0.0001041583,0.000009045748,0.0004233374],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04473687,"threshold_uncertainty_score":0.9950483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041835352","doi":"10.1145/945721.945722","title":"Analysis of SIGMOD's co-authorship graph","year":2003,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Information retrieval; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02584356087544954,"gpt":0.3026211155237821,"spread":0.2767775546483325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004807494,0.0002307631,0.0006578331,0.0005937535,0.00009567934,0.00003366883,0.0005299647,0.00007084545,0.00311633],"category_scores_gemma":[0.00005681327,0.0002228312,0.0007460293,0.002211042,0.00007841563,0.00009280713,0.00007264839,0.0002051523,0.00001939143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000203622,"about_ca_system_score_gemma":0.00003568141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004267454,"about_ca_topic_score_gemma":0.0000724631,"domain_scores_codex":[0.9982873,0.000218726,0.0004972179,0.0004100666,0.0002421434,0.0003445396],"domain_scores_gemma":[0.9979818,0.0003132996,0.0002983851,0.001176627,0.000114513,0.0001154074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001913206,0.0002424784,0.9166691,0.000007391097,0.003500434,0.000001475166,0.0001821412,0.0004229863,0.001305394,0.03366781,0.00376384,0.04021783],"study_design_scores_gemma":[0.001690059,0.0005623291,0.1053426,0.0001007946,0.01452593,0.000001594395,0.000791322,0.01223651,0.06249532,0.7069401,0.09244139,0.002872037],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8880239,0.0001026903,0.07397047,0.00006381906,0.00009474787,0.0002268277,0.00003774348,0.0001235099,0.03735631],"genre_scores_gemma":[0.9918146,0.000008360932,0.007352605,0.00002800807,0.00008361217,0.00003247668,0.00008838088,0.00002452814,0.0005674459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8113265,"threshold_uncertainty_score":0.997795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3184867432","doi":"10.1038/s41467-021-24704-6","title":"Topological measures for identifying and predicting the spread of complex contagions","year":2021,"lang":"en","type":"article","venue":"Nature Communications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":135,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; National Institutes of Health; Robert Wood Johnson Foundation","keywords":"Centrality; Social connectedness; Complex network; Computer science; Path (computing); Path length; Average path length; Betweenness centrality; Shortest path problem; Measure (data warehouse); Node (physics); Network science; Network theory; Theoretical computer science; Social network (sociolinguistics); Topology (electrical circuits); Data science; Mathematics; Data mining; Social media; Computer network; Psychology; Graph; World Wide Web; Statistics; Social psychology; Physics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.08536638279729919,"gpt":0.3784697302525729,"spread":0.2931033474552737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002214377,0.00006588775,0.0001455368,0.00002160189,0.0004075221,0.00003650904,0.0004475391,0.00004982581,0.00003403434],"category_scores_gemma":[0.00006926477,0.00005032882,0.0001028594,0.0001665048,0.0001645369,0.00003634559,0.0003540364,0.0003373323,2.544805e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007245826,"about_ca_system_score_gemma":0.00002589199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006356079,"about_ca_topic_score_gemma":0.000330967,"domain_scores_codex":[0.999412,0.0001252753,0.0001883144,0.000110419,0.00007189142,0.00009212281],"domain_scores_gemma":[0.9979985,0.0007870447,0.0001042311,0.0008465967,0.0002417788,0.00002186035],"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.000003482535,0.0001164411,0.07442181,0.000006936197,0.000201176,8.0155e-8,0.0003760838,0.000009924161,0.00508971,0.9066018,0.00418478,0.00898778],"study_design_scores_gemma":[0.001276122,0.00007509333,0.236048,0.0002237257,0.001124395,0.00001309396,0.009408814,0.03723694,0.01323975,0.3505695,0.3501222,0.0006622698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3808495,0.05690759,0.4156246,0.06468871,0.0004239522,0.003353398,0.000962301,0.0005915054,0.07659853],"genre_scores_gemma":[0.9839169,0.00007055805,0.01561937,0.00009201816,0.00005824099,0.00006126604,0.000129216,0.000005755698,0.00004669966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6030674,"threshold_uncertainty_score":0.3134372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998753427","doi":"10.1016/j.knosys.2013.01.005","title":"An improved mix framework for opinion leader identification in online learning communities","year":2013,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":133,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Novelty; Opinion leadership; Centrality; Identification (biology); Prestige; Social media; Influencer marketing; Social network (sociolinguistics); Computer science; Sentiment analysis; Knowledge management; Public relations; Data science; Psychology; Social psychology; Political science; Marketing; World Wide Web; Artificial intelligence; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.03524039814181307,"gpt":0.3298643976566982,"spread":0.2946239995148851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004836137,0.0002043872,0.0003515646,0.0002243304,0.000201171,0.0002361619,0.0003475101,0.00009747558,0.0000973933],"category_scores_gemma":[0.00001541956,0.0002067066,0.0001328903,0.0003074356,0.00005038103,0.0002109017,0.00003040198,0.0003433677,0.00004271161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007491554,"about_ca_system_score_gemma":0.00005009845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002739766,"about_ca_topic_score_gemma":0.0002341379,"domain_scores_codex":[0.998417,0.0003903438,0.0005535242,0.0002443935,0.00009394583,0.0003007817],"domain_scores_gemma":[0.9984233,0.0003932245,0.0002568537,0.0005529796,0.0003030203,0.00007056956],"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.0001532678,0.006428877,0.629383,0.001702644,0.0005923946,3.815401e-7,0.01678642,0.03831563,0.03474054,0.09043816,0.008234845,0.1732238],"study_design_scores_gemma":[0.0005558192,0.0001369175,0.005487474,0.0004698983,0.00002717374,1.272222e-7,0.009982378,0.9728191,0.0009510026,0.003865089,0.005325806,0.0003792343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3021016,0.000494634,0.6949422,0.00008814679,0.0004208175,0.001376411,0.00002948806,0.000228324,0.0003182867],"genre_scores_gemma":[0.9938868,0.000001686062,0.003045901,0.00000980441,0.0007726653,0.0009395867,0.001000226,0.00004332036,0.0002999798],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9345034,"threshold_uncertainty_score":0.8429248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2619906413","doi":"10.14778/3099622.3099623","title":"Revisiting the stop-and-stare algorithms for influence maximization","year":2017,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India","keywords":"Maximization; Scalability; Computer science; Set (abstract data type); Scaling; Order (exchange); Approximation algorithm; Mathematical optimization; Algorithm; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.0194310404711445,"gpt":0.2842343860065044,"spread":0.2648033455353598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002605816,0.00009609535,0.0001362804,0.00001762968,0.00061038,0.0001610268,0.0005178602,0.00001364628,0.000009800626],"category_scores_gemma":[0.00004187058,0.00005684004,0.00009772077,0.00004711254,0.00008218846,0.0001541217,0.0003102323,0.00007150877,3.785159e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001626297,"about_ca_system_score_gemma":0.000007866463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001175948,"about_ca_topic_score_gemma":5.201175e-7,"domain_scores_codex":[0.9993892,0.000003392644,0.0001811813,0.0001541285,0.0001335819,0.0001385254],"domain_scores_gemma":[0.9991361,0.00003365391,0.0004275284,0.0001943326,0.0001875476,0.00002078535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004279401,0.00006747612,0.333974,0.0001999182,0.0003641763,5.769846e-8,0.001663497,0.0002631289,0.01556448,0.3004269,0.002358389,0.3450752],"study_design_scores_gemma":[0.002577603,0.0001964491,0.1952994,0.001528036,0.001132183,0.000004924774,0.003998016,0.06199943,0.3047284,0.378433,0.04891759,0.001184975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.973484,0.0002410249,0.007414202,0.007660427,0.0001011298,0.001970093,0.00003764958,0.00007542432,0.009016015],"genre_scores_gemma":[0.9959675,0.00001038993,0.0034641,0.00003508741,0.000245358,0.0001111222,0.000001620419,0.000009367188,0.0001554287],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3438902,"threshold_uncertainty_score":0.4694611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159176819","doi":"10.1609/aaai.v26i1.8204","title":"Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":131,"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":"Maximization; Heuristics; Computer science; Mathematical optimization; Greedy algorithm; Heuristic; Constraint (computer-aided design); Set (abstract data type); Process (computing); Algorithm; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02270244581810292,"gpt":0.2931075849506718,"spread":0.2704051391325689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002522465,0.0002262569,0.0003397349,0.0000898158,0.0002371592,0.0001421972,0.0005069107,0.00007692857,0.0005878504],"category_scores_gemma":[0.00008369624,0.0001787121,0.00009801483,0.001064605,0.0003266365,0.0002334532,0.0001866549,0.0003603315,0.00003279754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003548637,"about_ca_system_score_gemma":0.0001060317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003615322,"about_ca_topic_score_gemma":0.000009653892,"domain_scores_codex":[0.9983012,0.00003111216,0.0004978028,0.0004294216,0.0003739563,0.0003664861],"domain_scores_gemma":[0.9984795,0.0000897256,0.0002506863,0.0001536355,0.0009699206,0.00005652593],"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.00084741,0.001847599,0.02162494,0.000103832,0.0001511653,0.000003652302,0.002871367,0.01923228,0.09010372,0.7956051,0.0005813129,0.06702764],"study_design_scores_gemma":[0.00008610907,0.0001718908,0.001131677,0.0005459802,0.00009062749,0.000002500459,0.00101677,0.5999218,0.2287518,0.1677447,0.00002665654,0.0005095406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9714627,0.00001068282,0.01627868,0.001297944,0.00003545498,0.0003692522,0.000008358794,0.00007962374,0.01045726],"genre_scores_gemma":[0.9990054,0.000003623511,0.0005237572,0.00006407355,0.0001339643,0.00004039731,0.000008174143,0.00002034406,0.0002002823],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6278604,"threshold_uncertainty_score":0.7287667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045387243","doi":"10.1103/physreve.82.046112","title":"Column generation algorithms for exact modularity maximization in networks","year":2010,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":130,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; HEC Montréal; Agence Nationale de la Recherche","keywords":"Modularity (biology); Column generation; Heuristics; Clique; Maximization; Column (typography); Mathematics; Linear programming; Computer science; Mathematical optimization; Integer programming; Algorithm; Clique problem; Combinatorics; Connection (principal bundle)","retraction":null,"screen_n_in":null,"score":{"opus":0.02811512758379235,"gpt":0.3356441094382786,"spread":0.3075289818544862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002479765,0.0001259363,0.0003289748,0.00002443863,0.00005940264,0.00003424901,0.000132996,0.00002231823,0.0001055749],"category_scores_gemma":[0.00001803968,0.00012016,0.0001843002,0.0002699794,0.00002036556,0.0001068998,0.00003564693,0.0002110048,0.000005748099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001470079,"about_ca_system_score_gemma":0.0000161761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008334166,"about_ca_topic_score_gemma":0.00004449464,"domain_scores_codex":[0.9991775,0.00004935799,0.0002392813,0.0002472556,0.0001011184,0.0001854661],"domain_scores_gemma":[0.9994294,0.0000603446,0.0001050876,0.0002751834,0.00008056879,0.00004943372],"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.00000555735,0.0006420071,0.00590456,0.0001410317,0.00005942294,3.655762e-7,0.00002577376,0.002883854,0.004228379,0.09521379,0.008200698,0.8826945],"study_design_scores_gemma":[0.000152813,0.00002049545,0.0008980245,0.00009440132,0.00006534581,1.035168e-7,7.566921e-7,0.9663085,0.0005689822,0.01899785,0.01272355,0.0001691518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06132078,0.001085847,0.9345477,0.0003537776,0.0001457267,0.001417941,0.00001559515,0.00007472694,0.00103789],"genre_scores_gemma":[0.9914835,0.000251172,0.005895425,0.00014795,0.001517936,0.0003584831,0.0002994476,0.00001708994,0.00002896259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9634247,"threshold_uncertainty_score":0.4899983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046360729","doi":"10.1214/14-aos1208","title":"Community detection in dense random networks","year":2014,"lang":"en","type":"article","venue":"The Annals of Statistics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":129,"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":"Office of Naval Research; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Bounded function; Graph; Random graph; Discrete mathematics; Clique; Upper and lower bounds; Induced subgraph isomorphism problem; Induced subgraph; Time complexity; Line graph; Voltage graph; Vertex (graph theory)","retraction":null,"screen_n_in":null,"score":{"opus":0.04442482537466764,"gpt":0.3184144351284185,"spread":0.2739896097537509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009468681,0.00007541626,0.0001864111,0.00003875463,0.0001074065,0.00001497866,0.0001883202,0.00001677115,0.00004946385],"category_scores_gemma":[0.00003978727,0.00005865442,0.00004704123,0.0001580197,0.00007384752,0.00002393261,0.00006050293,0.0002445191,0.000002701126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003507463,"about_ca_system_score_gemma":0.000005799156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00129284,"about_ca_topic_score_gemma":0.0003855927,"domain_scores_codex":[0.9990621,0.0004374336,0.0002285873,0.00005483632,0.00008120005,0.0001357966],"domain_scores_gemma":[0.9987296,0.000711885,0.0001343415,0.0003119287,0.00009031222,0.00002196012],"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.0002941343,0.0003672762,0.01511651,0.00002412413,0.0002033691,6.013314e-7,0.001092196,0.02512978,0.0003418089,0.1213589,0.01607585,0.8199954],"study_design_scores_gemma":[0.0008666093,0.0001596019,0.02952963,0.0000504251,0.00007238679,4.477021e-7,0.0003007202,0.491785,0.004353151,0.4694897,0.003157764,0.0002345365],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1414997,0.00002018277,0.8567861,0.00006923924,0.00002026797,0.00008273779,0.00001773365,0.0000143299,0.001489716],"genre_scores_gemma":[0.9984767,0.00001307403,0.00128451,0.00006751603,0.00008799674,0.000008206832,0.00002029928,0.000007749148,0.00003397592],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.856977,"threshold_uncertainty_score":0.2391858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}